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=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Word operation definable in the typed lambda -calculus
M. Zaionc
Theoretical Computer Science
52
(1-2), 1987, pp. 1-14
On helping by robust oracle machines
K.I. Ko
Theoretical Computer Science
52
(1-2), 1987, pp. 15-36
On 'On graph rewritings'
R. Kennaway
Theoretical Computer Science
52
(1-2), 1987, pp. 37-58
On regular trace languages
J. Sakarovitch
Theoretical Computer Science
52
(1-2), 1987, pp. 59-75
Factoring polynomials and primitive elements for special primes
Joachim von zur Gathen
Theoretical Computer Science
52
(1/2), 1987, pp. 77-89
A Yacc extension for LRR grammar parsing
B. Seite
Theoretical Computer Science
52
(1-2), 1987, pp. 91-143
Satisfiability in many-valued sentential logic is
NP
-complete
D. Mundici
Theoretical Computer Science
52
(1-2), 1987, pp. 145-153
The parallel complexity of deadlock detection
P. Spirakis
Theoretical Computer Science
52
(1-2), 1987, pp. 155-163
Topological characterizations of infinite tree languages
T. Moriya
Theoretical Computer Science
52
(1-2), 1987, pp. 165-171
The membership and equivalence problems for picture languages
C. Kim
,
I.H. Sudborough
Theoretical Computer Science
52
(3), 1987, pp. 177-191
Distributed sorting algorithms for multi-channel broadcast networks
J.M. Marberg
,
E. Gafni
Theoretical Computer Science
52
(3), 1987, pp. 193-203
A syntactic theory of sequential control
M. Felleisen
,
D.P. Friedman
,
E. Kohlbecker
,
B. Duba
Theoretical Computer Science
52
(3), 1987, pp. 205-237
Models of lower-bounds proofs
R.G. Nigmatullin
Theoretical Computer Science
52
(3), 1987, pp. 239-249
On characterizations of the class PSPACE/poly
J.L. Balcázar
,
J. Díaz
,
J. Gabarró
Theoretical Computer Science
52
(3), 1987, pp. 251-267
Stationary deterministic flows. II. The single-server queue
E. Gelenbe
,
D. Finkel
Theoretical Computer Science
52
(3), 1987, pp. 269-280
Domain-independent formulas and databases
R.W. Topor
Theoretical Computer Science
52
(3), 1987, pp. 281-306
On flowchart theories. II. The nondeterministic case
G. Stefanescu
Theoretical Computer Science
52
(3), 1987, pp. 307-340
Comments on 'Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages'
F.J. Brandenburg
Theoretical Computer Science
52
(3), 1987, pp. 341-342