LATIN 2008: Theoretical Informatics

8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008. Proceedings

ISBN: 978-3-540-78772-3 (Print) 978-3-540-78773-0 (Online)

Table of contents (67 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-11

    Profile of Tries

  3. No Access

    Book Chapter

    Pages 12-23

    Random 2-XORSAT at the Satisfiability Threshold

  4. No Access

    Book Chapter

    Pages 24-35

    On Dissemination Thresholds in Regular and Irregular Graph Classes

  5. No Access

    Book Chapter

    Pages 36-47

    How to Complete a Doubling Metric

  6. No Access

    Book Chapter

    Pages 48-59

    Sorting and Selection with Random Costs

  7. No Access

    Book Chapter

    Pages 60-71

    Guided Search and a Faster Deterministic Algorithm for 3-SAT

  8. No Access

    Book Chapter

    Pages 72-83

    Comparing and Aggregating Partially Resolved Trees

  9. No Access

    Book Chapter

    Pages 84-93

    Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices

  10. No Access

    Book Chapter

    Pages 94-105

    On Stateless Multihead Automata: Hierarchies and the Emptiness Problem

  11. No Access

    Book Chapter

    Pages 106-120

    Myhill-Nerode Theorem for Recognizable Tree Series Revisited

  12. No Access

    Book Chapter

    Pages 121-132

    The View Selection Problem for Regular Path Queries

  13. No Access

    Book Chapter

    Pages 133-145

    Optimal Higher Order Delaunay Triangulations of Polygons

  14. No Access

    Book Chapter

    Pages 146-157

    Coloring Geometric Range Spaces

  15. No Access

    Book Chapter

    Pages 158-169

    Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes

  16. No Access

    Book Chapter

    Pages 170-181

    Spanners of Complete k -Partite Geometric Graphs

  17. No Access

    Book Chapter

    Pages 182-193

    Minimum Cost Homomorphisms to Reflexive Digraphs

  18. No Access

    Book Chapter

    Pages 194-205

    On the Complexity of Reconstructing H -free Graphs from Their Star Systems

  19. No Access

    Book Chapter

    Pages 206-215

    Optimization and Recognition for K 5 -minor Free Graphs in Linear Time

  20. No Access

    Book Chapter

    Pages 216-227

    Bandwidth of Bipartite Permutation Graphs in Polynomial Time

  21. No Access

    Book Chapter

    Pages 228-239

    The Online Transportation Problem: On the Exponential Boost of One Extra Server

previous Page of 4