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=Theor.~Comput.~Sci. AND Volume=4
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on Schnorr's separatedness
D.J. Lehmann
Theoretical Computer Science
4
(2), 1977, pp. 235
Fully abstract models of types
\lambda
-calculi
R. Milner
Theoretical Computer Science
4
(1), 1977, pp. 1-22
On the complexity of regular resolution and the Davis-Putnam procedure
Zvi Galil
Theoretical Computer Science
4
(1), 1977, pp. 23-46
Sur une variante des fonctions séquentielles
M.P. Schützenberger
Theoretical Computer Science
4
(1), 1977, pp. 47-57
Algebraic structures for transitive closure
D.J. Lehmann
Theoretical Computer Science
4
(1), 1977, pp. 59-76
Comment vérifier l'associativité d'une table de groupe
J. Vuillemin
Theoretical Computer Science
4
(1), 1977, pp. 77-82
A decidability result for deterministic
\omega
-context-free languages
M. Linna
Theoretical Computer Science
4
(1), 1977, pp. 83-98
Decidable problems on the strong connectivity of Petri net reachability sets
Toshior Araki
,
Tadao Kasami
Theoretical Computer Science
4
(1), 1977, pp. 99-119
Categories of chain-complete posets
G. Markowsky
Theoretical Computer Science
4
(2), 1977, pp. 125-135
The retracts in
P\omega
do not form a continuous lattice -- A solution to Scott's problem
C. Hoseno
,
M. Sato
Theoretical Computer Science
4
(2), 1977, pp. 137-142
Economy of description by parsers, DPDA's and PDA's
M.M. Geller
,
H.B. Hunt III
,
T.G. Szymanski
,
J.D. Ullman
Theoretical Computer Science
4
(2), 1977, pp. 143-153
On the analysis of algorithms for trees
J. Françon
Theoretical Computer Science
4
(2), 1977, pp. 155-169
On the paging-complexity of periodic arrangements
H.G. Stork
Theoretical Computer Science
4
(2), 1977, pp. 171-197
On the form equivalence of
L
-forms
H. Maurer
,
Th. Ottmann
,
A. Salomaa
Theoretical Computer Science
4
(2), 1977, pp. 199-225
An efficient procedure for the theory of rational order
J. Ferrante
,
J.R. Geiser
Theoretical Computer Science
4
(2), 1977, pp. 227-233
The Euclidean traveling salesman problem is
NP
-complete
C.H. Papadimitriou
Theoretical Computer Science
4
(3), 1977, pp. 237-244
On LR(k) grammars and languages
M.M. Geller
,
M.A. Harrison
Theoretical Computer Science
4
(3), 1977, pp. 245-276
Complexity of some problems in Petri nets
Neil D. Jones
,
L.H. Landweber
,
Y.E. Lien
Theoretical Computer Science
4
(3), 1977, pp. 277-299
On the inference of optimal descriptions
R. Daley
Theoretical Computer Science
4
(3), 1977, pp. 301-319
A direct algorithm for checking equivalence of LL(
k
) grammars
T. Olshansky
,
A. Pnueli
Theoretical Computer Science
4
(3), 1977, pp. 321-349