3. LATIN 1998: Campinas, Brazil

@proceedings{DBLP:conf/latin/1998,
  editor    = {Claudio L. Lucchesi and
               Arnaldo V. Moura},
  title     = {LATIN '98: Theoretical Informatics, Third Latin American Symposium,
               Campinas, Brazil, April, 20-24, 1998, Proceedings},
  booktitle = {LATIN},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1380},
  year      = {1998},
  isbn      = {3-540-64275-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Algorithms, Complexity

• Daniel Panario, Alfredo Viola:
  Analysis of Rabin's Polynomial Irreducability Test. 1-10
  Electronic Edition (Springer LINK) BibTeX
• Peter Damaschke:
  A Chip Search Problem on Binary Numbers. 11-22
  Electronic Edition (Springer LINK) BibTeX
• Esteban Feuerstein:
  Uniform Service System with k Servers. 23-32
  Electronic Edition (Springer LINK) BibTeX
• David Fernández-Baca:
  Faster Non-linear Parametric Search with Applications to Optimazation and Dynamic Geometry. 33-41
  Electronic Edition (Springer LINK) BibTeX

Automata, Transition Systems, Combinatorics on Words

• Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin:
  Super-State Automata and Rational Trees. 42-52
  Electronic Edition (Springer LINK) BibTeX
• Nicolas Bedon, Olivier Carton:
  An Eilenberg Theorem for Words on Countable Ordinals. 53-64
  Electronic Edition (Springer LINK) BibTeX
• Alair Pereira do Lago:
  Maximal Groups in Free Burnside Semigroups. 65-75
  Electronic Edition (Springer LINK) BibTeX
• Jean-Eric Pin:
  Positive Varieties and Infinite Words. 76-87
  Electronic Edition (Springer LINK) BibTeX
• Marcos Veloso Peixoto, Laurent Fribourg:
  Unfolding Parametric Automata. 88-101
  Electronic Edition (Springer LINK) BibTeX
• Alain Finkel, Ph. Schnoebelen:
  Fundamental Structures in Well-Structured Infinite Transition Systems. 102-118
  Electronic Edition (Springer LINK) BibTeX

Computational Geometry, Graph Drawing

• Herbert Edelsbrunner:
  Shape Reconstruction with Delaunay Complex. 119-132
  Electronic Edition (Springer LINK) BibTeX
• Anamaria Gomide, Jorge Stolfi:
  Bases for Non-homogeneous Polynomial C_k Splines on the Sphere. 133-140
  Electronic Edition (Springer LINK) BibTeX
• Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
  The Splitting Number of the 4-Cube. 141-150
  Electronic Edition (Springer LINK) BibTeX
• James Abello, Emden R. Gansner:
  Short and Smooth Polygonal Paths. 151-162
  Electronic Edition (Springer LINK) BibTeX

Cryptography

• Gilles Brassard, Peter Høyer, Alain Tapp:
  Quantum Cryptanalysis of Hash and Claw-Free Functions. 163-169
  Electronic Edition (Springer LINK) BibTeX
• Mihir Bellare, Juan A. Garay, Tal Rabin:
  Batch Verification with Applications to Cryptography and Checking. 170-191
  Electronic Edition (Springer LINK) BibTeX
• Alejandro Hevia, Marcos A. Kiwi:
  Strength of Two Data Encryption Standard Implementations under Timing Attacks. 192-205
  Electronic Edition (Springer LINK) BibTeX

Graph Theory, Algorithms on Graphs

• Noga Alon:
  Spectral Techniques in Graph Algorithms. 206-215
  Electronic Edition (Springer LINK) BibTeX
• Michael Molloy, Bruce A. Reed:
  Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. 216-225
  Electronic Edition (Springer LINK) BibTeX
• Orlando Lee, Yoshiko Wakabayashi:
  Circuit Covers in Series-Parallel Mixed Graphs. 226-238
  Electronic Edition (Springer LINK) BibTeX
• Elias Dahlhaus:
  A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization. 239-248
  Electronic Edition (Springer LINK) BibTeX
• Klaus Jansen:
  A New Characterization for Parity Graphs and a Coloring Problem with Costs. 249-260
  Electronic Edition (Springer LINK) BibTeX
• Marisa Gutierrez, João Meidanis:
  On the Clique Operator. 261-272
  Electronic Edition (Springer LINK) BibTeX

Packet Routing

• Andrei Z. Broder, Alan M. Frieze, Eli Upfal:
  Dynamic Packet Routing on Arrays with Bounded Buffers. 273-281
  Electronic Edition (Springer LINK) BibTeX
• Alan Roberts, Antonios Symvonis:
  On-Line Matching Routing on Trees. 282-291
  Electronic Edition (Springer LINK) BibTeX

Parallel Algorithms

• Dana Randall, Prasad Tetali:
  Analyzing Glauber Dynamics by Comparison of Markov Chains. 292-304
  Electronic Edition (Springer LINK) BibTeX
• Joachim von zur Gathen, Igor Shparlinski:
  The CREW PRAM Complexity of Modular Inversion. 305-315
  Electronic Edition (Springer LINK) BibTeX
• Friedhelm Meyer auf der Heide, Gabriel Terán Martinez:
  Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation. 316-330
  Electronic Edition (Springer LINK) BibTeX

Pattern Matching, Browsing

• Richard Beigel, Egemen Tanin:
  The Geometry of Browsing. 331-340
  Electronic Edition (Springer LINK) BibTeX
• Ricardo A. Baeza-Yates, Gonzalo Navarro:
  Fast Two-Dimensional Approximate Pattern Matching. 341-351
  Electronic Edition (Springer LINK) BibTeX
• Gonzalo Navarro:
  Improved Approximate Pattern Matching on Hypertext. 352-357
  Electronic Edition (Springer LINK) BibTeX
• Claudio Gutiérrez:
  Solving Equations in Strings: On Makanin's Algorithm. 358-373
  Electronic Edition (Springer LINK) BibTeX
• Marie-France Sagot:
  Spelling Approximate Repeated or Common Motifs Using a Suffix Tree. 374-390
  Electronic Edition (Springer LINK) BibTeX