Skip to main content
  • Conference proceedings
  • © 1998

LATIN'98: Theoretical Informatics

Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1380)

Conference series link(s): LATIN: Latin American Symposium on Theoretical Informatics

Conference proceedings info: LATIN 1998.

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (33 papers)

  1. Front Matter

  2. Analysis of Rabin's polynomial irreducibility test

    • Daniel Panario, Alfredo Viola
    Pages 1-10
  3. A chip search problem on binary numbers

    • Peter Damaschke
    Pages 11-22
  4. Uniform service systems with k servers

    • Esteban Feuerstein
    Pages 23-32
  5. Super-state automata and rational trees

    • Frédérique Bassino, Marie -Pierre Béal, Dominique Perrin
    Pages 42-52
  6. An Eilenberg theorem for words on countable ordinals

    • Nicolas Bedon, Olivier Carton
    Pages 53-64
  7. Maximal groups in free Burnside semigroups

    • Alair Pereira do Lago
    Pages 65-75
  8. Positive varieties and infinite words

    • Jean -éric Pin
    Pages 76-87
  9. Unfolding parametric automata

    • Maxcos Veloso Peixoto, Laurent Fribourg
    Pages 88-101
  10. Fundamental structures in Well-Structured infinite Transition Systems

    • Alain Finkel, Philippe Schnoebelen
    Pages 102-118
  11. Shape reconstruction with Delaunay complex

    • Herbert Edelsbrunner
    Pages 119-132
  12. Bases for non-homogeneous polynomial C k splines on the sphere

    • Anamaria Gomide, Jorge Stolfi
    Pages 133-140
  13. The splitting number of the 4-cube

    • Luerbio Faria, Celina Miraglia Herrera de Figueiredo, Candido Ferreira Xavier de MendonÇa Neto
    Pages 141-150
  14. Short and smooth polygonal paths

    • James Abello, Emden Gansner
    Pages 151-162
  15. Quantum cryptanalysis of hash and claw-free functions

    • Gilles Brassard, Peter HØyer, Alain Tapp
    Pages 163-169
  16. Batch verification with applications to cryptography and checking

    • Mihir Bellare, Juan A. Garay, Tal Rabin
    Pages 170-191
  17. Spectral techniques in graph algorithms

    • Noga Alon
    Pages 206-215

Other Volumes

  1. LATIN'98: Theoretical Informatics

About this book

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.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access