Front matter
1-17
Algorithmic Aspects of Regularity
Y. Kohayakawa and V. Rödl
18-27
Small Maximal Matchings in Random Graphs
Michele Zito
28-37
Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs
Vlady Ravelomanana and Loÿs Thimonier
38-47
Analysis of Edge Deletion Processes on Faulty Random Regular Graphs
Andreas Goerdt and Mike Molloy
48-57
Equivalent Conditions for Regularity (Extended Abstract)
Y. Kohayakawa, V. Rödl and J. Skokan
58-67
Cube Packing
F. K. Miyazawa and Y. Wakabayashi
68-77
Approximation Algorithms for Flexible Job Shop Problems
Klaus Jansen, Monaldo Mastrolilli and Roberto Solis-Oba
78-87
Emerging Behavior as Binary Search Trees Are Symmetrically Updated
Stephen Taylor
88-94
The LCA Problem Revisited
Michael A. Bender and Martín Farach-Colton
95-104
Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays
Myra B. Cohen and Charles J. Colbourn
105-114
Rank Inequalities for Packing Designs and Sparse Triple Systems
Lucia Moura
115-122
The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs
Brett Stevens
123-125
Graph Structure of the Web: A Survey
Prabhakar Raghavan
126-134
Polynomial Time Recognition of Clique-Width ≤ 3 Graphs
Derek G. Corneil, Michel Habib, Jean-Marc Lanligne, Bruce Reed and Udi Rotics
135-144
On Dart-Free Perfectly Contractile Graphs Extended Abstract
Cláudia Linhares Sales and Frédéric Maffray
145-153
Edge Colouring Reduced Indifference Graphs
Celina M. H. de Figueiredo, Célia Picinin de Mello and Carmen Ortiz
154-162
Two Conjectures on the Chromatic Polynomial
David Avis, Caterina De Simone and Paolo Nobili
163-172
Finding Skew Partitions Efficiently
Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa and Bruce A. Reed
173-196
On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract)
Allan Borodin, Ran El-Yaniv and Vincent Gogan
197-206
Almost k-Wise Independence and Hard Boolean Functions
Valentine Kabanets
207-216
Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function
Andris Ambainis and Satyanarayana V. Lokam
217-226
Multi-parameter Minimum Spanning Trees
David Fernández-Baca
227-236
Linear Time Recognition of Optimal L-Restricted Prefix Codes
Ruy Luiz Milidiú and Eduardo Sany Laber
237-246
Uniform Multi-hop All-to-All Optical Routings in Rings
Jaroslav Opatrny
247-257
A Fully Dynamic Algorithm for Distributed Shortest Paths
Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni and Umberto Nanni
258
Integer Factorization and Discrete Logarithms
Andrew Odlyzko
259-268
Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key
Igor E. Shparlinski
269-279
Quintic Reciprocity and Primality Test for Numbers of the Form M = A5n ± wnM~=~A5^{n} \pm ~\omega_{n}
Pedro Berrizbeitia, Mauricio Odreman Vera and Juan Tena Ayuso
280-291
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
Matthias Krause and Hans Ulrich Simon
292-297
Average-Case Analysis of Rectangle Packings
E. G. Coffman, George S. Lueker, Joel Spencer and Peter M. Winkler
298-307
Heights in Generalized Tries and PATRICIA Tries
Charles Knessl and Wojciech Szpankowski
308-317
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract
D. Barth, S. Corteel, A. Denise, D. Gardy and M. Valencia-Pabon
318-342
Subresultants Revisited
Extended Abstract
Joachim von zur Gathen and Thomas Lücking
343-354
A Unifying Framework for the Analysis of a Class of Euclidean Algorithms
Brigitte Vallée
355-366
Worst-Case Complexity of the Optimal LLL Algorithm
Ali Akhavi
367-376
Iteration Algebras Are Not Finitely Axiomatizable
Stephen L. Bloom and Zoltán Ésik
377-386
Undecidable Problems in Unreliable Computations
Richard Mayr
387-396
Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups
Claudio Gutiérrez
397-406
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers
Marie-Pierre Béal, Olivier Carton, Christophe Prieur and Jacques Sakarovitch
407-416
Unambiguous Büchi Automata
Olivier Carton and Max Michel
417-426
Linear Time Language Recognition on Cellular Automata with Restricted Communication
Thomas Worsch
427-436
From Semantics to Spatial Distribution
Luis R. Sierra Abbate, Pedro R. D’Argenio and Juan V. Echagüe
437-446
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics
F. Laroussinie, Ph. Schnoebelen and M. Turuani
447-456
A Theory of Operational Equivalence for Interaction Nets
Maribel Fernández and Ian Mackie
457-462
Run Statistics for Geometrically Distributed Random Variables
Peter J. Grabner, Arnold Knopfmacher and Helmut Prodinger
463-472
Generalized Covariances of Multi-dimensional Brownian Excursion Local Times
Guy Louchard
473-482
Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs
Helmut Prodinger
Back matter