Efficient Algorithms Essays Dedicated (6 results)
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 50.80
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 47.94
£ 15.49 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
PF. Condition: New.
Efficient Algorithms: Essays Dedicated To Kurt Mehlhorn On The Occasion Of His 60Th Birthday
Ed. By Albers, Susanne, Alt, Helmut, Näher, Stefan; Albers, Susanne; Alt, Helmut; Näher, Stefan
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 67.33
£ 12.50 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. 1st edition. 439 pages. 9.20x6.00x0.70 inches. In Stock.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 44.39
£ 59.86 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: 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]hartma…nn[at]springer[dot]com | Anbieter: preigu.
- Softcover
Seller: Buchpark, Trebbin, GermanyBuchpark
Contact seller5-star sellerCondition: Used - Fine
£ 36.00
£ 89.80 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: 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.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 52.83
£ 54.25 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt 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.
