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
[2]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=1981
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Remark on the star-height-problem (Note)
W. Thomas
Theoretical Computer Science
13
, 1981, pp. 231-237
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness II
J.H. Gallier
Theoretical Computer Science
13
, 1981, pp. 239-270
Generalized Galois theory and its applications to complexity
Erwin Engeler
Theoretical Computer Science
13
, 1981, pp. 271-293
The complexity of the equivalence problem for two characterizations of Presburger sets
E.M. Gurari
,
O.H. Ibarra
Theoretical Computer Science
13
, 1981, pp. 295-314
A comparison of two variations of a pebble game on graphs (Note)
F. Meyer auf der Heide
Theoretical Computer Science
13
, 1981, pp. 315-322
Succinct representation of regular languages by Boolean automata (Note)
E. Leiss
Theoretical Computer Science
13
, 1981, pp. 323-330
Linear-time string-matching using only a fixed number of local storage locations (Note)
Z. Galil
,
J. Seiferas
Theoretical Computer Science
13
, 1981, pp. 331-336
Seiten
<
1
2
3
4