Latin 1992
LATIN 92
Latin American Theoretical Informatics
April 6–9, 1992
São Paulo, Brazil
Topics
- algorithms and data structures
- automata and formal languages
- computability and complexity
- computational geometry
- cryptography
- parallel and distributed computing
- symbolic and algebraic computation
- combinatorial and algebraic aspects of computer science
Program Committee
- Ricardo Baeza-Yates, Santiago, Chile
- Walter Cunto, Caracas, Venezuela
- Joachim von zur Gathen, Toronto, Canada
- Eric Goles, Santiago, Chile
- Martin Grötschel, Berlin, Germany
- Jozef Gruska, Bratislava and Hamburg, Germany
- Juhani Karhumäki, Turku, Finland
- Cláudio L. Lucchesi, Campinas, Brazil
- Dominique Perrin, Paris, France
- Joel Seiferas, Rochester, USA
- Jeff Shallit, Waterloo, Canada
- Imre Simon (chair), São Paulo, Brazil
- Janos Simon, Chicago, USA
- Siang Wun Song, São Paulo, Brazil
- Jayme Szwarcfiter, Rio de Janeiro, Brazil
- William T. Trotter, Bellcore, USA
Organizing Committee
- Paulo Feofiloff (chair), São Paulo, Brazil
- Cristina G. Fernandes, São Paulo, Brazil
- Marco D. Gubitoso, São Paulo, Brazil
- Tomasz Kowaltowski, Campinas , Brazil
- Arnaldo Mandel, São Paulo, Brazil
- Tito M. B. Homem de Mello, São Paulo, Brazil
- Arnaldo V. Moura, Rio de Janeiro, Brazil
- Daniel Panario, São Paulo, Brazil
- Júlio M. Stern, São Paulo, Brazil
- Yoshiko Wakabayashi, São Paulo, Brazil
Invited lectures
- Erich Kaltofen (Rensselaer Polytechnic),
A Decade of Research on Polynomial Factorization
- Vaughan Pratt (Stanford),
Arithmetic + Logic + Geometry = Concurrency
- Gene Myers (Arizona),
Approximate Matching of Network Expressions with Spacers
- Arjen K. Lenstra (Bellcore),
Massively Parallel Computing and Factoring
- A. de Luca (Roma 'La Sapienza') and S. Varricchio (L'Aquila),
Some Regularity Conditions Based on Well Quasi-orders
- Manuel Blum (Berkeley),
Universal Statistical Tests
- Jean-Paul Allouche (Bordeaux I),
q-Regular Sequences and Other Generalizations
of q-Automatic Sequences
- Michel Cosnard (Lyon),
Complexity Issues in Neural Network Computations
- Kosaburo Hashiguchi (Toyohashi),
The Double Reconstruction Conjectures about
Colored Hypergraphs and Colored Directed Graphs
- Jean-Eric Pin (Bull Research and Development),
On Reversible Automata
- Dan Sleator (Carnegie Mellon),
Data Structures and Terminating Petri Nets
Papers, programm, etc.
Proceedings
The proceedings were published
as
volume 583 of
LNCS (Lecture Notes in Computer Science, Springer-Verlag),
having Imre Simon as editor.
[Cover of LNCS proceedings]
Location
The Symposium was held in São Paulo,
at the Conference Auditorium
on the University of São Paulo campus.
Report
Subsequent LATIN meetings
LATIN 92 was the first of
a series of LATIN meetings:
See the
LNCS LATIN series on DBLP.
