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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Strong nondeterministic polynomial-time reducibilities
T.J. Long
Theoretical Computer Science
21
(1), 1982, pp. 1-25
Two-way deterministic multi-weak-counter machines
S. Miyano
Theoretical Computer Science
21
(1), 1982, pp. 27-37
Fooling a two-way automaton or one pushdown store is better than one counter for two-way machines
P. Dúris
,
Z. Galil
Theoretical Computer Science
21
(1), 1982, pp. 39-53
Graph grammars with neighbourhood-controlled embedding
D. Janssens
,
G. Rozenberg
Theoretical Computer Science
21
(1), 1982, pp. 55-74
Representation theorems using DOS languages
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
21
(1), 1982, pp. 75-90
Construction of maps with prescribed automorphism group
R. Cori
,
A. Machi
Theoretical Computer Science
21
(1), 1982, pp. 91-98
A solution of the Sperner-Erdŏs problem
X. Berenguer
,
J. Díaz
,
L.H. Harper
Theoretical Computer Science
21
(1), 1982, pp. 99-103
The maximum flow problem is log space complete for
\P
L.M. Goldschlager
,
R.A. Shaw
,
J. Staples
Theoretical Computer Science
21
(1), 1982, pp. 105-111
The (generalized) post correspondence problem with lists consisting of two words is decidable
A. Ehrenfeucht
,
J. Karhumäki
,
G. Rozenberg
Theoretical Computer Science
21
(2), 1982, pp. 119-144
Simulations among multidimensional Turing machines
M.C. Loui
Theoretical Computer Science
21
(2), 1982, pp. 145-161
Marvellous interpretations differ little but decisively from ordinary interpretations of EOL forms
W. Ainhirn
Theoretical Computer Science
21
(2), 1982, pp. 163-178
On the computational complexity of satisfiability in propositional logics of programs
B.S. Chlebus
Theoretical Computer Science
21
(2), 1982, pp. 179-212
Boolean functions whose monotone complexity is of size
n^2/\log n
Ingo Wegener
Theoretical Computer Science
21
(2), 1982, pp. 213-224
On the syntactic transformation semigroup of a language generated by a finite biprefix code
S.W. Margolis
Theoretical Computer Science
21
(2), 1982, pp. 225-230
Determinateness of program equivalence over Peano axioms
L. Csirmaz
Theoretical Computer Science
21
(2), 1982, pp. 231-235
On eliminating nondeterminism from Turing machines which use less than logarithm worktape space
B. Monien
,
I.H. Sudborough
Theoretical Computer Science
21
(3), 1982, pp. 237-253
An arithmetical characterization of NP
C.F. Kent
,
B.R. Hodgson
Theoretical Computer Science
21
(3), 1982, pp. 255-267
On the elimination of iteration quantifiers in a fragment of algorithmic logic
J.A. Bergstra
,
J.-J.Ch. Meyer
Theoretical Computer Science
21
(3), 1982, pp. 269-279
On rational definitions in complete algebras without rank
K. Indermark
Theoretical Computer Science
21
(3), 1982, pp. 281-313
An algebraic description of system behaviours
J. Winkowski
Theoretical Computer Science
21
(3), 1982, pp. 315-340
Some remarks on non-algebraic adherences
S. Istrail
Theoretical Computer Science
21
(3), 1982, pp. 341-349
Ergodic languages
P. Kůrka
Theoretical Computer Science
21
(3), 1982, pp. 351-355
Finite DOL languages and codes
T. Head
,
J. Wilkinson
Theoretical Computer Science
21
(3), 1982, pp. 357-361