Volume 5, Number 1, 2002
Markus E. Nebel: The Stack-Size of Combinatorial Tries Revisited. 1-16- Anton Cerný: Lyndon factorization of generalized words of Thue. 17-46
- Kenneth G. Monks: 3x+1 Minus the +. 47-54
- Christian Capelle, Michel Habib, Fabien de Montgolfier: Graph Decompositions andFactorizing Permutations. 55-70
- Clémentin Tayou Djamégni: Synthesis Of Space-Time Optimal Systolic Algorithms For The Cholesky Factorization. 109-120
- Gregory Constantine: Multicolored isomorphic spanning trees in complete graphs. 121-126
- Luitpold Babel, Andreas Brandstädt, Van Bang Le: Recognizing the P4-structure of claw-free graphs and a larger graph class. 127-146
- Elias Dahlhaus, Jens Gustedt, Ross M. McConnell: Partially Complemented Representations of Digraphs. 147-168
- John A. Ellis, Hongbing Fan, Jeffrey Shallit: The Cycles of the Multiway Perfect Shuffle Permutation. 169-180
- W. M. B. Dukes: On a Unimodality Conjecture in Matroid Theory. 181-190
- Jean-Louis Dornstetter, Daniel Krob, Jean-Yves Thibon, Ekaterina A. Vassilieva: Performance analysis of demodulation with diversity - A combinatorial approach I: Symmetric function theoretical methods. 191-204
- Nikolaos Fountoulakis, Colin McDiarmid: Upper bounds on the non-3-colourability threshold of random graphs. 205-226
- Frédéric Saubion, Igor Stéphan: A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars. 227-262
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team