Martin Dietzfelbinger

Univ.-Prof. Dr.(USA) Martin Dietzfelbinger (b. 1956) studied Mathematics in Munich and earned his Ph.D. from the University of Illinois at Chicago. In 1992, he obtained his Habilitation at the UniversitAt Paderborn with a thesis on randomized algorithms; in the same year he became a professor of computer science at the UniversitAt Dortmund. Since 1998, he holds the chair for Complexity Theory and Efficient Algorithms at the Faculty of Computer Science and Automation of the Technische...See more

Univ.-Prof. Dr.(USA) Martin Dietzfelbinger (b. 1956) studied Mathematics in Munich and earned his Ph.D. from the University of Illinois at Chicago. In 1992, he obtained his Habilitation at the UniversitAt Paderborn with a thesis on randomized algorithms; in the same year he became a professor of computer science at the UniversitAt Dortmund. Since 1998, he holds the chair for Complexity Theory and Efficient Algorithms at the Faculty of Computer Science and Automation of the Technische UniversitAt Ilmenau, Germany. His main research interests are in complexity theory and data structures. See less