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=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The inclusion problem for some classes of deterministic multitape automata
E.B. Kinber
Theoretical Computer Science
26
(1,2), 1983, pp. 1-24
Bandwidth constraints on problems complete for polynomial time
I.H. Sudborough
Theoretical Computer Science
26
(1,2), 1983, pp. 25-52
On infinite computations in denotational semantics
J.W. de Bakker
,
J.-J.Ch. Meyer
,
J.I. Zucker
Theoretical Computer Science
26
(1,2), 1983, pp. 53-82
Nivat's processing systems: Decision problems related to protection and synchronization
S. Istrail
,
C. Masalagiu
Theoretical Computer Science
26
(1,2), 1983, pp. 83-102
A more complete model of communicating processes
E.C.R. Hehner
,
C.A.R. Hoare
Theoretical Computer Science
26
(1,2), 1983, pp. 105-120
Alternative semantics for temporal logics
E.A. Emerson
Theoretical Computer Science
26
(1,2), 1983, pp. 121-130
Admissible representations of effective cpo's
K. Weihrauch
,
G. Scháfer
Theoretical Computer Science
26
(1,2), 1983, pp. 131-147
Order dependency in the relational model
S. Ginsburg
,
R. Hull
Theoretical Computer Science
26
(1,2), 1983, pp. 149-195
Simple programming languages and restricted classes of Turing machines
O.H. Ibarra
,
L.E. Rosier
Theoretical Computer Science
26
(1,2), 1983, pp. 197-220
Rational
\omega
-languages are non-ambiguous
A. Arnold
Theoretical Computer Science
26
(1,2), 1983, pp. 221-223
Determinism in parallel systems
V. Rajlich
Theoretical Computer Science
26
(1,2), 1983, pp. 225-231
It is decidable whether a regular language is pure context-free
W. Bucher
,
J. Hagauer
Theoretical Computer Science
26
(1,2), 1983, pp. 233-241
Characterizations for functional dependency and Boyce-Codd normal form families
S. Ginsburg
,
R. Hull
Theoretical Computer Science
26
(3), 1983, pp. 243-286
Some consequences of non-uniform conditions on uniform classes
C.K. Yap
Theoretical Computer Science
26
(3), 1983, pp. 287-300
Subset languages of Petri nets. Part I: The relationship to string languages and normal forms
G. Rozenberg
,
R. Verraedt
Theoretical Computer Science
26
(3), 1983, pp. 301-326
A Turing machine time hierarchy
S. Zák
Theoretical Computer Science
26
(3), 1983, pp. 327-333
On Gödel speed-up and succinctness of language representations
J. Hartmanis
Theoretical Computer Science
26
(3), 1983, pp. 335-342
Computing the behaviour of asynchronous processes
J. Staples
,
V.L. Nguyen
Theoretical Computer Science
26
(3), 1983, pp. 343-353