Martin Dietzfelbinger

Martin Dietzfelbinger (born June 30, 1956 in Marlesreuth ) is a German computer scientist.

Life

He obtained his diploma in mathematics with a minor in computer science from the University of Munich in 1983 , his doctorate in computer science in 1987 in the Department of Mathematics, Statistics and Computer Science at the University of Illinois at Chicago, and his habilitation in computer science in 1992 from the University of Paderborn with the universal habilitation thesis hashing in sequential, parallel, and distributed computing . From 1987 to 1992 he was a university assistant in the computer science department at the University of Dortmund and in the mathematics / computer science department at the University of Paderborn . In 1992 he became a university lecturer for computer science at the University of Paderborn. From 1992 to 1998 he taught as a university professor for computer science in the computer science department of the TU Dortmund . Since 1998 he has been university professor for computer science at the faculty for computer science and automation of the TU Ilmenau and head of the department "Complexity and Efficient Algorithms".

His research interests are complexity theory and efficient algorithms (in particular: randomized algorithms, data structures, hashing, algorithm engineering and the complexity of parallel and distributed calculations).

Works (selection)

• Primality testing in polynomial time. From randomized algorithms to "Primes is in P" (= Lecture notes in computer science. Volume 3000). Springer, Berlin / Heidelberg / New York / Hong Kong / London / Milan / Paris / Tokyo 2004, ISBN 3-540-40344-2 .
• with Kurt Mehlhorn and Peter Sanders : Algorithms and Data Structures. The basic tools (= eXamen.press ). Springer Vieweg, Berlin / Heidelberg 2014, ISBN 978-3-642-05471-6 .

Web links

• Univ.-Prof. Dr. Martin Dietzfelbinger