Table of contents

  1. Front Matter
  2. Paola Alimonti, Esteban Feuerstein, Umberto Nanni
    Pages 1-14
  3. David A. Mix Barrington, Howard Straubing
    Pages 24-31
  4. Danièle Beauquier, Michel Latteux, Karine Slowinski
    Pages 32-45
  5. M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. S. Tan
    Pages 46-60
  6. Said Bettayeb, Bin Cong, Mike Girou, I. Hal Sudborough
    Pages 61-70
  7. Manuel Blum
    Pages 71-75
  8. Anne Brüggemann-Klein
    Pages 87-98
  9. Véronique Bruyère
    Pages 99-107
  10. Svante Carlsson, Jingsen Chen
    Pages 108-116
  11. Felipe Cucker, Francesc Rosselló
    Pages 117-129
  12. W. Fernandez de la Vega, V. Th. Paschos, R. Saad
    Pages 130-138
  13. Christiane Frougny
    Pages 154-164
  14. Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
    Pages 165-176
  15. William I. Gasarch, Katia S. Guimarães
    Pages 177-190
  16. Mark Giesbrecht
    Pages 191-203
  17. Joseph Gil, Yossi Matias
    Pages 204-218
  18. Eric Goles, Marcos A. Kiwi
    Pages 219-230
  19. Joachim Hollman
    Pages 272-280
  20. Esther Jennings, Lenka Motyčková
    Pages 281-293
  21. Erich Kaltofen
    Pages 294-313
  22. Alair Pereira do Lago
    Pages 329-343
  23. Arjen K. Lenstra
    Pages 344-355
  24. Aldo de Luca, Stefano Varricchio
    Pages 356-371
  25. Rolf Niedermeier, Peter Rossmanith
    Pages 387-400
  26. Jean-Eric Pin
    Pages 401-416
  27. Oscar Porto
    Pages 417-429
  28. Vaughan Pratt
    Pages 430-447
  29. José D. P. Rolim
    Pages 448-459
  30. Daniel D. Sleator
    Pages 488-497
  31. X. Zhou, S. Nakano, H. Suzuki, T. Nishizeki
    Pages 516-529
  32. Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy
    Pages 530-544
  33. Back Matter

About these proceedings


This volume contains the proceedings of LATIN '92, a theoretical computer science symposium (Latin American Theoretical Informatics) held in S o Paulo, Brazil in April 1992. LATIN is intended to be a comprehensive symposium in the theory of computing, but for this first meeting the following areas were chosen for preferential coverage: algorithms and data structures, automata and formal languages, computability and complexity theory, computational geometry, cryptography, parallel and distributed computation, symbolic and algebraic computation, and combinatorial and algebraic aspects of computer science. The volume includesfull versions of the invited papers by 11 distinguished guest lecturers as well as 32 contributed papers selected from 66 submissions from authors with affiliations in 26 countries.


Algorithms Automat algorithm automata complexity complexity theory computability computational geometry computer computer science data structure data structures formal language formal languages

Bibliographic information

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