Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2004

LATIN 2004: Theoretical Informatics

6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings

Editors:

  1. Martín Farach-Colton

    1. Department of Computer Science, Rutgers University, Piscataway

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Conference proceedings info: LATIN 2004.

Sections

Buy it now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (63 papers)

  1. Contributions

    2. A Geometric Approach to the Bisection Method

      • Claudio Gutierrez, Flavio Gutierrez, Maria-Cecilia Rivara
      Pages 172-180

    4. A Constant Approximation Algorithm for Sorting Buffers

      • Jens S. Kohrt, Kirk Pruhs
      Pages 193-202

    5. Approximation Schemes for a Class of Subset Selection Problems

      • Kirk Pruhs, Gerhard J. Woeginger
      Pages 203-211

    6. Finding k-Connected Subgraphs with Minimum Average Weight

      • Prabhakar Gubbala, Balaji Raghavachari
      Pages 212-221

    9. How Expressions Can Code for Automata

      • Sylvain Lombardy, Jacques Sakarovitch
      Pages 242-251

    10. Automata for Arithmetic Meyer Sets

      • Shigeki Akiyama, Frédérique Bassino, Christiane Frougny
      Pages 252-261

    11. Efficiently Computing the Density of Regular Languages

      • Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer
      Pages 262-270

    12. Longest Repeats with a Block of Don’t Cares

      • Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
      Pages 271-278

    15. Expected Length of the Longest Common Subsequence for Large Alphabets

      • Marcos Kiwi, Martin Loebl, Jiří Matoušek
      Pages 302-311

    17. Separating Codes: Constructions and Bounds

      • Gérard Cohen, Hans Georg Schaathun
      Pages 322-328

    18. Encoding Homotopy of Paths in the Plane

      • Sergei Bespamyatnikh
      Pages 329-338

    19. A Unified Approach to Coding Labeled Trees

      • Saverio Caminiti, Irene Finocchi, Rossella Petreschi
      Pages 339-348

    20. Cost-Optimal Trees for Ray Shooting

      • Hervé Brönnimann, Marc Glisse
      Pages 349-358
Back to top

Other Volumes

  1. LATIN 2004: Theoretical Informatics

Back to top

About this book

This volume contains the proceedings of the Latin American Theoretical Inf- matics (LATIN) conference that was held in Buenos Aires, Argentina, April 5–8, 2004. The LATIN series of symposia was launched in 1992 to foster interactions between the Latin American community and computer scientists around the world. This was the sixth event in the series, following S˜ ao Paulo, Brazil (1992), Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este, Uruguay (2000), and Cancun, Mexico (2002). The proceedings of these conferences were also published by Springer-Verlag in the Lecture Notes in Computer Science series: Volumes 583, 911, 1380, 1776, and 2286, respectively. Also, as before, we published a selection of the papers in a special issue of a prestigious journal. We received 178 submissions. Each paper was assigned to four program c- mittee members, and 59 papers were selected. This was 80% more than the previous record for the number of submissions. We feel lucky to have been able to build on the solid foundation provided by the increasingly successful previous LATINs. And we are very grateful for the tireless work of Pablo Mart´ ?nez L´ opez, the Local Arrangements Chair. Finally, we thank Springer-Verlag for publishing these proceedings in its LNCS series.
Back to top

Keywords

Back to top

Editors and Affiliations

  • Department of Computer Science, Rutgers University, Piscataway

    Martín Farach-Colton

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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

Search

Navigation