Shalev Ben-David joined the David R. Cheriton School of Computer Science as an Assistant Professor in July 2018. Previously, he was a Hartree Postdoctoral Fellow at the University of Maryland, College Park. In 2017, Shalev received his PhD in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology, supervised by Scott Aaronson.
His research interests are in classical and quantum complexity theory.
Education
PhD, MIT (2017)
BMath, University of Waterloo (2011)
Selected publications
S. Ben-David and E. Blais. “A New Minimax Theorem for Randomized Algorithms.” In proceedings of The 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS) 2020.
S. Ben-David and E. Blais. “A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions.” In proceedings of The 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS) 2020.
S. Ben-David, A. Bouland, A. Garg and R. Kothari. “Classical Lower Bounds from Quantum Upper Bounds.” In proceedings of The 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 2018.
S. Aaronson, S. Ben-David and R. Kothari. “Separations in Query Complexity Using Cheat Sheets.” In proceedings of The 48th ACM Symposium on Theory of Computing (STOC) 2016.
