LATIN 2004: Theoretical Informatics

1. Front Matter

   PDF

2. Invited Speakers

   1. Analysis of Scheduling Algorithms for Proportionate Fairness

      • Mike Paterson

      Pages 1-1

   2. Advances in the Regularity Method

      • Yoshiharu Kohayakawa

      Pages 2-2

   3. Fighting Spam: The Science

      • Cynthia Dwork

      Pages 3-4

   4. The Consequences of Imre Simon’s Work in the Theory of Automata, Languages, and Semigroups

      • Jean-Eric Pin

      Pages 5-5

3. Contributions

   1. Querying Priced Information in Databases: The Conjunctive Case

      • Sany Laber, Renato Carmo, Yoshiharu Kohayakawa

      Pages 6-15

   2. Sublinear Methods for Detecting Periodic Trends in Data Streams

      • Funda Ergun, S. Muthukrishnan, S. Cenk Sahinalp

      Pages 16-28

   3. An Improved Data Stream Summary: The Count-Min Sketch and Its Applications

      • Graham Cormode, S. Muthukrishnan

      Pages 29-38

   4. Rotation and Lighting Invariant Template Matching

      • Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro

      Pages 39-48

   5. Computation of the Bisection Width for Random d-Regular Graphs

      • Josep Díaz, Maria J. Serna, Nicholas C. Wormald

      Pages 49-58

   6. Constrained Integer Partitions

      • Christian Borgs, Jennifer T. Chayes, Stephan Mertens, Boris Pittel

      Pages 59-68

   7. Embracing the Giant Component

      • Abraham Flaxman, David Gamarnik, Gregory B. Sorkin

      Pages 69-79

   8. Sampling Grid Colorings with Fewer Colors

      • Dimitris Achlioptas, Mike Molloy, Cristopher Moore, Frank Van Bussel

      Pages 80-89

   9. The Complexity of Finding Top-Toda-Equivalence-Class Members

      • Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand

      Pages 90-99

   10. List Partitions of Chordal Graphs

       • Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti

       Pages 100-108

   11. Bidimensional Parameters and Local Treewidth

       • Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos

       Pages 109-118

   12. Vertex Disjoint Paths on Clique-Width Bounded Graphs

       • Frank Gurski, Egon Wanke

       Pages 119-128

   13. On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications

       • Frédéric Gardi

       Pages 129-140

   14. Collective Tree Exploration

       • Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc

       Pages 141-151

   15. Off-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations

       • Alper Üngör

       Pages 152-161

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.

• Alphabet
• Computer
• algorithms
• automata
• codes
• combinatorial approximation
• complexity
• computational geometry
• computational mathematics
• computer science
• database
• discrete mathematics
• graph computations
• logic
• theory of computing
• algorithm analysis and problem complexity
• data structures

• Department of Computer Science, Rutgers University, Piscataway

  Martín Farach-Colton

Policies and ethics