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