Cover Image
Read Now

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

This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Bob Constable. The volume's title is a translation of the title of Kurt Mehlhorn'...

Full description

Bibliographic Details
Other Authors: Albers, Susanne (Editor), Alt, Helmut (Editor), Näher, Stefan (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2009, 2009
Edition:1st ed. 2009
Series:Theoretical Computer Science and General Issues
Subjects:
Programming Techniques
Mathematics Of Computing
Computer Science / Mathematics
Numerical Analysis
Computer Programming
Algorithms
Mathematical Applications In Computer Science
Discrete Mathematics
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
Table of Contents:
  • Models of Computation and Complexity
  • Building Mathematics-Based Software Systems to Advance Science and Create Knowledge
  • On Negations in Boolean Networks
  • The Lovász Local Lemma and Satisfiability
  • Kolmogorov-Complexity Based on Infinite Computations
  • Pervasive Theory of Memory
  • Introducing Quasirandomness to Computer Science
  • Sorting and Searching
  • Reflections on Optimal and Nearly Optimal Binary Search Trees
  • Some Results for Elementary Operations
  • Maintaining Ideally Distributed Random Search Trees without Extra Space
  • A Pictorial Description of Cole’s Parallel Merge Sort
  • Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction
  • Combinatorial Optimization with Applications
  • Algorithms for Energy Saving
  • Minimizing Average Flow-Time
  • Integer Linear Programming in Computational Biology
  • Via Detours to I/O-Efficient Shortest Paths
  • Computational Geometry and Geometric Graphs
  • The Computational Geometry of Comparing Shapes
  • Finding Nearest Larger Neighbors
  • Multi-core Implementations of Geometric Algorithms
  • The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
  • On Map Labeling with Leaders
  • The Crossing Number of Graphs: Theory and Computation
  • Algorithm Engineering, Exactness, and Robustness
  • Algorithm Engineering – An Attempt at a Definition
  • Of What Use Is Floating-Point Arithmetic in Computational Geometry?
  • Car or Public Transport—Two Worlds
  • Is the World Linear?
  • In Praise of Numerical Computation
  • Much Ado about Zero
  • Polynomial Precise Interval Analysis Revisited

Similar Items