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=32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On graph rewritings
J.C. Raoult
Theoretical Computer Science
32
(1,2), 1984, pp. 1-24
A linear-history semantics for languages for distributed programming
N. Francez
,
D. Lehmann
,
A. Pnueli
Theoretical Computer Science
32
(1,2), 1984, pp. 25-46
Linear indexed languages
J. Duske
,
R. Parchmann
Theoretical Computer Science
32
(1,2), 1984, pp. 47-60
The Nielsen reduction and P-complete problems in free groups
J. Avenhaus
,
K. Madlener
Theoretical Computer Science
32
(1,2), 1984, pp. 61-76
Efficient inference control for range sum queries
F.Y. Chin
,
P. Kossowski
,
S.C. Loh
Theoretical Computer Science
32
(1,2), 1984, pp. 77-86
An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
E. Tomita
Theoretical Computer Science
32
(1,2), 1984, pp. 87-120
Distributive semantics for nondeterministic typed
\lambda
-calculi
E. Astesiano
,
G. Costa
Theoretical Computer Science
32
(1,2), 1984, pp. 121-156
A parallel-design distributed-implementation (PDDI) general-purpose computer
U. Vishkin
Theoretical Computer Science
32
(1,2), 1984, pp. 157-172
Petri nets and large finite sets
K. McAloon
Theoretical Computer Science
32
(1,2), 1984, pp. 173-183
Connections in acyclic hypergraphs
D. Maier
,
J.D. Ullman
Theoretical Computer Science
32
(1,2), 1984, pp. 185-199
Biprefix codes, inverse semigroups and syntactic monoids of injective automata
T.E. Hall
Theoretical Computer Science
32
(1,2), 1984, pp. 201-213
A geometric contruction of a superconcentrator of depth 2
R. Meshulam
Theoretical Computer Science
32
(1,2), 1984, pp. 215-219
A tradeoff theorem for space and reversal
J.-W. Hong
Theoretical Computer Science
32
(1,2), 1984, pp. 221-224
Iterative tree automata
K. Culik II
,
S. Yu
Theoretical Computer Science
32
(3), 1984, pp. 227-247
Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
F. Otto
Theoretical Computer Science
32
(3), 1984, pp. 249-260
The undecidability of form equivalence for context-free and EOL forms
V. Niemi
Theoretical Computer Science
32
(3), 1984, pp. 261-277
On the complexity of intersection and conjugacy problems in free groups
J. Avenhaus
,
K. Madlener
Theoretical Computer Science
32
(3), 1984, pp. 279-295
A decidable fragment of predicate calculus
J. Ketonen
,
R. Weyhrauch
Theoretical Computer Science
32
(3), 1984, pp. 297-307
Some machines defined by directed graphs
N.G. de Bruijn
Theoretical Computer Science
32
(3), 1984, pp. 309-319
Alternating finite automata on
\omega
-words
S. Miyano
,
T. Hayashi
Theoretical Computer Science
32
(3), 1984, pp. 321-330
Projection lemmas for
\omega
-languages
L. Staiger
Theoretical Computer Science
32
(3), 1984, pp. 331-337
On formal power series defined by infinite linear systems
G. Jacob
,
C. Reutenauer
Theoretical Computer Science
32
(3), 1984, pp. 339-340