Book Volume 1518 1998

Randomization and Approximation Techniques in Computer Science

Second International Workshop, RANDOM’98 Barcelona, Spain, October 8–10, 1998 Proceedings


ISBN: 978-3-540-65142-0 (Print) 978-3-540-49543-7 (Online)

Table of contents (29 chapters)

previous Page of 2
  1. Front Matter

    Pages I-IX

  2. Invited Paper

    1. Chapter

      Pages 1-14

      Disjoint Paths in Expander Graphs via Random Walks: a Short Survey

  3. Regular Papers

    1. Chapter

      Pages 15-24

      A Derandomization Using Min-Wise Independent Permutations

    2. Chapter

      Pages 25-34

      An Algorithmic Embedding of Graphs via Perfect Matchings

    3. Chapter

      Pages 35-46

      Deterministic Hypergraph Coloring and Its Applications

    4. Chapter

      Pages 47-59

      On the Derandomization of Space-Bounded Computations

    5. Chapter

      Pages 60-70

      Talagrand’s Inequality and Locality in Distributed Computing

    6. Chapter

      Pages 71-81

      On-line Bin-Stretching

    7. Chapter

      Pages 82-96

      Combinatorial Linear Programming: Geometry Can Help

    8. Chapter

      Pages 97-115

      A Note on Bounding the Mixing Time by Linear Programming

    9. Chapter

      Pages 116-130

      Robotic Exploration, Brownian Motion and Electrical Resistance

    10. Chapter

      Pages 131-144

      Fringe analysis of synchronized parallel algorithms on 2–3 trees

    11. Chapter

      Pages 145-158

      On Balls and Bins with Deletions

    12. Chapter

      Pages 159-170

      “Balls into Bins” — A Simple and Tight Analysis

  4. Invited Paper

    1. Chapter

      Pages 171-171

      Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs

  5. Regular Papers

    1. Chapter

      Pages 172-186

      Using Approximation Hardness to Achieve Dependable Computation

    2. Chapter

      Pages 187-199

      Complexity of Sequential Pattern Matching Algorithms

    3. Chapter

      Pages 200-217

      A Random Server Model for Private Information Retrieval

    4. Chapter

      Pages 218-231

      Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract)

    5. Chapter

      Pages 232-247

      Randomized Lower Bounds for Online Path Coloring

    6. Chapter

      Pages 248-259

      Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem

previous Page of 2