About the Authors

Jack Murtagh

School of Engineering & Applied Sciences

Harvard University

Cambridge, MA USA

murtagh.jack[ta]g[td]harvard[td]edu

https://scholar.harvard.edu/jmurtagh/home

School of Engineering & Applied Sciences

Harvard University

Cambridge, MA USA

murtagh.jack[ta]g[td]harvard[td]edu

https://scholar.harvard.edu/jmurtagh/home

**Jack Murtagh**got his Ph.D. in May 2020 from Harvard University where he was advised by Salil Vadhan. As an undergraduate, he studied math at Tufts University. Jack wrote his dissertation on spectral graph-theoretic methods for derandomizing space-bounded computation.

Omer Reingold

Professor

Computer Science Department

Stanford University

Stanford, CA USA

reingold[ta]stanford[td]edu

https://engineering.stanford.edu/people/omer-reingold

Professor

Computer Science Department

Stanford University

Stanford, CA USA

reingold[ta]stanford[td]edu

https://engineering.stanford.edu/people/omer-reingold

**Omer Reingold**is the Rajeev Motwani Professor in Computer Science at Stanford University. His research is in the foundations of computer science and most notably in computational complexity, cryptography, and the societal impact of computation. Omer completed his Ph.D. at the Weizmann Institute under the supervision of Moni Naor.

Aaron Sidford

Assistant professor

Management Science & Engineering

and Computer Science

Stanford University

Stanford, CA USA

sidford[ta]stanford[td]edu

www.aaronsidford.com

Assistant professor

Management Science & Engineering

and Computer Science

Stanford University

Stanford, CA USA

sidford[ta]stanford[td]edu

www.aaronsidford.com

**Aaron Sidford**is an assistant professor in Management Science and Engineering and in Computer Science at Stanford University. He received his Ph.D. from the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology where he was advised by Jonathan Kelner. Aaron's research interests lie broadly in optimization, the theory of computation, and the design and analysis of algorithms. He is particularly interested in work at the intersection of continuous optimization, graph theory, numerical linear algebra, and data structures.

Salil Vadhan

Professor

School of Engineering & Applied Sciences

Harvard University

Cambridge, MA USA

salil_vadhan[ta]harvard[td]edu

salil.seas.harvard.edu

Professor

School of Engineering & Applied Sciences

Harvard University

Cambridge, MA USA

salil_vadhan[ta]harvard[td]edu

salil.seas.harvard.edu

**Salil Vadhan**is the Vicky Joseph Professor of Computer Science and Applied Mathematics at the Harvard John A. Paulson School of Engineering & Applied Sciences. He received his Ph.D. under the supervision of Shafi Goldwasser at MIT in 1999; the title of his dissertation was “A Study of Statistical Zero-Knowledge Proofs.” Other research interests include the theory of pseudorandomness the theory and practice of data privacy. He enjoys spending leisure time with his wife and two daughters, as well as learning to surf in the cold waters of New England.