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=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Using DNA to solve the bounded Post correspondence problem
Lila Kari
,
Greg Gloor
,
Sheng Yu
Theoretical Computer Science
231
(2), 2000, pp. 193-203
More on morphisms and almost-periodicity
Arnaud Maes
Theoretical Computer Science
231
(2), 2000, pp. 205-215
Frontier between decidability and undecidability: A survey
Maurice Margenstern
Theoretical Computer Science
231
(2), 2000, pp. 217-251
Isomorphism theorem for BSS recursively enumerable sets over real closed fields
C. Michaux
,
C. Troestler
Theoretical Computer Science
231
(2), 2000, pp. 253-273
DNA computing based on splicing: Universality results
Gheorghe Păun
Theoretical Computer Science
231
(2), 2000, pp. 275-296
Intractability of decision problems for finite-memory automata
Hiroshi Sakamoto
,
Daisuke Ikeda
Theoretical Computer Science
231
(2), 2000, pp. 297-308
Complete formal systems for equivalence problems
Géraud Sénizergues
Theoretical Computer Science
231
(2), 2000, pp. 309-334
P
-sufficient statistics for PAC learning
k
-term-DNF formulas through enumeration
B. Apolloni
,
C. Gentile
Theoretical Computer Science
230
(1-2), 2000, pp. 1-37
\sigma
-automata and Chebyshev-polynomials
Klaus Sutner
Theoretical Computer Science
230
(1-2), 2000, pp. 49-73
Efficient algorithms for acyclic colorings of graphs
Zhi-Zhong Chen
Theoretical Computer Science
230
(1-2), 2000, pp. 75-95
Covering numbers of rotations
Nataliya Chekhova
Theoretical Computer Science
230
(1-2), 2000, pp. 97-116
On the classifiability of cellular automata
John T. Baldwin
,
Saharon Shelah
Theoretical Computer Science
230
(1-2), 2000, pp. 117-129
Identification of partial disjunction, parity, and threshold functions
Ryuhei Uehara
,
Kensei Tsuchida
,
Ingo Wegener
Theoretical Computer Science
230
(1-2), 2000, pp. 131-147
Conditioning a state by a Łukasiewicz event: A probabilistic approach to Ulam games
Brunella Gerla
Theoretical Computer Science
230
(1-2), 2000, pp. 149-166
Optimal strategies against a liar
Ferdinando Cicalese
,
Ugo Vaccaro
Theoretical Computer Science
230
(1-2), 2000, pp. 167-193
Solving
8 \times 8
domineering
D.M. Breuker
,
J.W.H.M. Uiterwijk
,
H.J. van den Herik
Theoretical Computer Science
230
(1-2), 2000, pp. 195-206
A metric for positional games
J. Mark Ettinger
Theoretical Computer Science
230
(1-2), 2000, pp. 207-219
Homotopy in two-dimensional digital images
Rémy Malgouyres
Theoretical Computer Science
230
(1-2), 2000, pp. 221-233
The variety of Kleene algebras with conversion is not finitely based
S. Crvenković
,
I. Dolinka
,
Z. Ésik
Theoretical Computer Science
230
(1-2), 2000, pp. 235-245
The inclusion problem for some subclasses of context-free languages
Peter R.J. Asveld
,
Anton Nijholt
Theoretical Computer Science
230
(1-2), 2000, pp. 247-256
Contents and abstracts of the electronic notes in Theoretical Computer Science Vol. 7
Catuscia Palamidessi
,
Joachim Parrow
Theoretical Computer Science
230
(1-2), 2000, pp. 257-264
Contents and abstracts of the electronic notes in Theoretical Computer Science Vol. 8
Marcello Bonsangue
Theoretical Computer Science
230
(1-2), 2000, pp. 265-268
Contents and abstracts of the electronic notes in Theoretical Computer Science Vol. 9
Faron Moller
Theoretical Computer Science
230
(1-2), 2000, pp. 269-273
Contents and abstracts of the electronic notes in Theoretical Computer Science Vol. 10
Andrew Gordon
,
Andrew Pitts
,
Carolyn Talcott
Theoretical Computer Science
230
(1-2), 2000, pp. 275-284
Contents and abstracts of the electronic notes in Theoretical Computer Science Vol. 11
Bart Jacobs
,
Larry Moss
,
Horst Reichel
,
Jan Rutten
Theoretical Computer Science
230
(1-2), 2000, pp. 285-290
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12