LATIN B

48 papers

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