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=15
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Programs as partial graphs I: Flow equivalence and correctness
G. Schmidt
Theoretical Computer Science
15
, 1981, pp. 1-25
Bounded query machines: on
NP
and PSPACE
R.V. Book
Theoretical Computer Science
15
, 1981, pp. 27-39
Bounded query machines: on
NP
() and NPQUERY()
R.V. Book
,
C. Wrathall
Theoretical Computer Science
15
, 1981, pp. 41-50
Relations of flow languages to Petri net languages
T. Araki
,
T. Kagimasa
,
N. Tokura
Theoretical Computer Science
15
, 1981, pp. 51-75
Résolution des systèmes d'équations algébriques
D. Lazard
Theoretical Computer Science
15
, 1981, pp. 77-110
The finite power property for context-free languages (Note)
C.E. Hughes
,
S.M. Selkow
Theoretical Computer Science
15
, 1981, pp. 111-114
A parsing automata approach to LR theory
S. Heilbrunner
Theoretical Computer Science
15
, 1981, pp. 117-157
Programs as partial graphs II: Recursion
G. Schmidt
Theoretical Computer Science
15
, 1981, pp. 159-179
On the structure of sets in NP and other complexity classes
L.H. Landweber
,
R.J. Lipton
,
E.L. Robertson
Theoretical Computer Science
15
, 1981, pp. 181-200
On the algorithmic complexity of associative algebras
A. Alder
,
V. Strassen
Theoretical Computer Science
15
, 1981, pp. 201-211
Sequence recursiveness without cylindrification and limited register machines
G. Germano
,
A. Maggiolo-Schettini
Theoretical Computer Science
15
, 1981, pp. 213-221
More on advice on structuring compilers and proving them correct
J.W. Thatcher
,
E.G. Wagner
,
J.B. Wright
Theoretical Computer Science
15
, 1981, pp. 223-249
Non deterministic polynomial optimization problems and their approximations
A. Paz
,
S. Moran
Theoretical Computer Science
15
, 1981, pp. 251-277
Optimization problems and the polynomial hierarchy
E.W. Leggett
,
D.J. Moore
Theoretical Computer Science
15
, 1981, pp. 279-289
Several results in program size complexity
H.T. Katseff
,
M. Sipser
Theoretical Computer Science
15
, 1981, pp. 291-309
A space bound for one-tape multidimensional Turing machines (Note)
M.C. Loui
Theoretical Computer Science
15
, 1981, pp. 311-320
Complexity of graph embeddability problems (Note)
C. Benzaken
,
S. Foldes
Theoretical Computer Science
15
, 1981, pp. 321-328
On the existence of closed terms in the typed
\lambda
calculus II: Transformations of unification problems (Note)
R. Statman
Theoretical Computer Science
15
, 1981, pp. 329-338