LATIN 2004: Theoretical Informatics

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

Editors:

ISBN: 978-3-540-21258-4 (Print) 978-3-540-24698-5 (Online)

Table of contents (63 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Speakers

    1. No Access

      Book Chapter

      Pages 1-1

      Analysis of Scheduling Algorithms for Proportionate Fairness

    2. No Access

      Book Chapter

      Pages 2-2

      Advances in the Regularity Method

    3. No Access

      Book Chapter

      Pages 3-4

      Fighting Spam: The Science

    4. No Access

      Book Chapter

      Pages 5-5

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

  3. Contributions

    1. No Access

      Book Chapter

      Pages 6-15

      Querying Priced Information in Databases: The Conjunctive Case

    2. No Access

      Book Chapter

      Pages 16-28

      Sublinear Methods for Detecting Periodic Trends in Data Streams

    3. No Access

      Book Chapter

      Pages 29-38

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

    4. No Access

      Book Chapter

      Pages 39-48

      Rotation and Lighting Invariant Template Matching

    5. No Access

      Book Chapter

      Pages 49-58

      Computation of the Bisection Width for Random d-Regular Graphs

    6. No Access

      Book Chapter

      Pages 59-68

      Constrained Integer Partitions

    7. No Access

      Book Chapter

      Pages 69-79

      Embracing the Giant Component

    8. No Access

      Book Chapter

      Pages 80-89

      Sampling Grid Colorings with Fewer Colors

    9. No Access

      Book Chapter

      Pages 90-99

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

    10. No Access

      Book Chapter

      Pages 100-108

      List Partitions of Chordal Graphs

    11. No Access

      Book Chapter

      Pages 109-118

      Bidimensional Parameters and Local Treewidth

    12. No Access

      Book Chapter

      Pages 119-128

      Vertex Disjoint Paths on Clique-Width Bounded Graphs

    13. No Access

      Book Chapter

      Pages 129-140

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

    14. No Access

      Book Chapter

      Pages 141-151

      Collective Tree Exploration

    15. No Access

      Book Chapter

      Pages 152-161

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

    16. No Access

      Book Chapter

      Pages 162-171

      Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time

previous Page of 4