Skip to main content
  • Conference proceedings
  • © 1995

LATIN '95: Theoretical Informatics

Second Latin American Symposium, Valparaiso, Chile, April 3 - 7, 1995. Proceedings

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

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

Conference proceedings info: LATIN 1995.

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 (38 papers)

  1. Front Matter

  2. Visibility graphs of 2-spiral polygons (Extended abstract)

    • James Abello, Krishna Kumar
    Pages 1-15
  3. Random generation of colored trees

    • L. Alonso, R. Schott
    Pages 16-35
  4. Space filling curves and their use in the design of geometric data structures

    • Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
    Pages 36-48
  5. Tight bounds for finding degrees from the adjacency matrix

    • R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
    Pages 49-59
  6. Lower bounds for modular counting by circuits with modular gates

    • David Mix Barrington, Howard Straubing
    Pages 60-71
  7. On the relation between BDDs and FDDs

    • Bernd Becker, Rolf Drechsler, Ralph Werchner
    Pages 72-83
  8. On dynamical properties of generalized toggle automata

    • F. Blanchard, A. Maass
    Pages 84-98
  9. Free shuffle algebras in language varieties extended abstract

    • Stephen L. Bloom, Zoltán Ésik
    Pages 99-111
  10. Lower bounds for the matrix chain ordering problem

    • Phillip G. Bradford, Venkatesh Choppella, Gregory J. E. Rawlins
    Pages 112-130
  11. Recognizable sets of numbers in nonstandard bases

    • Véronique Bruyère, Georges Hansel
    Pages 167-179
  12. On weak growing context-sensitive grammars

    • Gerhard Buntrock, Gundula Niemann
    Pages 180-194
  13. Logic of plotkin continuous domain

    • Benjamín R. Callejas Bedregal, Benedito Melo Acióly
    Pages 195-206
  14. (Probabilistic) recurrence relations revisited

    • Shiva Chaudhuri, Devdatt Dubhashi
    Pages 207-219
  15. On linear-time alphabet-independent 2-dimensional pattern matching

    • Maxime Crochemore, Wojciech Rytter
    Pages 220-229
  16. Nearest neighbour graph realizability is NP-hard

    • Peter Eades, Sue Whitesides
    Pages 245-256
  17. Paging more than one page

    • Esteban Feuerstein
    Pages 272-285

Other Volumes

  1. LATIN '95: Theoretical Informatics

About this book

This volume constitutes the proceedings of the Second International Symposium, Latin American Theoretical Informatics, LATIN '95, held in Valparaiso, Chile in April 1995.
The LATIN symposia are intended to be comprehensive events on the theory of computing; they provide a high-level forum for theoretical computer science research in Latin America and facilitate a strong and healthy interaction with the international community. The 38 papers presented in this volume were carefully selected from 68 submissions. Despite the intended broad coverage there are quite a number of papers devoted to computational graph theory; other topics strongly represented are complexity, automata theory, networks, symbolic computation, formal languages, data structures, and pattern matching.

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