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=10
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the additive complexity of polynomials
C.P. Schnorr
,
J.P. van de Wiele
Theoretical Computer Science
10
(1), 1980, pp. 1-18
On equations for regular languages, finite automata and sequential networks
J.A. Brzozowski
,
E. Liess
Theoretical Computer Science
10
(1), 1980, pp. 19-35
Applicability of a production in a categorical grammer
P. Kůrka
Theoretical Computer Science
10
(1), 1980, pp. 37-44
Every two equivalent DOL systems have a regular true envelope
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
10
(1), 1980, pp. 45-52
Multiplicative comlexity of some rational functions
W. Hartmann
,
P. Schuster
Theoretical Computer Science
10
(1), 1980, pp. 53-61
Lexicographic generation of ordered trees
S. Zaks
Theoretical Computer Science
10
(1), 1980, pp. 63-82
A 3
n
-lower bound on the network complexity of Boolean functions
C.P. Schnorr
Theoretical Computer Science
10
(1), 1980, pp. 83-92
Inferences of multivalued dependencies in fixed and undetermined universes
J. Biskup
Theoretical Computer Science
10
(1), 1980, pp. 93-105
On the interpolation of DOL-sequences
H. Prodinger
Theoretical Computer Science
10
(1), 1980, pp. 107-108
The directed subgraph homeomorphism problem
S. Fortune
,
J. Hopcroft
,
J. Wyllie
Theoretical Computer Science
10
(2), 1980, pp. 111-121
P-optimal heuristics
K. Lieberherr
Theoretical Computer Science
10
(2), 1980, pp. 123-131
Computing with infinite objects
E. Wiedmer
Theoretical Computer Science
10
(2), 1980, pp. 133-155
On some properties of very pure codes
A. de Luca
,
A. Restivo
Theoretical Computer Science
10
(2), 1980, pp. 157-170
Computation on graph-like expressions
J. Staples
Theoretical Computer Science
10
(2), 1980, pp. 171-185
On branching and looping, Part I
I.M. Havel
Theoretical Computer Science
10
(2), 1980, pp. 187-220
Complexity of Boolean algebras
D. Kozen
Theoretical Computer Science
10
(3), 1980, pp. 221-247
On the complexity of
\omega
-type Turing acceptors
R.S. Cohen
,
A.Y. Gold
Theoretical Computer Science
10
(3), 1980, pp. 249-272
On branching and looping, Part II
I.M. Havel
Theoretical Computer Science
10
(3), 1980, pp. 273-295
Optimal evaluations of graph-like expressions
J. Staples
Theoretical Computer Science
10
(3), 1980, pp. 297-316
Iteration theorems for families of strict deterministic languages
K.N. King
Theoretical Computer Science
10
(3), 1980, pp. 317-333
Halting space-bounded computations
M. Sipser
Theoretical Computer Science
10
(3), 1980, pp. 335-338