Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 218
Volume 218, Number 1, 28 April 1999
- Julien Cassaigne:
Limit Values of the Recurrence Quotient of Sturmian Sequences. 3-12 - Aldo de Luca:
On the Combinatorics of Finite Words. 13-39 - Guy Melançon:
Lyndon Words and Singular Factors of Sturmian Words. 41-59 - Arturo Carpi:
On Abelian Squares and Substitutions. 61-81 - Maria Gabriella Castelli, Filippo Mignosi, Antonio Restivo:
Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words. 83-94 - Aviezri S. Fraenkel, Jamie Simpson:
The Exact Number of Squares in Fibonacci Words. 95-106 - Véronique Bruyère, Dominique Perrin:
Maximal Bifix Codes. 107-121 - Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Generalized Factorizations of Words and Their Algorithmic Properties. 123-133 - Jean Berstel, Luc Boasson:
Partial Words and a Theorem of Fine and Wilf. 135-141 - Jean-Paul Allouche
:
Transcendence of Formal Power Series with Rational Coefficients. 143-160 - Roman M. Kolpakov, Gregory Kucherov, Yuriy V. Tarannikov:
On Repetition-Free Binary Words of Minimal Density. 161-175 - Sébastien Ferenczi, Zoltán Kása:
Complexity for Finite Factors of Infinite Sequences. 177-195 - Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter:
Constant-Space String-Matching in Sublinear Average Time. 197-203 - Costas S. Iliopoulos, Laurent Mouchard:
Quasiperiodicity and String Covering. 205-216
Volume 218, Number 2, 6 May 1999
- Jacques Mazoyer, Renzo Pinzani, Jean-Guy Penaud:
Avant Propos. 217-218 - Elena Barcucci, Alberto Del Lungo, Elisa Pergola:
Random Generation of Trees and Other Combinatorial Objects. 219-232 - Alain Denise, Paul Zimmermann:
Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic. 233-248 - Guy Louchard:
Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms. 249-262 - Mohamed Mosbah, Nasser Saheb:
Non-Uniform Random Spanning Trees on Weighted Graphs. 263-271 - Gilles d'Andréa, Christophe Fiorio:
Maximal Superpositions of Horizontally Convex Polyominoes. 273-283 - Eric Goles Ch., Ivan Rapaport:
Tiling Allowing Rotations Only. 285-295 - David Simplot:
A Characterization of Recognizable Picture Languages by Tilings by Finite Sets. 297-323 - Véronique Terrier:
Two-Dimensional Cellular Automata Recognizer. 325-346 - Marianne Delorme, Jacques Mazoyer, Laure Tougne:
Discrete Parabolas and Circles on 2D Cellular Automata. 347-417
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
