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 Volume=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Group actions and learning for a family of automata
P. Baldi
Journal of Computer and System Sciences
36
(1), 1988, February, pp. 1-15
On alternating
\omega
-automata
P.A. Lindsay
Journal of Computer and System Sciences
36
(1), 1988, February, pp. 16-24
Automorphism groups and factor automata of strongly connected automata
M. Katsura
Journal of Computer and System Sciences
36
(1), 1988, February, pp. 25-65
Independence of the equational axioms for iteration theories
Z. ésik
Journal of Computer and System Sciences
36
(1), 1988, February, pp. 66-76
Multilevel nested relational structures
D. van Gucht
,
P.C. Fischer
Journal of Computer and System Sciences
36
(1), 1988, February, pp. 77-105
White pebbles help
R. Wilber
Journal of Computer and System Sciences
36
(2), 1988, April, pp. 108-124
A simple three-dimensional real-time reliable cellular array
P. Gacs
,
J. Reif
Journal of Computer and System Sciences
36
(2), 1988, April, pp. 125-147
Self-organizing sequential search and Hilbert's inequalities
F.R.K. Chung
,
D.J. Hajela
,
P.D. Seymour
Journal of Computer and System Sciences
36
(2), 1988, April, pp. 148-157
Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
J.W. de Bakker
,
J.-J.C. Meyer
,
E.-R. Olderog
,
J.I. Zucker
Journal of Computer and System Sciences
36
(2), 1988, April, pp. 158-224
The complexity of parallel search
R.M. Karp
,
E. Upfal
,
A. Wigderson
Journal of Computer and System Sciences
36
(2), 1988, April, pp. 225-253
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes
L. Babai
,
S. Moran
Journal of Computer and System Sciences
36
(2), 1988, April, pp. 254-276
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
The topology of provability in complexity theory
Kenneth W. Regan
Journal of Computer and System Sciences
36
, 1988, pp. 384-432
Probabilistic quantifiers and games
Stathis Zachos
Journal of Computer and System Sciences
36
, 1988, pp. 433-451
Probabilistic game automata
Anne Condon
,
Richard E. Ladner
Journal of Computer and System Sciences
36
, 1988, pp. 452-489
The complexity of optimization problems
Mark W. Krentel
Journal of Computer and System Sciences
36
, 1988, pp. 490-509