Table of contents

  1. Front Matter
  2. Daniel Panario, Alfredo Viola
    Pages 1-10
  3. Peter Damaschke
    Pages 11-22
  4. Esteban Feuerstein
    Pages 23-32
  5. Frédérique Bassino, Marie -Pierre Béal, Dominique Perrin
    Pages 42-52
  6. Nicolas Bedon, Olivier Carton
    Pages 53-64
  7. Alair Pereira do Lago
    Pages 65-75
  8. Jean -éric Pin
    Pages 76-87
  9. Maxcos Veloso Peixoto, Laurent Fribourg
    Pages 88-101
  10. Alain Finkel, Philippe Schnoebelen
    Pages 102-118
  11. Herbert Edelsbrunner
    Pages 119-132
  12. Anamaria Gomide, Jorge Stolfi
    Pages 133-140
  13. Luerbio Faria, Celina Miraglia Herrera de Figueiredo, Candido Ferreira Xavier de MendonÇa Neto
    Pages 141-150
  14. James Abello, Emden Gansner
    Pages 151-162
  15. Gilles Brassard, Peter HØyer, Alain Tapp
    Pages 163-169
  16. Mihir Bellare, Juan A. Garay, Tal Rabin
    Pages 170-191
  17. Noga Alon
    Pages 206-215
  18. Orlando Lee, Yoshiko Wakabayashi
    Pages 226-238
  19. Marisa Gutierrez, JoÃo Meidanis
    Pages 261-272
  20. Andrei Z. Broder, Alan M. Frieze, Eli Upfal
    Pages 273-281
  21. Alan Roberts, Antonios Symvonis
    Pages 282-291
  22. Dana Randall, Prasad Tetali
    Pages 292-304
  23. Joachim van zur Gathen, Igor Shparlinski
    Pages 305-315
  24. Friedhelm Meyer auf der Heide, Gabriel Terán Martinez
    Pages 316-330
  25. Richard Beigel, Egemen Tanin
    Pages 331-340
  26. Ricardo Baeza-Yates, Gonzalo Navarro
    Pages 341-351
  27. Claudio Gutiérrez
    Pages 358-373

About these proceedings


This book constitutes the refereed proceedings of the Third Latin American Symposium on Theoretical Informatics, LATIN'98, held in Campinas, Brazil, in April 1998.
The 28 revised full papers presented together with five invited surveys were carefully selected from a total of 53 submissions based on 160 referees' reports. The papers are organized in sections on algorithms and complexity; automata, transition systems and combinatorics on words; computational geometry and graph drawing; cryptography; graph theory and algorithms on graphs; packet routing; parallel algorithms; and pattern matching and browsing.


Analysis Automat Splines algorithms automata combinatorics combinatorics on words communication complexity computational geometry optimization verification

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-64275-6
  • Online ISBN 978-3-540-69715-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site