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=1
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A lower bound for the length of addition chains
A. Schönhage
Theoretical Computer Science
1
(1), 1975, pp. 1-12
Complexity of monotone networks for Boolean matrix product
M.S. Paterson
Theoretical Computer Science
1
(1), 1975, pp. 13-20
Die Berechnungskomplexität der symbolischen Differentiation von Interpolationspolynomen
W. Strassen
Theoretical Computer Science
1
(1), 1975, pp. 21-25
A unification algorithm for typed
\lambda
-calculus
G.P. Huet
Theoretical Computer Science
1
(1), 1975, pp. 27-57
Subword complexities of various classes of deterministic developmental languages without interactions
A. Ehrenfeucht
,
K.P. Lee
,
G. Rozenberg
Theoretical Computer Science
1
(1), 1975, pp. 59-75
The Turing degree of the inherent ambiguity problem for context-free languages
A. Reedy
,
W.J. Savitch
Theoretical Computer Science
1
(1), 1975, pp. 77-91
A combinatorial property of codes having finite synchronization delay
A. Restivo
Theoretical Computer Science
1
(2), 1975, pp. 95-101
A comparison of polynomial time reducibilities
R.E. Ladner
,
N.A. Lynch
,
A.L. Selman
Theoretical Computer Science
1
(2), 1975, pp. 103-123
Call-by-name, call-by-value and the
\lambda
-calculus
G.D. Plotkin
Theoretical Computer Science
1
(2), 1975, pp. 125-159
A class of Boolean functions with linear combinational complexity
L.H. Harper
,
W.N. Hsieh
,
S.E. Savage
Theoretical Computer Science
1
(2), 1975, pp. 161-183
A fast stable sorting algorithm with absolutely minimum storage
F.P. Preparata
Theoretical Computer Science
1
(2), 1975, pp. 185-190
An operator embedding theorem for complexity classes of recursive functions
R. Moll
Theoretical Computer Science
1
(3), 1976, pp. 193-198
A decomposition theorem for hyperalgebraic extensions of language families
J. van Leeuwen
,
D. Wood
Theoretical Computer Science
1
(3), 1976, pp. 199-214
Translational lemmas, polynomial time, and
(\log n)^j
-space
R.V. Book
Theoretical Computer Science
1
(3), 1976, pp. 215-226
Algorithms rélatifs à la décomposition des polynômes
M. Mignotte
Theoretical Computer Science
1
(3), 1976, pp. 227-235
Some simplified
NP
-complete graph problems
M.R. Garey
,
D.S. Johnson
,
L. Stockmeyer
Theoretical Computer Science
1
(3), 1976, pp. 237-267
Remarks on the complexity of nondeterministic counter languages
S.A. Greibach
Theoretical Computer Science
1
(4), 1976, pp. 269-288
The combinational complexity of equivalence
C.P. Schnorr
Theoretical Computer Science
1
(4), 1976, pp. 289-295
The inclusion problem for simple languages
E.P. Friedman
Theoretical Computer Science
1
(4), 1976, pp. 297-316
Two theorems concerning recognizable N-subsets of
\Sigma^*
J. Karhumäki
Theoretical Computer Science
1
(4), 1976, pp. 317-323
A relationship between ETOL and EDTOL languages
A. Ehrenfeucht
,
G. Rozenberg
,
S. Skyum
Theoretical Computer Science
1
(4), 1976, pp. 325-330
Information storage and retrieval systems: Mathematical foundations
W. Marek
,
Z. Pawlak
Theoretical Computer Science
1
(4), 1976, pp. 331-354