000 04380nam a22005775i 4500
001 978-3-642-03456-5
003 DE-He213
005 20201213201608.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642034565
_9978-3-642-03456-5
024 7 _a10.1007/978-3-642-03456-5
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aAlbers, Susanne.
_eeditor.
245 1 0 _aEfficient Algorithms
_h[electronic resource] :
_bEssays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday /
_cedited by Susanne Albers, Helmut Alt, Stefan Näher.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2009.
300 _aIX, 439 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5760
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputer software.
650 0 _aLogic design.
650 0 _aElectronic data processing.
650 0 _aComputational complexity.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aMath Applications in Computer Science.
650 2 4 _aNumeric Computing.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aSoftware Engineering.
700 1 _aAlt, Helmut.
_eeditor.
700 1 _aNäher, Stefan.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642034558
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5760
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-03456-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
950 _aComputer Science (Springer-11645)
999 _c16227
_d16227