Aaron Sidford is an Assistant Professor in the departments of Management Science and Engineering and Computer Science at Stanford University. He received his PhD from the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology, where he was advised by Jonathan Kelner. His research interests lie broadly in optimization, the theory of computation, and the design and analysis of algorithms, with an emphasis on work at the intersection of continuous optimization, graph theory, numerical linear algebra, and data structures. He is the recipient of a Microsoft Research Faculty Fellowship, a Sloan Research Fellowship, a NSF CAREER Award, an ACM Doctoral Dissertation Award honorable mention, and best paper awards in FOCS and SODA for work in these areas.
- Data Structures and Optimization for Fast Algorithms, Fall 2023. Visiting Scientist, Program Organizer and Workshop Organizer.
- Learning and Games, Spring 2022. Visiting Scientist.
- Theory of Reinforcement Learning, Fall 2020. Visiting Scientist.
- Bridging Continuous and Discrete Optimization, Fall 2017. Visiting Scientist.
- Algorithmic Spectral Graph Theory, Fall 2014. Research Fellow.