Efficient Algorithms

Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday

Editors:

ISBN: 978-3-642-03455-8 (Print) 978-3-642-03456-5 (Online)

Table of contents (28 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Models of Computation and Complexity

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 3-17

      Building Mathematics-Based Software Systems to Advance Science and Create Knowledge

    3. No Access

      Book Chapter

      Pages 18-29

      On Negations in Boolean Networks

    4. No Access

      Book Chapter

      Pages 30-54

      The Lovász Local Lemma and Satisfiability

    5. No Access

      Book Chapter

      Pages 55-73

      Kolmogorov-Complexity Based on Infinite Computations

    6. No Access

      Book Chapter

      Pages 74-98

      Pervasive Theory of Memory

    7. No Access

      Book Chapter

      Pages 99-111

      Introducing Quasirandomness to Computer Science

  3. Sorting and Searching

    1. Front Matter

      Pages 113-113

    2. No Access

      Book Chapter

      Pages 115-120

      Reflections on Optimal and Nearly Optimal Binary Search Trees

    3. No Access

      Book Chapter

      Pages 121-133

      Some Results for Elementary Operations

    4. No Access

      Book Chapter

      Pages 134-142

      Maintaining Ideally Distributed Random Search Trees without Extra Space

    5. No Access

      Book Chapter

      Pages 143-157

      A Pictorial Description of Cole’s Parallel Merge Sort

    6. No Access

      Book Chapter

      Pages 158-169

      Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction

  4. Combinatorial Optimization with Applications

    1. Front Matter

      Pages 171-171

    2. No Access

      Book Chapter

      Pages 173-186

      Algorithms for Energy Saving

    3. No Access

      Book Chapter

      Pages 187-198

      Minimizing Average Flow-Time

    4. No Access

      Book Chapter

      Pages 199-218

      Integer Linear Programming in Computational Biology

    5. No Access

      Book Chapter

      Pages 219-232

      Via Detours to I/O-Efficient Shortest Paths

  5. Computational Geometry and Geometric Graphs

    1. Front Matter

      Pages 233-233

    2. No Access

      Book Chapter

      Pages 235-248

      The Computational Geometry of Comparing Shapes

    3. No Access

      Book Chapter

      Pages 249-260

      Finding Nearest Larger Neighbors

    4. No Access

      Book Chapter

      Pages 261-274

      Multi-core Implementations of Geometric Algorithms

    5. No Access

      Book Chapter

      Pages 275-289

      The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension

    6. No Access

      Book Chapter

      Pages 290-304

      On Map Labeling with Leaders

previous Page of 2