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=218
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Limit values of the recurrence quotient of Sturmian sequences
Julien Cassaigne
Theoretical Computer Science
218
(1), 1999, pp. 3-12
On the combinatorics of finite words
Aldo de Luca
Theoretical Computer Science
218
(1), 1999, pp. 13-39
Lyndon words and singular factors of Sturmian words
Guy Melançon
Theoretical Computer Science
218
(1), 1999, pp. 41-59
On Abelian squares and substitutions
Arturo Carpi
Theoretical Computer Science
218
(1), 1999, pp. 61-81
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
M. Gabriella Castelli
,
Filippo Mignosi
,
Antonio Restivo
Theoretical Computer Science
218
(1), 1999, pp. 83-94
The exact number of squares in Fibonacci words
Aviezri S. Fraenkel
,
Jamie Simpson
Theoretical Computer Science
218
(1), 1999, pp. 95-106
Maximal bifix codes
Véronique Bruyère
,
Dominique Perrin
Theoretical Computer Science
218
(1), 1999, pp. 107-121
Generalized factorizations of words and their algorithmic properties
Juhani Karhumäki
,
Wojciech Plandowski
,
Wojciech Rytter
Theoretical Computer Science
218
(1), 1999, pp. 123-133
Partial words and a theorem of fine and Wilf
Jean Berstel
,
Luc Boasson
Theoretical Computer Science
218
(1), 1999, pp. 135-141
Transcendence of formal power series with rational coefficients
J.-P. Allouche
Theoretical Computer Science
218
(1), 1999, pp. 143-160
On repetition-free binary words of minimal density
Roman Kolpakov
,
Gregory Kucherov
,
Yuri Tarannikov
Theoretical Computer Science
218
(1), 1999, pp. 161-175
Complexity for finite factors of infinite sequences
Sébastien Ferenczi
,
Zoltán Kása
Theoretical Computer Science
218
(1), 1999, pp. 177-195
Constant-space string-matching in sublinear average time
Maxime Crochemore
,
Leszek Ga̧sieniec
,
Wojciech Rytter
Theoretical Computer Science
218
(1), 1999, pp. 197-203
Quasiperiodicity and string covering
Costas S. Iliopoulos
,
Laurent Mouchard
Theoretical Computer Science
218
(1), 1999, pp. 205-216
Random generation of trees and other combinatorial objects
Elena Barcucci
,
Alberto del Lungo
,
Elisa Pergola
Theoretical Computer Science
218
(2), 1999, pp. 219-232
Uniform random generation of decomposable structures using floating-point arithmetic
Alain Denise
,
Paul Zimmermann
Theoretical Computer Science
218
(2), 1999, pp. 233-248
Asymptotic properties of some underdiagonal walks generation algorithms
G. Louchard
Theoretical Computer Science
218
(2), 1999, pp. 249-262
Non-uniform random spanning trees on weighted graphs
M. Mosbah
,
N. Saheb
Theoretical Computer Science
218
(2), 1999, pp. 263-271
Maximal superpositions of horizontally convex polyominoes
Gilles d'Andréa
,
Christophe Fiorio
Theoretical Computer Science
218
(2), 1999, pp. 273-283
Tiling allowing rotations only
Eric Goles
,
Ivan Rapaport
Theoretical Computer Science
218
(2), 1999, pp. 285-295
A characterization of recognizable picture languages by tilings by finite sets
David Simplot
Theoretical Computer Science
218
(2), 1999, pp. 297-323
Two-dimensional cellular automata recognizer
Véronique Terrier
Theoretical Computer Science
218
(2), 1999, pp. 325-346
Discrete parabolas and circles on 2D cellular automata
Marianne Delorme
,
Jacques Mazoyer
,
Laure Tougne
Theoretical Computer Science
218
(2), 1999, pp. 347-417