03148nmm a2200385 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100003000139245017500169250001700344260006300361300003100424505100200455653002501457653002101482653004201503653002901545653002201574653002201596653002701618653003101645653004601676700002601722700002901748710003401777041001901811989003601830490005201866856007201918082001101990520076102001EB000382837EBX0100000000000000023588900000000000000.0cr|||||||||||||||||||||130626 ||| eng a97836420345651 aAlbers, Susannee[editor]00aEfficient AlgorithmshElektronische RessourcebEssays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthdaycedited by Susanne Albers, Helmut Alt, Stefan Näher a1st ed. 2009 aBerlin, HeidelbergbSpringer Berlin Heidelbergc2009, 2009 aIX, 439 pbonline resource0 aModels 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 -- Findi aDiscrete Mathematics aComputer science aMath Applications in Computer Science aMathematics of Computing aComputer software aNumeric Computing aProgramming Techniques aElectronic data processing aAlgorithm Analysis and Problem Complexity1 aAlt, Helmute[editor]1 aNäher, Stefane[editor]2 aSpringerLink (Online service)07aeng2ISO 639-2 bSpringeraSpringer eBooks 2005-0 aTheoretical Computer Science and General Issues uhttps://doi.org/10.1007/978-3-642-03456-5?nosfx=yxVerlag3Volltext0 a005.11 aThis 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's first book, "Effiziente Algorithmen", published by Teubner-Verlag in 1977. This Festschrift demonstrates how the field of algorithmics has developed and matured in the decades since then. The papers included in this volume are organized in topical sections on models of computation and complexity; sorting and searching; combinatorial optimization with applications; computational geometry and geometric graphs; and algorithm engineering, exactness and robustness