Finding hitting times in various graphs - Shravas Rao (CoRR, 2012)

A Sharp Tail Bound for the Expander Random Sampler. - Shravas Rao; Oded Regev 001 (CoRR, 2017)

Applications of α-Strongly Regular Distributions to Bayesian Auctions. - Richard Cole 001; Shravas Rao (ACM Trans. Economics and Comput., 2017)

On Lipschitz Bijections Between Boolean Functions. - Shravas Rao; Igor Shinkar (Comb. Probab. Comput., 2018)

An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices. - Jaroslaw Blasiok; Patrick Lopatto; Kyle Luh; Jake Marcinek; Shravas Rao (FOCS, 2019)

Improved Lower Bounds for the Restricted Isometry Property of Subsampled Fourier Matrices. - Shravas Rao (CoRR, 2019)

The Littlewood-Offord Problem for Markov Chains. - Shravas Rao (CoRR, 2019)

Concentration and Anti-concentration for Markov Chains. - Shravas Rao (2019)

Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem. - Scott Aaronson; Shalev Ben-David; Robin Kothari; Shravas Rao; Avishay Tal (STOC, 2021)

The Fourier Transform of Restrictions of Functions on the Slice. - Shravas Rao (CoRR, 2021)

Optimal RIP Matrices with Slightly Less Randomness. - Shravas Rao (CoRR, 2023)

Expanderizing Higher Order Random Walks. - Vedat Levi Alev; Shravas Rao (APPROX/RANDOM, 2024)

Satisfying the restricted isometry property with the optimal number of rows and slightly less randomness. - Shravas Rao (Inf. Process. Lett., 2025)