Abstract is missing.
- Algorithmic Aspects of RegularityYoshiharu Kohayakawa, Vojtech Rödl. 1-17
- Small Maximal Matchings in Random GraphsMichele Zito. 18-27
- Some Remarks on Sparsely Connected Isomorphism-Free Labeled GraphsVlady Ravelomanana, Loÿs Thimonier. 28-37
- Analysis of Edge Deletion Processes on Faulty Random Regular GraphsAndreas Goerdt, Michael Molloy. 38-47
- Equivalent Conditions for Regularity (Extended Abstract)Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan. 48-57
- Cube PackingFlávio Keidi Miyazawa, Yoshiko Wakabayashi. 58-67
- Approximation Algorithms for Flexible Job Shop ProblemsKlaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba. 68-77
- Emerging Behavior as Binary Search Trees Are Symmetrically UpdatedStephen Taylor. 78-87
- The LCA Problem RevisitedMichael A. Bender, Martin Farach-Colton. 88-94
- Optimal and Pessimal Orderings of Steiner Triple Systems in Disk ArraysMyra B. Cohen, Charles J. Colbourn. 95-104
- Rank Inequalities for Packing Designs and Sparse Triple SystemsLucia Moura. 105-114
- The Anti-Oberwolfach Solution: Pancyclic 2- Factorizations of Complete GraphsBrett Stevens. 115-122
- Graph Structure of the Web: A SurveyPrabhakar Raghavan. 123-125
- Polynomial Time Recognition of Clique-Width /le /leq 3 Graphs (Extended Abstract)Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics. 126-134
- On Dart-Free Perfectly Contractile Graphs. Extended AbstractCláudia Linhares Sales, Frédéric Maffray. 135-144
- Edge Colouring Reduced Indifference GraphsCelina M. Herrera de Figueiredo, Célia Picinin de Mello, Carmen Ortiz. 145-153
- Two Conjectures on the Chromatic PolynomialDavid Avis, Caterina De Simone, Paolo Nobili. 154-162
- Finding Skew Partitions EfficientlyCelina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed. 163-172
- On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract)Allan Borodin, Ran El-Yaniv, Vincent Gogan. 173-196
- Almost ::::k::::-Wise Independence and Hard Boolean FunctionsValentine Kabanets. 197-206
- Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing FunctionAndris Ambainis, Satyanarayana V. Lokam. 207-216
- Multi-parameter Minimum Spanning TreesDavid Fernández-Baca. 217-226
- Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract)Ruy Luiz Milidiú, Eduardo Sany Laber. 227-236
- Uniform Multi-hop All-to-All Optical Routings in RingsJaroslav Opatrny. 237-246
- A Fully Dynamic Algorithm for Distributed Shortest PathsSerafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni. 247-257
- Integer Factorization and Discrete Logarithms (Abstract)Andrew M. Odlyzko. 258
- Communication Complexity and Fourier Coefficients of the Diffie-Hellman KeyIgor Shparlinski. 259-268
- Quintic Reciprocity and Primality Test for Numbers of the Form M = A5:::n:::±omega::n::Pedro Berrizbeitia, Mauricio Odremán Vera, Juan Tena Ayuso. 269-279
- Determining the Optimal Contrast for Secret Sharing Schemes in Visual CryptographyMatthias Krause, Hans-Ulrich Simon. 280-291
- Average-Case Analysis of Retangle PackingsEdward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler. 292-297
- Heights in Generalized Tries and PATRICIA TriesCharles Knessl, Wojciech Szpankowski. 298-307
- On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended AbstractDominique Barth, Sylvie Corteel, Alain Denise, Danièle Gardy, Mario Valencia-Pabon. 308-317
- Subresultants RevisitedJoachim von zur Gathen, Thomas Lücking. 318-342
- A Unifying Framework for the Analysis of a Class of Euclidean AlgorithmsBrigitte Vallée. 343-354
- Worst-Case Complexity of the Optimal LLL AlgorithmAli Akhavi. 355-366
- Iteration Algebras Are Not Finitely Axiomatizable. Extended AbstractStephen L. Bloom, Zoltán Ésik. 367-376
- Undecidable Problems in Unreliable ComputationsRichard Mayr. 377-386
- Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free GroupsClaudio Gutiérrez. 387-396
- Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of TransducersMarie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch. 397-406
- Unambiguous Büchi AutomataOlivier Carton, Max Michel. 407-416
- Linear Time Language Recognition on Cellular Automata with Restricted CommunicationThomas Worsch. 417-426
- From Semantics to Spatial DistributionLuis R. Sierra Abbate, Pedro R. D Argenio, Juan V. Echagüe. 427-436
- On the Expressivity and Complexity of Quantitative Branching-Time Temporal LogicsFrançois Laroussinie, Ph. Schnoebelen, Mathieu Turuani. 437-446
- A Theory of Operational Equivalence for Interaction NetsMaribel Fernández, Ian Mackie. 447-456
- Run Statistics for Geometrically Distributed Random Variables (Extended Abstract)Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger. 457-462
- Generalized Covariances of Multi-dimensional Brownian Excursion Local TimesGuy Louchard. 463-472
- Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending RunsHelmut Prodinger. 473-482