Dieter van Melkebeek Professor

Research Overview

Since grad school, my research has focused on computational complexity theory. My interests include:

• Pseudo-randomness and derandomization
• Interactive proof systems
• Quantum computing
• Time-Space Lower Bounds
• Kernelization Lower Bounds
• Meta complexity
• Hierarchies
• Structural properties of complexity classes

In the past, I also did some research on complex dynamical systems and on their applications to image compression.