Mark Bun

Mark Bun is an Assistant Professor in the Department of Computer Science at the College of Arts and Sciences. His research focuses on data privacy, computational complexity, and adjacent areas of theoretical computer science. He uses analytic methods to prove lower bounds in both quantum and classical query complexity, circuit complexity, communication complexity, and computational learning theory. He also develops new algorithms and lower bound techniques for differentially private data analysis.