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=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of time complexity by simple loop programs
T. Kasai
,
A. Adachi
Journal of Computer and System Sciences
20
(1), 1980, February, pp. 1-17
A faster algorithm computing string edit distances
W.J. Masek
,
M.S. Paterson
Journal of Computer and System Sciences
20
(1), 1980, February, pp. 18-31
Languages of r-trivial monoids
J.A. Brzozowski
,
F.E. Fich
Journal of Computer and System Sciences
20
(1), 1980, February, pp. 32-49
On finding minimal length superstrings
J. Gallant
,
D. Maier
,
J.A. Storer
Journal of Computer and System Sciences
20
(1), 1980, February, pp. 50-58
One-way weak-stack-counter automata
S. Miyano
Journal of Computer and System Sciences
20
(1), 1980, February, pp. 59-76
On the complexity of computing bilinear forms with (o,1) constants
T. Gonzalez
,
J. Jájá
Journal of Computer and System Sciences
20
(1), 1980, February, pp. 77-95
A proof system for the first-order relational calculus
M.C.B. Hennessy
Journal of Computer and System Sciences
20
(1), 1980, February, pp. 96-110
Recognition of topological equivalence of patterns by array automata
P. Dietz
,
S. Rao Kosaraju
Journal of Computer and System Sciences
20
(1), 1980, February, pp. 111-116
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
M. Tompa
Journal of Computer and System Sciences
20
(2), 1980, April, pp. 118-132
The subgraph homeomorphism problem
A.S. Lapaugh
,
R.L. Rivest
Journal of Computer and System Sciences
20
(2), 1980, April, pp. 133-149
Tree transducers, l systems, and two-way machines
J. Engelfriet
,
G. Rozenberg
,
G. Slutzki
Journal of Computer and System Sciences
20
(2), 1980, April, pp. 150-202
On formulating simultaneity for studying parallelism and synchronization
R.E. Miller
,
C.K. Yap
Journal of Computer and System Sciences
20
(2), 1980, April, pp. 203-218
The node-deletion problem for hereditary properties is NP-complete
J.M. Lewis
,
M. Yannakakis
Journal of Computer and System Sciences
20
(2), 1980, April, pp. 219-230
A near-optimal method for reasoning about action
V.R. Pratt
Journal of Computer and System Sciences
20
(2), 1980, April, pp. 231-254
An algorithm for imbedding cubic graphs in the torus
I.S. Filotti
Journal of Computer and System Sciences
20
(2), 1980, April, pp. 255-276
Vector addition systems and regular languages
A. Ginzburg
,
M. Yoeli
Journal of Computer and System Sciences
20
(3), 1980, June, pp. 277-284
Adherences of languages
Luc Boasson
,
Maurice Nivat
Journal of Computer and System Sciences
20
(3), 1980, June, pp. 285-309
The interaction of integrity constraints in an information system
J. Paredaens
Journal of Computer and System Sciences
20
(3), 1980, June, pp. 310-329
Foundations of system theory: the Hankel matrix
M.A. Arbib
,
E.G. Manes
Journal of Computer and System Sciences
20
(3), 1980, June, pp. 330-378
Test sets and checking words for homomorphism equivalence
K. Culik II
,
A. Salomaa
Journal of Computer and System Sciences
20
(3), 1980, June, pp. 379-395
Coping with errors in binary search procedures
R.L. Rivest
,
A.R. Meyer
,
D.J. Kleitman
,
K. Winklmann
,
J. Spencer
Journal of Computer and System Sciences
20
(3), 1980, June, pp. 396-404