search for books and compare prices
Martin Dietzfelbinger has written 3 work(s)
Search for other authors with the same name
displaying 1 to 3 | at end
show results in order: alphabetically | oldest to newest | newest to oldest
Cover for 9783642054716 Cover for 9783642153273 Cover for 9783540403449
Algorithmen Und Datenstrukturen: Die Grundwerkzeuge
cover image for 9783642054716
Product Description: Algorithmen bilden das Herzstück jeder nichttrivialen Anwendung von Computern, und die Algorithmik ist ein modernes und aktives Gebiet der Informatik. Daher sollte sich jede Informatikerin und jeder Informatiker mit den algorithmischen Grundwerkzeugen auskennen...read more
By Martin Dietzfelbinger, Kurt Mehlhorn and Peter Sanders
See complete details on each edition (1 edition listed)

Paperback:

9783642054716 | Springer Verlag, June 18, 2014, cover price $39.99 | About this edition: Algorithmen bilden das Herzstück jeder nichttrivialen Anwendung von Computern, und die Algorithmik ist ein modernes und aktives Gebiet der Informatik.

Algorithms Unplugged
cover image for 9783642153273
By Helmut Alt (editor), Martin Dietzfelbinger (editor), Rudiger Reischuk (editor), Christian Scheideler (editor) and Berthold Vocking (editor)
See complete details on each edition (1 edition listed)

Hardcover:

9783642153273 | Springer Verlag, November 29, 2010, cover price $59.95

Primality Testing in Polynomial Time: From Randomized Algorithms to "Primes Is in P"
cover image for 9783540403449
Product Description: A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem. The text covers the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s as well as the recent deterministic algorithm of Agrawal, Kayal and Saxena...read more
By Martin Dietzfelbinger
See complete details on each edition (1 edition listed)

Paperback:

9783540403449 | Springer Verlag, August 30, 2004, cover price $54.95 | About this edition: A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem.

displaying 1 to 3 | at end