Willkommen, schön sind Sie da!
Logo Ex Libris

Efficient Algorithms

  • E-Book (pdf)
  • 439 Seiten
(0) Erste Bewertung abgeben
Alle Bewertungen ansehen
This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers that demons... Weiterlesen
E-Books ganz einfach mit der kostenlosen Ex Libris-Reader-App lesen. Hiererhalten Sie Ihren Download-Link.
CHF 120.90
Download steht sofort bereit
Informationen zu E-Books
E-Books eignen sich auch für mobile Geräte (sehen Sie dazu die Anleitungen).
E-Books von Ex Libris sind mit Adobe DRM kopiergeschützt: Erfahren Sie mehr.
Weitere Informationen finden Sie hier.
Bestellung & Lieferung in eine Filiale möglich


This Festschrift volume, published in honor of Kurt Mehlhorn on the occasion of his 60th birthday, contains 28 papers that demonstrate how the field of algorithmics has developed and matured in the decades since Mehlhorn's first book on the subject in 1977.


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.


Titel: Efficient Algorithms
Untertitel: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday
EAN: 9783642034565
Digitaler Kopierschutz: Wasserzeichen
Format: E-Book (pdf)
Hersteller: Springer Berlin Heidelberg
Genre: IT & Internet
Anzahl Seiten: 439
Veröffentlichung: 01.09.2009
Dateigrösse: 7.2 MB

Weitere Bände aus der Buchreihe "Lecture Notes in Computer Science"