Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Comput.~Syst.~Sci. AND YEAR=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of facets resolved
Christos H. Papadimitriou
,
David Wolfe
Journal of Computer and System Sciences
37
, 1988, pp. 2-13
The complexity of recognizing polyhedral scenes
Lefteris M. Kirousis
,
Christos H. Papadimitriou
Journal of Computer and System Sciences
37
, 1988, pp. 14-38
Parallel algorithms for solvable permutation groups
Eugene M. Luks
,
Pierre McKenzie
Journal of Computer and System Sciences
37
, 1988, pp. 39-62
Fast string matching with
k
differences
Gad M. Landau
,
Uzi Vishkin
Journal of Computer and System Sciences
37
, 1988, pp. 63-78
Simulating two pushdown stores by one tape in
O(n^{1.5}\sqrt{\log n})
time
Ming Li
Journal of Computer and System Sciences
37
, 1988, pp. 101-116
Meanders and their applications in lower bounds arguments
Noga Alon
,
Wolfgang Maass
Journal of Computer and System Sciences
37
, 1988, pp. 118-129
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
Prabhakar Raghavan
Journal of Computer and System Sciences
37
, 1988, pp. 130-143
k + 1
heads are better than
k
for PDAs
Marek Chrobak
,
Ming Li
Journal of Computer and System Sciences
37
, 1988, pp. 144-155
Minimum disclosure proofs of knowledge
Gilles Brassard
,
David Chaum
,
Claude Crépeau
Journal of Computer and System Sciences
37
, 1988, pp. 156-189
An efficient parallel algorithm for planarity
Philip N. Klein
,
John H. Reif
Journal of Computer and System Sciences
37
, 1988, pp. 190-246
Collapsing degrees
Stuart A. Kurtz
,
Stephen R. Mahaney
,
James S. Royer
Journal of Computer and System Sciences
37
, 1988, pp. 247-268
Pushdown automata with reversal-bounded counters
Tat-Hung Chan
Journal of Computer and System Sciences
37
, 1988, pp. 269-291
On locating minimum feedback vertex sets
Errol L. Lloyd
,
Mary Lou Soffa
Journal of Computer and System Sciences
37
, 1988, pp. 292-311
Graph isomorphism is in the low hierarchy
Uwe Schöning
Journal of Computer and System Sciences
37
, 1988, pp. 312-323
An unpredictability approach to finite-state randomness
Mary G. O'Connor
Journal of Computer and System Sciences
37
, 1988, pp. 324-336
Distributed algorithms for selection in sets
Greg N. Frederickson
Journal of Computer and System Sciences
37
, 1988, pp. 337-348
Completeness results for conflict-free vector replacement systems
Rodney R. Howell
,
Louis E. Rosier
Journal of Computer and System Sciences
37
, 1988, pp. 349-366
Deterministic tree pushdown automata and monadic tree rewriting systems
Kai Salomaa
Journal of Computer and System Sciences
37
, 1988, pp. 367-394
Correction to ``Computational complexity of algebraic functions''
Nicholas Pippenger
Journal of Computer and System Sciences
37
, 1988, pp. 395-399
Parallel computation with threshold functions
Ian Parberry
,
Georg Schnitger
Journal of Computer and System Sciences
36
, 1988, pp. 278-302
A measure of relativized space which is faithful with respect to depth
Christopher B. Wilson
Journal of Computer and System Sciences
36
, 1988, pp. 303-312
Lower bounds arguments with ``inaccessible'' numbers
Martin Dietzfelbinger
,
Wolfgang Maass
Journal of Computer and System Sciences
36
, 1988, pp. 313-335
Isomorphisms and 1-L reductions
Eric W. Allender
Journal of Computer and System Sciences
36
, 1988, pp. 336-350
Relativized alternation and space-bounded computation
Jonathan F. Buss
Journal of Computer and System Sciences
36
, 1988, pp. 351-378
Expanders, randomness, or time versus space
Michael Sipser
Journal of Computer and System Sciences
36
, 1988, pp. 379-383
Seiten 1
2
>