Department of Computer Science and the College
Andrew Drucker’s focus is on computational complexity theory—the study of the intrinsic resource requirements of computational tasks. His work has addressed several broad and related themes, including the power of interactive and quantum proof systems, the inherent limitations of popular paradigms for algorithm design, such as kernelization, and the study of synergies that arise when multiple computations are performed jointly. His research sheds light on the inherent barriers algorithmic practitioners face and helps guide the community toward attainable progress on real-world problems. Outside of complexity theory, he has worked on problems in prediction and polynomial approximation, and is interested in the use of algorithmic ideas to better understand the power of human memory.
His research has appeared in a number of scholarly journals, including SIAM Journal on Computing, Transactions on Computation Theory, and Computational Complexity.
Drucker joins the University following a postdoctoral fellowship at the School of Informatics at the University of Edinburgh. He also held a postdoctoral fellowship in the theory of computing at the Institute for Advanced Study. He completed his undergraduate studies in mathematics at Swarthmore College and earned his PhD in computer science at the Massachusetts Institute of Technology.