Dieter van Melkebeek is a Professor of Computer Sciences at the University of Wisconsin-Madison. He obtained his PhD from the University of Chicago, and was a postdoc at DIMACS and the Institute for Advanced Study, before joining the faculty at Wisconsin. His research interests lie in computational complexity theory, and include lower bounds for NP-complete problems and the power of randomness. He chairs the steering committee of the Conference on Computational Complexity, and serves on the editorials boards of SIAM Journal on Computing, Computational Complexity, and the Electronic Colloquium on Computational Complexity.
- Lower Bounds in Computational Complexity, Fall 2018. Visiting Scientist.