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=16
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Embedding metric spaces into CPO's
K. Weihrauch
,
U. Schreiber
Theoretical Computer Science
16
, 1981, pp. 5-24
On the subword complexity of square-free DOL languages
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
16
, 1981, pp. 25-32
Sur la liaison entre problmes combinatoires et algorithmiques
Ju.M. Vaz̑enin
Theoretical Computer Science
16
, 1981, pp. 33-41
A logical basis for programming methodology
S. Takasu
,
S. Kawabata
Theoretical Computer Science
16
, 1981, pp. 43-60
On a special monoid with a single defining relation
M. Jantzen
Theoretical Computer Science
16
, 1981, pp. 61-73
On tape-bounded probabilistic Turing machine acceptors
J. Simon
Theoretical Computer Science
16
, 1981, pp. 75-91
Free upper regular bands (Note)
M.G. Main
,
D.B. Benson
Theoretical Computer Science
16
, 1981, pp. 93-98
Uniform complexity and digital signatures (Note)
K. Lieberherr
Theoretical Computer Science
16
, 1981, pp. 99-110
On the computational power of automata with time or space bounded by Ackermann's or superexponential functions
R. Tao
Theoretical Computer Science
16
, 1981, pp. 115-148
On
LLP(k)
grammars and languages
J. Pittl
Theoretical Computer Science
16
, 1981, pp. 149-175
On the complexity of 2-output Boolean networks
G. Galbiati
,
M.J. Fischer
Theoretical Computer Science
16
, 1981, pp. 177-185
The shortest common supersequence problem over binary alphabet is
NP
-complete
K.J. Räihä
,
E. Ukkonen
Theoretical Computer Science
16
, 1981, pp. 187-198
Programs and program verifications in a general setting
L. Csirmaz
Theoretical Computer Science
16
, 1981, pp. 199-210
A dual problem to least fixed points (Note)
V.L. Nguyen
,
J.L. Lassez
Theoretical Computer Science
16
, 1981, pp. 211-221
Testing for the Church-Rosser property (Note)
R.V. Book
,
C.P. O'Dúnlaing
Theoretical Computer Science
16
, 1981, pp. 223-229
A note on the existence of continuous functionals (Note)
J.L. Carter
,
R. Fagin
Theoretical Computer Science
16
, 1981, pp. 231-235
Context-free like restrictions on selective rewriting
H.C.M. Kleijn
,
G. Rozenberg
Theoretical Computer Science
16
, 1981, pp. 237-269
A generalized counter scheme
K. Lam
,
M.K. Siu
,
C.T. Yu
Theoretical Computer Science
16
, 1981, pp. 271-278
Inherent complexity trade-offs for range query problems
W.A. Burkhard
,
M.L. Fredman
,
D.J. Kleitman
Theoretical Computer Science
16
, 1981, pp. 279-290
Languages with homomorphic replacements
J. Albert
,
L. Wegner
Theoretical Computer Science
16
, 1981, pp. 291-305
Record allocation for minimizing seek delay
U.I. Gupta
,
D.T. Lee
,
J.Y.-T. Leung
,
J.W. Pruitt
,
C.K. Wong
Theoretical Computer Science
16
, 1981, pp. 307-319
Propositional dynamic logic is weaker without tests (Note)
F. Berman
,
M.S. Paterson
Theoretical Computer Science
16
, 1981, pp. 321-328
A space-optimal solution of general region location (Note)
H. Edelsbrunner
,
H.A. Maurer
Theoretical Computer Science
16
, 1981, pp. 329-336
Sur la détermination du rang d'une équation dans le monoide libre (Note)
J.-P. Pécuchet
Theoretical Computer Science
16
, 1981, pp. 337-340