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=201
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Analytical depoissonization and its applications
Philippe Jacquet
,
Wojciech Szpankowski
Theoretical Computer Science
201
(1-2), 1998, pp. 1-62
Ordinal recursive bounds for Higman's theorem
E.A. Cichon
,
E. Tahhan Bittar
Theoretical Computer Science
201
(1-2), 1998, pp. 63-84
An improved scheme for set equality testing and updating
Tak Wah Lam
,
Ka Hing Lee
Theoretical Computer Science
201
(1-2), 1998, pp. 85-97
Dynamical recognizers: Real-time language recognition by analog computers
Cristopher Moore
Theoretical Computer Science
201
(1-2), 1998, pp. 99-136
Résolutions universelles pour des problèmes
NP
-complets
Natacha Portier
Theoretical Computer Science
201
(1-2), 1998, pp. 137-150
Inventories of unavoidable languages and the word-extension conjecture
Laurent Rosaz
Theoretical Computer Science
201
(1-2), 1998, pp. 151-170
Generalized sub-shifts in elementary cellular automata: The "strange case" of chaotic rule 180
Gianpiero Cattaneo
,
Luciano Margara
Theoretical Computer Science
201
(1-2), 1998, pp. 171-187
Power properties of
NLC
graph grammars with a polynomial membership problem
M. Flasiński
Theoretical Computer Science
201
(1-2), 1998, pp. 189-231
Efficient algorithms for a mixed
k
-partition problem of graphs without specifying bases
Koichi Wada
,
Akinari Takaki
,
Kimio Kawaguchi
Theoretical Computer Science
201
(1-2), 1998, pp. 233-248
On updating suffix tree labels
Paolo Ferragina
,
Roberto Grossi
,
Manuela Montangero
Theoretical Computer Science
201
(1-2), 1998, pp. 249-262
Analysis of two-dimensional approximate pattern matching algorithms
Kunsoo Park
Theoretical Computer Science
201
(1-2), 1998, pp. 263-273
An improved algorithm for solving the banded cyclic string-to-string correction problem
Kuo-Liang Chung
Theoretical Computer Science
201
(1-2), 1998, pp. 275-279
On the random generation and counting of matchings in dense graphs
J. Diaz
,
M. Serna
,
P. Spirakis
Theoretical Computer Science
201
(1-2), 1998, pp. 281-290