AutumnTHE OLYMPIAD COLLECTION
Menu
RESEARCHED WITH AUTUMN
NA

Nima Anari

I try to push theoretical limits of algorithms.
Stanford University · Stanford, CA, United States · academic
Associate Professor Of Computer Science At Stanford University (theory Group)IMO 2005 Silver And 2006 Gold Medalist For Iran; IOI 2006 Silver MedalistPh.D. UC Berkeley (2015, Advisor Satish Rao); B.Sc. Sharif University Of Technology (2010)Michael And Sheila Held Prize (2025), Sloan Research Fellowship (2021), NSF CAREER Award (2021), STOC 2019 Best Paper

Nima Anari is a theoretical computer scientist and Associate Professor of Computer Science at Stanford University, where he has taught since 2019. He earned his Ph.D. in Computer Science from UC Berkeley (2015) under Satish Rao, and holds B.Sc. degrees in Computer Engineering and Pure Mathematics from Sharif University of Technology (2010). His research centres on the design and analysis of fast sampling algorithms, Markov chains, parallel algorithms, and the geometry of polynomials. He won a STOC 2019 Best Paper Award, a Google Faculty Research Award, an NSF CAREER Award, a Sloan Research Fellowship, a Frontiers of Science Award, and the Michael and Sheila Held Prize. As a student in Iran he won silver (2005) and gold (2006) medals at the International Mathematical Olympiad and was a medalist at the International Olympiad in Informatics.

Nima Anari is a theoretical computer scientist and Associate Professor of Computer Science at Stanford University. His research designs and analyzes fast sampling and counting algorithms, Markov chains, parallel algorithms, high-dimensional expanders, and the geometry of polynomials. He completed an IMO silver (2005) and gold (2006) and graduated from Sharif University of Technology before earning a PhD at UC Berkeley under Satish Rao.

Details
LocationStanford, CA, United States
Company sitestanford.edu
UniversityUniversity of California, Berkeley
AlgorithmsProbabilityCombinatoricsSampling algorithmsMarkov chainsParallel algorithmsHigh-dimensional expandersGeometry of polynomialsTheoretical computer scienceSamplingCounting
Notes
  • Quant employment verification: UNRESOLVED. Caller-provided leads ('taiga-405839004') list a Jane Street Research Intern internship (6/2013-8/2013) and The D. E. Shaw Group Quantitative Research Analyst Intern (7/2011-8/2011); these are index/aggregator-only and are NOT independently confirmed by any primary source. His own CV (nimaanari.com) lists ONLY academic positions (Berkeley PhD 2010-2015, then Stanford/Simons Institute roles from 2016) and no industry or finance role; the two claimed internships fall inside his Berkeley PhD years and are absent from the CV. Employer classification: Jane Street and D. E. Shaw are both genuine quantitative trading / quantitative hedge-fund firms, so the employers would qualify if the roles were confirmed, but no primary source establishes that the roles exist. Status: UNRESOLVED - identity itself is well supported (same person as Stanford CS professor Nima Anari; IMO/IOI record matches) but the employment claims rest on an unverified index and conflict with the absence of any such role on his CV.Sep 17, 2026
  • No industry/finance or non-academic role appears anywhere on his CV or bio; the entire post-PhD record is academic (postdoc, research engineer, professor).Jan 2026
  • Career at Stanford: postdoctoral scholar in Management Science and Engineering (1/2016-8/2017), Research Engineer in CS (1/2018-8/2019), Assistant Professor of Computer Science from 9/2019, now Associate Professor.Sep 2019
  • Education: Ph.D. Computer Science, UC Berkeley (2015), advisor Satish Rao; B.Sc. Computer Engineering and B.Sc. Pure Mathematics, Sharif University of Technology (2010).Dec 2015
  • Recognition: Michael and Sheila Held Prize (2025), Frontiers of Science Award (2023), Sloan Research Fellowship (2021), NSF CAREER Award (2021), STOC 2019 Best Paper, Google Faculty Research Award (2019).Jan 2025
  • IMO record: silver medal 2005 (Iran team) and gold medal 2006; also silver at IOI 2006.Jul 2005
  • Research focus: design and analysis of fast sampling algorithms, Markov chains, parallel algorithms, high-dimensional expanders, geometry of polynomials.Jan 2024
  • Own CV lists contact email [contact omitted] and office at 389 Jane Stanford Way #W248, Stanford CA 94305.Jan 2026
  • Competitive programming: ICPC World Finals 14th (2009) and 13th (2008); First Prize IMC 2007 and 2008.Apr 2009

Competition record

Islamic Republic of Iran · IMO

Related collections

Explore the collection