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 YEAR=1980
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient scheduling of tasks without full use of processor resources
J.M. Jaffe
Theoretical Computer Science
12
, 1980, pp. 1-17
CPO's of measures for nondeterminism
N. Saheb-Djahromi
Theoretical Computer Science
12
, 1980, pp. 19-37
Behaviours of concurrent systems
J. Winkowski
Theoretical Computer Science
12
, 1980, pp. 39-60
Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
D. Harel
Theoretical Computer Science
12
, 1980, pp. 61-81
Toward a unified approach for the classification of
NP
-complete optimization problems
G. Ausiello
,
A. Marchetti-Spaccamela
,
M. Protasi
Theoretical Computer Science
12
, 1980, pp. 83-96
Evaluation and comparison of two efficient probabilistic primality testing algorithms
L. Monier
Theoretical Computer Science
12
, 1980, pp. 97-108
Tests de primalité
M. Mignotte
Theoretical Computer Science
12
, 1980, pp. 109-117
Some more independence results in complexity theory
P.W. Grant
Theoretical Computer Science
12
, 1980, pp. 119-126
On ambiguity in EOL systems
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
12
, 1980, pp. 127-134
Synchronized EOL forms
H.A. Maurer
,
A. Salomaa
,
D. Wood
Theoretical Computer Science
12
, 1980, pp. 135-159
On counting problems and the polynomial-time hierarchy
D. Angluin
Theoretical Computer Science
12
, 1980, pp. 161-173
An algebraic definition for control structures
G. Cousineau
Theoretical Computer Science
12
, 1980, pp. 175-192
Two iteration theorems for the
LL(k)
languages
J.C. Beatty
Theoretical Computer Science
12
, 1980, pp. 193-228
Unique fixed points vs. least fixed points
J. Tiuryn
Theoretical Computer Science
12
, 1980, pp. 229-254
Determining the mode
D.P. Dobkin
,
J.I. Munro
Theoretical Computer Science
12
, 1980, pp. 255-263
Local constraints in programming languages Part I: Syntax
A.K. Joshi
,
L.S. Levy
,
K. Yueh
Theoretical Computer Science
12
, 1980, pp. 265-290
Complexity, convexity and combinations of theories
D.C. Oppen
Theoretical Computer Science
12
, 1980, pp. 291-302
Negation can be exponentially powerful
L.G. Valiant
Theoretical Computer Science
12
, 1980, pp. 303-314
Selection and sorting with limited storage
J.I. Munro
,
Ms. Paterson
Theoretical Computer Science
12
, 1980, pp. 315-323
Minimal complete sets of words (Note)
J.M. Boë
,
A. de Luca
,
A. Restivo
Theoretical Computer Science
12
, 1980, pp. 325-332
Deterministic simulation of tape-bounded probabilistic Turing machine transducers (Note)
J. Gill
,
J. Hunt
,
J. Simon
Theoretical Computer Science
12
, 1980, pp. 333-338
On a bound for the DOL sequence equivalence problem (Note)
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
12
, 1980, pp. 339-342
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
Seiten 1
2
3
>