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=207
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The ancestor width of grammars and languages
Franz J. Brandenburg
Theoretical Computer Science
207
(1), 1998, pp. 25-41
Some undecidability results concerning the property of preserving regularity
Friedrich Otto
Theoretical Computer Science
207
(1), 1998, pp. 43-72
Synchronization expressions with extended join operation
Kai Salomaa
,
Sheng Yu
Theoretical Computer Science
207
(1), 1998, pp. 73-88
Bounding queries in the analytic polynomial-time hierarchy
Herbert Baier
,
Klaus W. Wagner
Theoretical Computer Science
207
(1), 1998, pp. 89-104
A relation of primal-dual lattices and the complexity of shortest lattice vector problem
Jin-Yi Cai
Theoretical Computer Science
207
(1), 1998, pp. 105-116
Properties of probabilistic pushdown automata
Ioan I. Macarie
,
Mitsunori Ogihara
Theoretical Computer Science
207
(1), 1998, pp. 117-130
A hierarchy based on output multiplicity
Ashish V. Naik
,
John D. Rogers
,
James S. Royer
,
Alan L. Selman
Theoretical Computer Science
207
(1), 1998, pp. 131-157
Relating polynomial time to constant depth
Heribert Vollmer
Theoretical Computer Science
207
(1), 1998, pp. 159-170
Approximations for subset interconnection designs
Xiufeng Du
,
Weili Wu
,
Dean F. Kelley
Theoretical Computer Science
207
(1), 1998, pp. 171-180
K
-center and
K
-median problems in graded distances
Guo-Hui Lin
,
Guoliang Xue
Theoretical Computer Science
207
(1), 1998, pp. 181-192
Conflict-free channel set assignment for an optical cluster interconnection network based on rotator digraphs
Peng-Jun Wan
Theoretical Computer Science
207
(1), 1998, pp. 193-201
An optimization problem in virtual endoscopy
Jie Wang
,
Yaorong Ge
Theoretical Computer Science
207
(1), 1998, pp. 203-216
The structure of logarithmic advice complexity classes
José L. Balcázar
,
Montserrat Hermo
Theoretical Computer Science
207
(1), 1998, pp. 217-244
Genericity and randomness over feasible probability measures
Amy K. Lorentz
,
Jack H. Lutz
Theoretical Computer Science
207
(1), 1998, pp. 245-259
Mathematical metaphysics of randomness
Andrei A. Muchnik
,
Alexei L. Semenov
,
Vladimir A. Uspensky
Theoretical Computer Science
207
(2), 1998, pp. 263-317
On common information
An.A. Muchnik
Theoretical Computer Science
207
(2), 1998, pp. 319-328
Randomized Boolean decision trees: Several remarks
Nikolai K. Vershchagin
Theoretical Computer Science
207
(2), 1998, pp. 329-342
Ergodic theorems for individual random sequences
V.V. V'yugin
Theoretical Computer Science
207
(2), 1998, pp. 343-361
Non-stochastic infinite and finite sequences
V.V. V'yugin
Theoretical Computer Science
207
(2), 1998, pp. 363-382
On a complexity of the formula
(A \vee B)\Rightarrow C
K.Yu. Gorbunov
Theoretical Computer Science
207
(2), 1998, pp. 383-386
On tables of random numbers
A.N. Kolmogorov
Theoretical Computer Science
207
(2), 1998, pp. 387-395