Discrete Mathematics & Theoretical Computer Science, Volume 9

Volume 9, Number 1, 2007

Analysis of Algorithms

Ludger Rüschendorf, Eva-Maria Schopp:
Note on the Weighted Internal Path Length of b-ary Trees.
Julien Bernat:
Arithmetics in ß-Numeration.
Chris Worman, Boting Yang:
On the Tileability of Polygons with Colored Dominoes.
Helmut Prodinger, Guy Louchard:
A Combinatorial and Probabilistic Study of Initial and End Heights of Descents in Samples of Geometrically Distributed Random Variables and in Permutations.
Philippe Dumas, Helger Lipmaa, Johan Wallén:
Asymptotic Behaviour of a Non-commutative Rational Series with a Nonnegative Linear Representation.
Valery T. Stefanov, Wojciech Szpankowski:
Waiting Time Distributions for Pattern Occurrence in a Constrained Sequence.
Ludger Rüschendorf, Eva-Maria Schopp:
Exponential Bounds and Tails for Additive Random Recursive Sequences.

Automata, Logic and Semantics

Christopher Robinson Tompkins:
Latin Square Thue-Morse Sequences are Overlap-Free.
Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé:
On the Critical Exponent of Generalized Thue-Morse Words.

Combinatorics

Svjetlan Feretic:
A Perimeter Enumeration of Column-convex Polyominoes.
Tewodros Amdeberhan, Doron Zeilberger:
"Trivializing" Generalizations of some Izergin-Korepin-type Determinants.

Distributed Computing and Networking

Pascale Minet, Steven Martin, Leïla Azouz Saïdane, Skander Azzaz:
FP/FIFO Scheduling: Coexistence of Deterministic and Probabilistic QoS Guarantees.

Graphs and Algorithms

Guy Kortsarz:
A Lower Bound for Approximating Grundy Numbering.
Olivier Togni:
Strong Chromatic Index of Products of Graphs.
Bill Rosgen, Lorna Stewart:
Complexity Results on Graphs with Few Cliques.
David R. Wood:
Independent Sets in Graphs with an Excluded Clique Minor.
Yoshiko Wakabayashi, Frédéric Chataigner, Liliane Benning Salgado:
Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs.
Jan Kára, Jan Kratochvíl, David R. Wood:
On the Complexity of the Balanced Vertex Ordering Problem.
Van Bang Le, H. N. de Ridder:
Probe Split Graphs.
Sandi Klavzar, Sergey V. Shpectorov:
Tribes of Cubic Partial Cubes.
Wai Chee Shiu, An Chang:
On the kth Eigenvalues of Trees with Perfect Matchings.

Volume 9, Number 2, 2007

Michel Rigo, Véronique Bruyère:
Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique".
Avraham Trakhtman:
The Cernú Conjecture for Aperiodic Automata.
Thomas Brihaye:
Words and Bisimulations of Dynamical Systems.
Srecko Brlek, Guy Melançon, Geneviève Paquin:
Properties of the Extremal Infinite Smooth Words.
François Descouens:
A Generating Algorithm for Ribbon Tableaux and Spin Polynomials.
Jean-Gabriel Luque, Jean-Yves Thibon:
Noncommutative Symmetric Functions Associated with a Code, Lazard Elimination, and Witt Vectors.
Petr Ambroz, Zuzana Masáková, Edita Pelantová:
Addition and Multiplication of Beta-Expansions in Generalized Tribonacci Base.
Gwénaël Richomme:
On Morphisms Preserving Infinite Lyndon Words.
Petra Kocábová, Zuzana Masáková, Edita Pelantová:
Ambiguity in the m-Bonacci Numeration System.
Christiane Frougny, Zuzana Masáková, Edita Pelantová:
Infinite Special Branches in Words Associated with Beta-Expansions.
Vincent Vajnovszki:
Gray Code Order for Lyndon Words.
Marcella Anselmo, Alessandra Cherubini, Pierluigi San Pietro:
Regular Languages and Associative Language Descriptions.
Julien Bernat:
Computation of L+ for Several Cubic Pisot Numbers.
Jean-Pierre Borel:
A Geometrical Approach to Palindromic Factors of Standard Billiard Words.
Patrice Séébold:
Tag-systems for the Hilbert Curve.
Fabio Burderi, Antonio Restivo:
Coding Partitions.
Olivier Bodini, Damien Jamet:
Tiling a Pyramidal Polycube with Dominoes.
Benoit Cagnard, Pierre Simonnet:
Baire and Automata.

Last update Thu May 23 14:42:54 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page