efficient algorithms essays dedicated (7 Ergebnisse)

Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7863 9783642034558 Sprache: Englisch Gewicht in Gramm: 900.

Zustand: New.

PF. Zustand: New.

Paperback. Zustand: Brand New. 1st edition. 439 pages. 9.20x6.00x0.70 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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'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.

Taschenbuch. Zustand: Neu. Efficient Algorithms | Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday | Susanne Albers (u. a.) | Taschenbuch | ix | Englisch | 2009 | Springer | EAN 9783642034558 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 456 | Sprache: Englisch | Produktart: Bücher | "E?ziente Algorithmen" was the title of the ?rst book by Kurt Mehlhorn in 1977. It was meant as a text for graduate students and published in German by Teubner-Verlag. We decided to adopt this title 32 years later for this Festschrift in honor of Kurt on the occasion of his 60th birthday. It contains contributions by his former PhD students, many of whom are now university teachers themselves, and colleagues with whom he cooperated closely within his career. It is our pleasure that even Kurt¿s former PhD advisor, Bob Constable from Cornell University,kindlyagreedtocontribute.Manyofthecontributionswerepresented at a colloquium held in Kurt¿s honor on August 27 and 28, 2009 in Saarbrücken, Germany. This Festschriftshowsclearlyhowthe ?eld ofalgorithmicshas developedand matured in the decades since Kurt wrote his book with the same title. The classic approach based on discrete mathematics and computability and complexity theory continues to be the foundation of the ?eld with ever new and important challenges as the ?rst chapters of this Festschrift show. Kurt has contributed signi?cantly to classical algorithmics and gained worldwide repu- tion. Starting from research in computability theory in his PhD thesis he made major contributions to complexity theory, graph algorithms, data structures, and was one of the ?rst to recognize the signi?cance of computational geometry contributing one of the early textbooks on the subject.