Dieter van Melkebeek Professor

Research Students

Doctoral:

• Ivan Hu, post-qual

• Nicollas Mocelin Sdroievski, PhD 2024
  > Assistant Professor at the State University of Paraná (Brazil)
  Dissertation: Derandomization vs. Lower Bounds for Arthur-Merlin Protocols

• Andrew Morgan, PhD 2022
  > Google
  Dissertation: Lower Bounds Related to Polynomial Identity Testing, Circuit Minimization, and Inversion Minimization

• Gautam Prakriya, PhD 2019
  > Postdoc at the Chinese University of Hong Kong
  Dissertation: Derandomizing Isolation and Polynomial Identity Testing

• Matthew Anderson, PhD 2012
  > Postdoc at Cambridge University > Assistant/Associate Professor at Union College
  Dissertation: Advancing Algebraic and Logical Approaches to Circuit Lower Bounds

• Jeffrey Kinne, PhD 2010
  > Assistant/Associate/Full Professor at Indiana State University
  Dissertation: Deterministic Simulations and Hierarchy Theorems for Randomized Algorithms

• Scott Diehl, PhD 2008
  > Assistant Professor at Siena College > Google Lab, Madison
  Dissertation: Time-Space Lower Bounds for Satisfiability and Related Problems on Randomized Machines

Postdoctoral:

• Holger Dell (2011-2013)
  > Assistant Professor at Saarland University > Associate Professor at IT University of Copenhagen > Professor at Goethe University Frankfurt

• Sylvain Perifel (2008)
  > Assistant/Associate Professor at the University of Paris

Undergraduate:

• Ivan Hu, BS 2022
  > PhD student at UW-Madison
  Thesis: A Bound on the Maximum Coefficient of Gaussian Polynomials

• Zelin (Bobby) Lv, BS 2020
  > PhD student at the University of Chicago
  Thesis: The Complexity of Directed Graph Connectivity

• Sachin Ravi, BS 2012
  > PhD student at Princeton University
  Thesis: A Survey of Satisfiability Algorithms

• Thomas Watson, BS 2008
  > PhD student at the University of California at Berkeley
  Paper: Time-Space Efficient Simulations of Quantum Computations

• Jurgen Van Gael, BS 2005
  > PhD student at Cambridge University
  Thesis: The Role of Interference and Entanglement in Quantum Computing

• Ryan Williams, REU 2000
  > PhD student at Carnegie Mellon University
  Paper: Space-Efficient Reversible Simulations