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=3
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The polynomial-time hierarchy
Larry J. Stockmeyer
Theoretical Computer Science
3
(1), 1976, pp. 1-22
Complete sets and the polynomial-time hierarchy
C. Wrathall
Theoretical Computer Science
3
(1), 1976, pp. 23-33
Regular semigroups with
{\cal D} = {\cal R}
as syntactic monoids of prefix codes
G. Lallement
Theoretical Computer Science
3
(1), 1976, pp. 35-49
Schranken für balanced trees bei ausgewogenen Verteilungen
G. Hotz
Theoretical Computer Science
3
(1), 1976, pp. 51-59
A recursive and a grammatical characterization of the exponential-time languages
B. Monien
Theoretical Computer Science
3
(1), 1976, pp. 61-74
On the decidability of the sequence equivalence problem for DOL systems
K. Culik II
Theoretical Computer Science
3
(1), 1976, pp. 75-84
Some decision problems related to the reachability problem for Petri nets
T. Araki
,
T. Kasami
Theoretical Computer Science
3
(1), 1976, pp. 85-104
Complete problems for deterministic polynomial time
N.D. Jones
,
W.T. Laaser
Theoretical Computer Science
3
(1), 1976, pp. 105-117
Mechanizing
\omega
-order type theory through unification
D.C. Jensen
,
T. Pietrzykowski
Theoretical Computer Science
3
(2), 1976, pp. 123-171
Finiteness is mu-ineffable
D. Park
Theoretical Computer Science
3
(2), 1976, pp. 173-181
Information storage and retrieval -- mathematical foundations II (combinatorial problems)
W., Jr. Lipski
Theoretical Computer Science
3
(2), 1976, pp. 183-211
On tape bounds for single letter alphabet language processing
J. Hartmanis
,
L. Berman
Theoretical Computer Science
3
(2), 1976, pp. 213-224
A global representation of the recursive functions in the
\lambda
-calculus
H. Barendregt
Theoretical Computer Science
3
(2), 1976, pp. 225-242
Sur les relations rationnelles entre monoides libres
M.P. Schützenberger
Theoretical Computer Science
3
(2), 1976, pp. 243-259
Analyse und Synthese von asynchronen ND-Automaten
P.H. Starke
Theoretical Computer Science
3
(2), 1976, pp. 261-266
An elementary proof for Strassen's degree bound
A. Schönhage
Theoretical Computer Science
3
(2), 1976, pp. 267-272
Concerning bounded-right-context grammars
T.G. Szymanski
Theoretical Computer Science
3
(3), 1976, pp. 273-282
Zeros of
Z
-rational functions and DOL equivalence
K. Ruohonen
Theoretical Computer Science
3
(3), 1976, pp. 283-292
Approximate algorithms for some generalized knapsack problems
A.K. Chandra
,
D.S. Hirschberg
,
C.K. Wong
Theoretical Computer Science
3
(3), 1976, pp. 293-304
An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
C. Beeri
Theoretical Computer Science
3
(3), 1976, pp. 305-320
Analysis of a simple factorization algorithm
D.E. Knuth
,
L. Trabb Pardo
Theoretical Computer Science
3
(3), 1976, pp. 321-348
Complexity measures and hierarchies for the evaluation of integers and polynomials
R.J. Lipton
,
D. Dobkin
Theoretical Computer Science
3
(3), 1976, pp. 349-357
A strong pumping lemma for context-free languages
D.S. Wise
Theoretical Computer Science
3
(3), 1976, pp. 359-369
On recognizing graph properties from adjacency matrices
Ron L. Rivest
,
Jean Vuillemin
Theoretical Computer Science
3
(3), 1976, pp. 371-384