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=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Effects of updates on optimality in tries
D. Comer
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 1-13
Restricted one counter languages
M. Latteux
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 14-33
Context free normal systems and ETOL systems
A. Ehrenfeucht
,
J. Engelfriet
,
G. Rozenberg
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 34-46
On the zero-inequivalence problem for loop programs
O.H. Ibarra
,
B.S. Leininger
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 47-64
Size-space tradeoffs for oblivious computations
D.A. Carlson
,
J.E. Savage
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 65-81
Checking sets, test sets, rich languages and commutatively closed languages
J. Albert
,
D. Wood
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 82-91
Multiplicative complexity and algebraic structure
D. Riffelmacher
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 92-106
On the transformation semigroups of finite automata
T. Watanabe
,
A. Nakamura
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 107-138
Network structure and the firing squad synchronization problem
J.J. Grefenstette
Journal of Computer and System Sciences
26
(1), 1983, February, pp. 139-152
Lower bounds on the size of deterministic parsers
E. Ukkonen
Journal of Computer and System Sciences
26
(2), 1983, April, pp. 153-170
On the equality of grammatical families
S. Ginsburg
,
J. Goldstine
,
E.H. Spanier
Journal of Computer and System Sciences
26
(2), 1983, April, pp. 171-196
Edge-contraction problems
T. Asano
,
T. Hirata
Journal of Computer and System Sciences
26
(2), 1983, April, pp. 197-208
On self-reducibility and weak p-selectivity
Ker-I Ko
Journal of Computer and System Sciences
26
(2), 1983, April, pp. 209-221
Propositional dynamic logic of nonregular programs
D. Harel
,
A. Pnueli
,
J. Stavi
Journal of Computer and System Sciences
26
(2), 1983, April, pp. 222-243
On the complexity of LL(k) testing
S. Sippu
,
E. Soisalon-Soininen
Journal of Computer and System Sciences
26
(2), 1983, April, pp. 244-268
Computation of Boolean functions on networks of binary automata
M. Tchuente
Journal of Computer and System Sciences
26
(2), 1983, April, pp. 269-277
Time-space-optimal string matching
Z. Galil
,
J. Seiferas
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 280-294
Groups, the theory of ends, and context-free languages
D.E. Muller
,
P.E. Schupp
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 295-310
Polynomial time computations in models of ET
D. Joseph
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 311-338
An asymptotically optimal layout for the shuffle-exchange graph
D. Kleitman
,
F.T. Leighton
,
M. Lepley
,
G.L. Miller
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 339-361
A data structure for dynamic trees
D.D. Sleator
,
R.E. Tarjan
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 362-391
Lower bounds for the cycle detection problem
F.E. Fich
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 392-409
A view of computability on term algebras
K.N. Venkataraman
,
A. Yasuhara
,
F.M. Hawrusik
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 410-471