معرفی
Shayan Oveis Gharan is a Professor in the University of Washington's Computer Science and Engineering department. His work bridges algorithm design, applied probability, and spectral graph theory, with a focus on leveraging Markov Chains and polynomial paradigms in approximation algorithms.
- Education: PhD in Computer Science from Stanford University (2013)
Research interests span theoretical computer science, combinatorics, and optimization. He explores how algebraic techniques, particularly log-concave and hyperbolic polynomials, can enhance spectral graph theory and counting/sampling algorithms. His studies on the Traveling Salesman Problem and matroid theory have redefined approximation bounds.
Recent publications highlight advancements in trickle-down theorems, polynomial paradigms for graph sparsification, and high-dimensional random walks. These works intersect with fields like machine learning and computational complexity.
Scientific awards include the 2025 Michael and Sheila Held Prize, 2022 Simons Investigator Award, and 2016 NSF Career Award. His students, such as Nathan Klein and Kuikui Liu, have transitioned to academic and industry roles.
