[go: up one dir, main page]
Skip to main content
Springer Nature Link
Account

LATIN '92

1st Latin American Symposium on Theoretical Informatics, Sao Paulo, Brazil, April 6-10, 1992. Proceedings

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Imre Simon

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

Included in the following conference series:

Conference proceedings info: LATIN 1992.

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

Access this book

Log in via an institution
Softcover Book EUR 52.74
Price includes VAT (France)
  • 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

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (43 papers)

  1. Front Matter

    Download chapter PDF

  2. Linear time algorithms for liveness and boundedness in conflict-free Petri nets

    • Paola Alimonti, Esteban Feuerstein, Umberto Nanni
    Pages 1-14

  3. q-Regular sequences and other generalizations of q-automatic sequences

    • Jean-Paul Allouche
    Pages 15-23

  4. Complex polynomials and circuit lower bounds for modular counting

    • David A. Mix Barrington, Howard Straubing
    Pages 24-31

  5. A decidability result about convex polyominoes

    • Danièle Beauquier, Michel Latteux, Karine Slowinski
    Pages 32-45

  6. Edge insertion for optimal triangulations

    • M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. S. Tan
    Pages 46-60

  7. Simulating permutation networks on hypercubes

    • Said Bettayeb, Bin Cong, Mike Girou, I. Hal Sudborough
    Pages 61-70

  8. Universal statistical tests

    • Manuel Blum
    Pages 71-75

  9. Automata and pattern matching in planar directed acyclic graphs

    • F. Bossut, B. Warin
    Pages 76-86

  10. Regular expressions into finite automata

    • Anne Brüggemann-Klein
    Pages 87-98

  11. Automata and codes with bounded deciphering delay

    • Véronique Bruyère
    Pages 99-107

  12. Parallel complexity of heaps and min-max heaps

    • Svante Carlsson, Jingsen Chen
    Pages 108-116

  13. On the complexity of some problems for the Blum, Shub & Smale model

    • Felipe Cucker, Francesc Rosselló
    Pages 117-129

  14. Average case analysis of a greedy algorithm for the minimum hitting set problem

    • W. Fernandez de la Vega, V. Th. Paschos, R. Saad
    Pages 130-138

  15. Achieving optimality for gate matrix layout and PLA folding: A graph theoretic approach

    • Afonso G. Ferreira, Siang W. Song
    Pages 139-153

  16. How to write integers in non-integer base

    • Christiane Frougny
    Pages 154-164

  17. A simple randomized parallel algorithm for maximal f-matchings

    • Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
    Pages 165-176

  18. On the number of components of a recursive graph

    • William I. Gasarch, Katia S. Guimarães
    Pages 177-190

  19. Factoring in skew-polynomial rings

    • Mark Giesbrecht
    Pages 191-203

  20. Leaders election without conflict resolution rule

    • Joseph Gil, Yossi Matias
    Pages 204-218
Back to top

Other volumes

  1. LATIN '92

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top