Yoshiharu Kohayakawa and Vojtech Rödl, Algorithmic Aspects of Regularity. [Bibtex] Michele Zito, Small Maximal Matchings in Random Graphs. [Bibtex] Vlady Ravelomanana and Loÿs Thimonier, Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs. [Bibtex] Andreas Goerdt and Michael Molloy, Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. [Bibtex] Yoshiharu Kohayakawa, Vojtech Rödl and J. Skodan, Equivalent Conditions for Regularity (Extended Abstract). [Bibtex] Flavio Keidi Miyazawa and Yoshiko Wakabayashi, Cube Packing. [Bibtex] Klaus Jansen, Monaldo Mastrolilli and Roberto Solis-Oba, Approximation Algorithms for Flexible Job Shop Problems. [Bibtex] Stephen Taylor, Emerging Behavior as Binary Search Trees Are Symmetrically Updated. [Bibtex] Michael A. Bender and Martin Farach-Colton, The LCA Problem Revisited. [Bibtex] Myra B. Cohen and Charles J. Colbourn, Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays. [Bibtex] Lucia Moura, Rank Inequalities for Packing Designs and Sparse Triple Systems. [Bibtex] Brett Stevens, The Anti-Oberwolfach Solution: Pancyclic 2- Factorizations of Complete Graphs. [Bibtex] Prabhakar Raghavan, Graph Structure of the Web: A Survey. [Bibtex] Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce Reed and Udi Rotics, Polynomial Time Recognition of Clique-Width \(\leq 3\) Graphs (Extended Abstract). [Bibtex] Cláudia Linhares Sales and Frédéric Maffray, On Dart-Free Perfectly Contractile Graphs. Extended Abstract. [Bibtex] Celina M. H. de Figueiredo, Célia Picinin de Mello and Carmen Ortiz, Edge Colouring Reduced Indifference Graphs. [Bibtex] David Avis, Caterina De Simone and Paolo Nobili, Two Conjectures on the Chromatic Polynomial. [Bibtex] Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa and Bruce Reed, Finding Skew Partitions Efficiently. [Bibtex] Allan Borodin, Ran El-Yaniv and Vincent Gogan, On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract). [Bibtex] Valentine Kabanets, Almost \(k\)-Wise Independence and Hard Boolean Functions. [Bibtex] Andris Ambainis and Satyanarayana V. Lokam, Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function. [Bibtex] David Fernández-Baca, Multi-parameter Minimum Spanning Trees. [Bibtex] Ruy Luiz Milidiú and Eduardo Sany Laber, Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract). [Bibtex] Jaroslav Opatrny, Uniform Multi-hop All-to-All Optical Routings in Rings. [Bibtex] Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni and Umberto Nanni, A Fully Dynamic Algorithm for Distributed Shortest Paths. [Bibtex] Andrew M. Odlyzko, Integer Factorization and Discrete Logarithms (Abstract). [Bibtex] Igor Shparlinski, Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key. [Bibtex] Pedro Berrizbeitia, Mauricio Odreman Vera and Juan Tena Ayuso, Quintic Reciprocity and Primality Test for Numbers of the Form \(M = A5^n\pm\omega_n\). [Bibtex] Matthias Krause and Hans-Ulrich Simon, Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. [Bibtex] Edward G. Coffman Jr., George S. Lueker, Joel Spencer and Peter M. Winkler, Average-Case Analysis of Rectangle Packings. [Bibtex] Charles Knessl and Wojciech Szpankowski, Heights in Generalized Tries and PATRICIA Tries. [Bibtex] Dominique Barth, Sylvie Corteel, Alain Denise, Danièle Gardy and Mario Valencia-Pabon, On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract. [Bibtex] Joachim von zur Gathen and Thomas Lücking, Subresultants Revisited. [Bibtex] Brigitte Vallée, A Unifying Framework for the Analysis of a Class of Euclidean Algorithms. [Bibtex] Ali Akhavi, Worst-Case Complexity of the Optimal LLL Algorithm. [Bibtex] Stephen L. Bloom and Zoltán Ésik, Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. [Bibtex] Richard Mayr, Undecidable Problems in Unreliable Computations. [Bibtex] Claudio Gutiérrez, Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups. [Bibtex] Marie-Pierre Béal, Olivier Carton, Christophe Prieur and Jacques Sakarovitch, Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. [Bibtex] Olivier Carton and Max Michel, Unambiguous Büchi Automata. [Bibtex] Thomas Worsch, Linear Time Language Recognition on Cellular Automata with Restricted Communication. [Bibtex] Luis R. Sierra Abbate, Pedro R. D'Argenio and Juan V. Echagüe, From Semantics to Spatial Distribution. [Bibtex] François Laroussinie, Ph. Schnoebelen and M. Turuani, On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. [Bibtex] Maribel Fernández and Ian Mackie, A Theory of Operational Equivalence for Interaction Nets. [Bibtex] Peter J. Grabner, Arnold Knopfmacher and Helmut Prodinger, Run Statistics for Geometrically Distributed Random Variables (Extended Abstract). [Bibtex] Guy Louchard, Generalized Covariances of Multi-dimensional Brownian Excursion Local Times. [Bibtex] Helmut Prodinger, Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending Runs. [Bibtex]

[Home] [All LATIN Papers] [LATIN 2000]