Advertisement

LATIN 2004: Theoretical Informatics

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

  • Martín Farach-Colton
Conference proceedings LATIN 2004

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

Table of contents

  1. Contributions

    1. Mihai Bădoiu, Erik D. Demaine
      Pages 466-473
    2. Ali Akhavi, Céline Moreira Dos Santos
      Pages 474-487
    3. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan
      Pages 488-498
    4. Jesper Jansson, Joseph H. -K. Ng, Kunihiko Sadakane, Wing-Kin Sung
      Pages 499-508
    5. Edith Hemaspaandra, Holger Spakowski, Mayur Thakur
      Pages 509-518
    6. Olga Tveretina, Hans Zantema
      Pages 530-539
    7. Argimiro Arratia, Carlos E. Ortiz
      Pages 540-556
    8. Joachim von zur Gathen
      Pages 557-566
    9. Mark Cieliebak
      Pages 577-588
    10. Bernard Mans, Igor Shparlinski
      Pages 589-598
    11. Paola Flocchini, Evangelos Kranakis, Danny Krizanc, Nicola Santoro, Cindy Sawchuk
      Pages 599-608
    12. Jeremy Elson, Richard M. Karp, Christos H. Papadimitriou, Scott Shenker
      Pages 609-624
  2. Back Matter

About these proceedings

Introduction

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.

Keywords

Alphabet Computer algorithms automata codes combinatorial approximation complexity computational geometry computational mathematics computer science database discrete mathematics graph computations logic theory of computing

Editors and affiliations

  • Martín Farach-Colton
    • 1
  1. 1.Department of Computer ScienceRutgers UniversityPiscataway

Bibliographic information

  • DOI https://doi.org/10.1007/b95852
  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-21258-4
  • Online ISBN 978-3-540-24698-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Automotive
Electronics
IT & Software
Telecommunications
Law
Aerospace
Engineering