Dieter van Melkebeek
Theory of Computing, Computational Complexity.
Dieter van Melkebeek is a Professor of Computer Sciences.
He completed his Ph.D. in 1999 at the University of Chicago, and
was a postdoc at DIMACS and the Institute for Advanced Study (Princeton)
before joining the faculty at the University of Wisconsin-Madison.
He has held visiting appointments at
the Fields Institute (Toronto),
the University of Paris-Sud (Orsay),
Humboldt University (Berlin), and
the Weizmann Institute of Science (Rehovot).
Professor Van Melkebeek's research interests lie in
computational complexity theory and
the theory of computing.
He has developed lower bounds for the resources needed to solve
NP-complete problems, and
studied the power of randomness in computation.
He earned the 1999 ACM Doctoral Dissertation Award and an NSF CAREER award
for his research.
Professor Van Melkebeek teaches
algorithms and computational complexity theory
at the undergraduate and graduate level.
He is also the longtime coach for the UW-Madison teams participating in
ACM's International Collegiate Programming Contest.
Professor Van Melkebeek
chairs the steering committee of the Conference on Computational Complexity,
and serves on the editorials boards of
SIAM Journal on Computing,
ACM Transactions on Computation Theory, and
the Electronic Colloquium on Computational Complexity.