LEADER 04193nam 2200613Ia 450 001 9910484157203321 005 20200520144314.0 010 $a3-642-03456-X 024 7 $a10.1007/978-3-642-03456-5 035 $a(CKB)1000000000784719 035 $a(SSID)ssj0000317350 035 $a(PQKBManifestationID)11253069 035 $a(PQKBTitleCode)TC0000317350 035 $a(PQKBWorkID)10293022 035 $a(PQKB)11635157 035 $a(DE-He213)978-3-642-03456-5 035 $a(MiAaPQ)EBC3064512 035 $a(PPN)139954961 035 $a(EXLCZ)991000000000784719 100 $a20090904d2009 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aEfficient algorithms $eessays dedicated to Kurt Mehlhorn on the occasion of his 60th birthday /$fSusanne Albers, Helmut Alt, Stefan Naher (eds.) 205 $a1st ed. 2009. 210 $aBerlin ;$aNew York $cSpringer$dc2009 215 $a1 online resource (IX, 439 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v5760 225 1 $aFestschrift 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-03455-1 320 $aIncludes bibliographical references and index. 327 $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 -- 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. 330 $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. 410 0$aLecture notes in computer science ;$v5760. 410 0$aFestschrift. 606 $aAlgorithms 615 0$aAlgorithms. 676 $a005.1 686 $aDAT 003f$2stub 686 $aDAT 530f$2stub 686 $aSS 4800$2rvk 701 $aAlbers$b Susanne$01764056 701 $aAlt$b Helmut$0100060 701 $aNaher$b Stefan$0771638 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484157203321 996 $aEfficient algorithms$94204790 997 $aUNINA