Heribert Vollmer

Professor, University of Hannover

Heribert Vollmer, born in 1964, studied computer science with a focus on computational linguistics at the Rhineland-Palatinate University of Education in Koblenz from 1984 to 1989. From 1989 to 1994 he was a research assistant, first at the University of Frankfurt, then University of Würzburg. In 1994 he received his doctorate on the subject of "Complexity Classes of Functions".

The Alexander von Humboldt Foundation awarded him a Feodor Lynen Scholarship for a stay abroad at the University of California at Santa Barbara. There he was from 1994 to 1995 Visiting Professor. From 1995 to 2002 he was a research assistant at the University of Würzburg. In 2000, he habilitated there with a monograph on "Some Aspects of the Computational Power of Boolean Circuits of Small Depth" and obtained a teaching qualification in computer science. Until 2002 he was a lecturer at the University of Würzburg.

In March 2002, he accepted a position at the Leibniz Universität Hannover, where he has since served as Professor of Theoretical Computer Science and Managing Director of the Institute for Theoretical Computer Science. Prof. Vollmer has published over 120 publications on topics of theoretical computer science in scientific journals and conference proceedings. He is the author of a textbook "Introduction to Circuit Complexity" and author and co-editor of five other books. He also published on the history of logic and philosophical questions from the field of mind and intelligence in man and machine. Prof. Vollmer is the spokesman of the Department of "Foundations of Computer Science" of the Gesellschaft für Informatik. Since 2015 he is dean of studies for computer science at the Leibniz University.

Program Visits

Logic and Algorithms in Database Theory and AI, Fall 2023, Visiting Scientist
computational complexity theory, circuit complexity, enumeration problems, descriptive complexity