- 2000
- Luis R. Sierra Abbate, Pedro R. D'Argenio, Juan V. Echagüe:
From Semantics to Spatial Distribution. LATIN 2000: 427-436 - Ali Akhavi:
Worst-Case Complexity of the Optimal LLL Algorithm. LATIN 2000: 355-366 - Andris Ambainis, Satyanarayana V. Lokam:
Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function. LATIN 2000: 207-216 - David Avis, Caterina De Simone, Paolo Nobili:
Two Conjectures on the Chromatic Polynomial. LATIN 2000: 154-162 - 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. LATIN 2000: 308-317 - Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch:
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. LATIN 2000: 397-406 - Michael A. Bender, Martin Farach-Colton:
The LCA Problem Revisited. LATIN 2000: 88-94 - Pedro Berrizbeitia, Mauricio Odremán Vera, Juan Tena Ayuso:
Quintic Reciprocity and Primality Test for Numbers of the Form M = A5n±omegan. LATIN 2000: 269-279 - Stephen L. Bloom, Zoltán Ésik:
Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. LATIN 2000: 367-376 - Allan Borodin, Ran El-Yaniv, Vincent Gogan:
On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract). LATIN 2000: 173-196 - Olivier Carton, Max Michel:
Unambiguous Büchi Automata. LATIN 2000: 407-416 - Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni:
A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN 2000: 247-257 - Edward G. Coffman Jr., George S. Lueker, Joel Spencer, Peter M. Winkler:
Average-Case Analysis of Retangle Packings. LATIN 2000: 292-297 - Myra B. Cohen, Charles J. Colbourn:
Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays. LATIN 2000: 95-104 - 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). LATIN 2000: 126-134 - David Fernández-Baca:
Multi-parameter Minimum Spanning Trees. LATIN 2000: 217-226 - Maribel Fernández, Ian Mackie:
A Theory of Operational Equivalence for Interaction Nets. LATIN 2000: 447-456 - Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed:
Finding Skew Partitions Efficiently. LATIN 2000: 163-172 - Celina M. H. de Figueiredo, Célia Picinin de Mello, Carmen Ortiz:
Edge Colouring Reduced Indifference Graphs. LATIN 2000: 145-153 - Joachim von zur Gathen, Thomas Lücking:
Subresultants Revisited. LATIN 2000: 318-342 - Andreas Goerdt, Michael Molloy:
Analysis of Edge Deletion Processes on Faulty Random Regular Graphs. LATIN 2000: 38-47 - Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger:
Run Statistics for Geometrically Distributed Random Variables (Extended Abstract). LATIN 2000: 457-462 - Claudio Gutierrez:
Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups. LATIN 2000: 387-396 - Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Approximation Algorithms for Flexible Job Shop Problems. LATIN 2000: 68-77 - Valentine Kabanets:
Almost k-Wise Independence and Hard Boolean Functions. LATIN 2000: 197-206 - Charles Knessl, Wojciech Szpankowski:
Heights in Generalized Tries and PATRICIA Tries. LATIN 2000: 298-307 - Yoshiharu Kohayakawa, Vojtech Rödl:
Algorithmic Aspects of Regularity. LATIN 2000: 1-17 - Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Skokan:
Equivalent Conditions for Regularity (Extended Abstract). LATIN 2000: 48-57 - Matthias Krause, Hans Ulrich Simon:
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. LATIN 2000: 280-291 - François Laroussinie, Philippe Schnoebelen, Mathieu Turuani:
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. LATIN 2000: 437-446