LATIN '92

1. Dynamics of sand-piles games on graphs

   • Eric Goles, Marcos A. Kiwi

   Pages 219-230

2. Rational function decomposition and Gröbner bases in the parameterization of plane curves

   • Jaime Gutierrez, Tomas Recio

   Pages 231-245

3. The double reconstruction conjectures about colored hypergraphs and colored directed graphs

   • Kosaburo Hashiguchi

   Pages 246-261

4. Locally definable acceptance types — The three-valued case

   • Ulrich Hertrampf

   Pages 262-271

5. On the computation of the Hilbert series

   • Joachim Hollman

   Pages 272-280

6. A distributed algorithm for finding all maximal cliques in a network graph

   • Esther Jennings, Lenka Motyčková

   Pages 281-293

7. Polynomial factorization 1987–1991

   • Erich Kaltofen

   Pages 294-313

8. Properties of recognizable \(\mathcal{M}\)-subsets of a free monoid

   • Nami Kobayashi

   Pages 314-328

9. On the Burnside semigroups x ⁿ = x ^n+m

   • Alair Pereira do Lago

   Pages 329-343

10. Massively parallel computing and factoring

    • Arjen K. Lenstra

    Pages 344-355

11. Some regularity conditions based on well quasi-orders

    • Aldo de Luca, Stefano Varricchio

    Pages 356-371

12. Approximate matching of network expressions with spacers

    • Gene Myers

    Pages 372-386

13. Unambiguous simulations of auxiliary pushdown automata and circuits

    • Rolf Niedermeier, Peter Rossmanith

    Pages 387-400

14. On reversible automata

    • Jean-Eric Pin

    Pages 401-416

15. Even induced cycles in planar graphs

    • Oscar Porto

    Pages 417-429

16. Arithmetic + logic + geometry = concurrency

    • Vaughan Pratt

    Pages 430-447

17. On the density and core of the complexity classes

    • José D. P. Rolim

    Pages 448-459

18. The “last” decision problem for rational trace languages

    • Jacques Sakarovitch

    Pages 460-473

19. Improved bounds for mixing rates of Markov chains and multicommodity flow

    • Alistair Sinclair

    Pages 474-487

20. Data structures and terminating Petri nets

    • Daniel D. Sleator

    Pages 488-497

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
• algorithm analysis and problem complexity
• combinatorics

Policies and ethics