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=225
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the representation of finite deterministic 2-tape automata
Maryse Pelletier
,
Jacques Sakarovitch
Theoretical Computer Science
225
(1-2), 1999, pp. 1-63
Max
NP
-completeness made easy
Pierluigi Crescenzi
,
Luca Trevisan
Theoretical Computer Science
225
(1-2), 1999, pp. 65-79
Simulations between cellular automata on Cayley graphs
Zsuzsanna Róka
Theoretical Computer Science
225
(1-2), 1999, pp. 81-111
Improved non-approximability results for minimum vertex cover with density constraints
Andrea E.F. Clementi
,
Luca Trevisan
Theoretical Computer Science
225
(1-2), 1999, pp. 113-128
Sturmian morphisms and
\alpha
-words
Wai-Fong Chuan
Theoretical Computer Science
225
(1-2), 1999, pp. 129-148
On the system of word equations
x_0u^i_1x_1u^i_2x_2u^i_3x_3 = y_0v^i_1y_1v^i_2y_2v^i_3y_3 (i = 0,1,2,\ldots)
in a free monoid
Ismo Hakala
,
Juha Kortelainen
Theoretical Computer Science
225
(1-2), 1999, pp. 149-161
Optimal path cover problem on block graphs
Pak-Ken Wong
Theoretical Computer Science
225
(1-2), 1999, pp. 163-169
A solution for the coloured cubes problem
J.M. Basart
,
P. Guitart
Theoretical Computer Science
225
(1-2), 1999, pp. 171-176
The ``smallest'' ring of polynomial invariants of a permutation group which has no finite SAGBI bases w.r.t. any admissible order
Manfred Göbel
Theoretical Computer Science
225
(1-2), 1999, pp. 177-184
Feasible reductions to Kolmogorov-Loveland stochastic sequences
Jack H. Lutz
,
David L. Schweizer
Theoretical Computer Science
225
(1-2), 1999, pp. 185-194