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=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decision procedures and expressiveness in the temporal logic of branching time
E.A. Emerson
,
J.Y. Halpern
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 1-24
Tree pushdown automata
K.M. Schimpf
,
J.H. Gallier
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 25-40
A multiprocess network logic with temporal and spatial modalities
J. Reif
,
A.P. Sistla
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 41-53
A linear algorithm for embedding planar graphs using PQ-trees
N. Chiba
,
T. Nishizeki
,
S. Abe
,
T. Ozawa
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 54-76
Variations on the technique of Duris and Galil (automata theory)
M. Chrobak
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 77-85
Hierarchies of hyper-AFLs
J. Engelfriet
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 86-115
Solitaire automata
R.E. Ladner
,
J.K. Norman
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 116-129
Routing, merging, and sorting on parallel models of computation
A. Borodin
,
J.E. Hopcroft
Journal of Computer and System Sciences
30
(1), 1985, February, pp. 130-145
Speedups of deterministic machines by synchronous parallel machines
P.W. Dymond
,
M. Tompa
Journal of Computer and System Sciences
30
(2), 1985, April, pp. 149-161
A probabilistic PDL
D. Kozen
Journal of Computer and System Sciences
30
(2), 1985, April, pp. 162-178
Solvability by radicals is in polynomial time
S. Landau
,
G.L. Miller
Journal of Computer and System Sciences
30
(2), 1985, April, pp. 179-208
A linear-time algorithm for a special case of disjoint set union
H.N. Gabow
,
R.E. Tarjan
Journal of Computer and System Sciences
30
(2), 1985, April, pp. 209-221
Unbounded fan-in circuits and associative functions
A.K. Chandra
,
S. Fortune
,
R. Lipton
Journal of Computer and System Sciences
30
(2), 1985, April, pp. 222-234
Factoring multivariate polynomials over finite fields
A.K. Lenstra
Journal of Computer and System Sciences
30
(2), 1985, April, pp. 235-248
Pattern selector grammars and several parsing algorithms in the context-free style
J. Gonczarowski
,
E. Shamir
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 249-273
Cost functors and optimal realization (automata)
A. Bahamonde
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 274-290
Dynamical characteristics of linear cellular automata
H. Aso
,
N. Honda
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 291-317
Free semiring-representations and nondeterminism
M.G. Main
,
D.B. Benson
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 318-328
Area-period tradeoffs for multiplication of rectangular matrices
Ferng-Ching Lin
,
I-Chen Wu
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 329-342
Complexity of certain decision problems about congruential languages
P. Narendran
,
C. O'DĂșnlaing
,
H. Rolletschek
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 343-358
Sylow's theorem in polynomial time
W.M. Kantor
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 359-394
Qualitative relativizations of complexity classes
R.V. Book
,
T.J. Long
,
A.L. Selman
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 395-413