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=11
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comments on ``Tautology testing with a generalized matrix reduction method''
M. Ben-Ari
Theoretical Computer Science
11
, 1980, pp. 341
The complexity of linear programming
D.P. Dobkin
,
S.P. Reiss
Theoretical Computer Science
11
, 1980, pp. 1-18
Invertible terms in the lambda calculus
J.A. Bergstra
,
J.W. Klop
Theoretical Computer Science
11
, 1980, pp. 19-37
Speeding up subtree replacement systems
J. Staples
Theoretical Computer Science
11
, 1980, pp. 39-47
On another Boolean matrix
N. Pippenger
Theoretical Computer Science
11
, 1980, pp. 49-56
On time-space classes and their relation to the theory of real addition
A.R. Bruss
,
A.R. Meyer
Theoretical Computer Science
11
, 1980, pp. 59-69
The complexity of logical theories
L. Berman
Theoretical Computer Science
11
, 1980, pp. 71-77
A complete axiom system for rational sets with multiplicity
M. Morisaki
,
K. Sakai
Theoretical Computer Science
11
, 1980, pp. 79-92
Complexity of dimension three and some related edge-covering characteristics of graphs
L. Kuc̑era
,
J. Nes̑etȓil
,
A. Pultr
Theoretical Computer Science
11
, 1980, pp. 93-106
Eine neue Invariante für kontextfreie Sprachen
G. Hotz
Theoretical Computer Science
11
, 1980, pp. 107-116
Graph theoretic models
F. Harary
Theoretical Computer Science
11
, 1980, pp. 117-121
The reachability problem for Petri nets and decision problems for Skolem arithmetic
E. Börger
,
H. Kleine Büning
Theoretical Computer Science
11
, 1980, pp. 123-143
Uniform data encodings
A.L. Rosenberg
,
L.J. Stockmeyer
,
L. Snyder
Theoretical Computer Science
11
, 1980, pp. 145-165
On the structure of free finite state machines
W.M. Beynon
Theoretical Computer Science
11
, 1980, pp. 167-180
Metric interpretations of infinite trees and semantics of non deterministic recursive programs
A. Arnold
,
M. Nivat
Theoretical Computer Science
11
, 1980, pp. 181-205
Algorithme explicite pour la recherche du P.G.C.D. dans certains anneaux principaux d'entiers de corps de nombres
B. Bougaut
Theoretical Computer Science
11
, 1980, pp. 207-220
Automates à file (Note)
B. Vauquelin
,
P. Franchi-Zannettacci
Theoretical Computer Science
11
, 1980, pp. 221-225
A mathematical semantics for a nondeterministic typed
\lambda
-calculus
M.C.B. Hennessy
,
E.A. Ashcroft
Theoretical Computer Science
11
, 1980, pp. 227-245
Parallelism and concurrency of graph manipulations
H. Ehrig
,
B.K. Rosen
Theoretical Computer Science
11
, 1980, pp. 247-275
Indexings of subrecursive classes
D. Kozen
Theoretical Computer Science
11
, 1980, pp. 277-301
On the average number of rebalancing operations in weight-balanced trees
N. Blum
,
K. Mehlhorn
Theoretical Computer Science
11
, 1980, pp. 303-320
Lower bounds for polynomials with algebraic coefficients
J. Heintz
,
M. Sieveking
Theoretical Computer Science
11
, 1980, pp. 321-330
Some polynomials that are hard to compute (Note)
J. von zur Gathen
,
V. Strassen
Theoretical Computer Science
11
, 1980, pp. 331-335
There are infinitely many complete prefix codes of constant length
l
(
l \geq 3
) (Note)
A.B. Netto
Theoretical Computer Science
11
, 1980, pp. 337-339