Research
 David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva. Sampling Random Spanning Trees Faster than Matrix Multiplication. (STOC 2017)
 Michael B. Cohen, Jonathan Kelner, John Peebles, Richard Peng, Anup B Rao, Aaron Sidford, Adrian Vladu. AlmostLinearTime Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs. (STOC 2017)
 Kevin Lai, Anup B. Rao, Santosh Vempala. Agnostic Estimation of Mean and Covariance. (FOCS 2016)
 Rasmus Kyng, Anup B. Rao, Sushant Sachdeva. Fast, Provable Algorithms for Isotonic Regression in all l_pnorms. (NIPS 2015)
 Rasmus Kyng, Anup B. Rao, Sushant Sachdeva, Daniel A. Spielman. Algorithms for Lipschitz Learning on Graphs. (COLT 2015)
 Peter Chin, Anup B. Rao and Van Vu. Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery. (COLT 2015).
 Michael B. Cohen,
Rasmus Kyng,
Gary L. Miller,
Jakub W. Pachocki,
Richard Peng,
Anup B. Rao
and Shen Chen Xu.
Solving SDD Linear Systems in Nearly mlog^{1/2}n Time.
In STOC 2014.
This paper is a merger of the following two results.
Recent and Upcoming Talks/Travels Simons Institute of ToC, Berkeley, MarchMay 2017
 UCSD, Feb 2017
 Simons Institute of ToC, Berkeley, Jan 2017
 Agnostic Estimation of Mean and Covariance, CMU, Jan 2017
 Graph Sparsification with Applications, Yale, Nov 2016
 Agnostic Estimation of Mean and Covariance,
 FOCS, October 2016
 University of Chicago, April 2016
 Yale, April 2016
 Community Detection in Sparse Random Graphs
 Allerton Conference, October 2015
 SIAM, October 2015
 ARC Colloquium
 Isotonic Regression
 Machine Learning Seminar (Georgia Tech), January 2016
 Algorithms for Lipschitz Learning
 ARC Colloquium, April 2015
Code

