| Explicit near-Ramanujan graphs of every degree S Mohanty, R O'Donnell, P Paredes Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 41 | 2020 |
| Lifting sum-of-squares lower bounds: degree-2 to degree-4 S Mohanty, P Raghavendra, J Xu Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 41 | 2020 |
| List decodable mean estimation in nearly linear time Y Cherapanamjeri, S Mohanty, M Yau 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 33 | 2020 |
| Local statistics, semidefinite programming, and community detection J Banks, S Mohanty, P Raghavendra Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 32 | 2021 |
| Testing thresholds for high-dimensional sparse random geometric graphs S Liu, S Mohanty, T Schramm, E Yang Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 22 | 2022 |
| Pseudo-deterministic streaming S Goldwasser, O Grossman, S Mohanty, DP Woodruff arXiv preprint arXiv:1911.11368, 2019 | 20 | 2019 |
| High-dimensional expanders from expanders S Liu, S Mohanty, E Yang arXiv preprint arXiv:1907.10771, 2019 | 19 | 2019 |
| The SDP value for random two-eigenvalue CSPs S Mohanty, R O'Donnell, P Paredes arXiv preprint arXiv:1906.06732, 2019 | 15 | 2019 |
| A simple and sharper proof of the hypergraph Moore bound JT Hsieh, PK Kothari, S Mohanty Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 9 | 2023 |
| On Sketching the to norms A Krishnan, S Mohanty, DP Woodruff arXiv preprint arXiv:1806.06429, 2018 | 9 | 2018 |
| Local and global expansion in random geometric graphs S Liu, S Mohanty, T Schramm, E Yang Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 817-825, 2023 | 7 | 2023 |
| High-girth near-Ramanujan graphs with lossy vertex expansion T McKenzie, S Mohanty arXiv preprint arXiv:2007.13630, 2020 | 6 | 2020 |
| -Ramanujan Graphs S Mohanty, R O'Donnell arXiv preprint arXiv:1904.03500, 2019 | 6 | 2019 |
| Algorithms for noisy broadcast with erasures O Grossman, B Haeupler, S Mohanty International Colloquium on Automata, Languages and Programming 107, 2018 | 6 | 2018 |
| Many nodal domains in random regular graphs S Ganguly, T McKenzie, S Mohanty, N Srivastava Communications in Mathematical Physics 401 (2), 1291-1309, 2023 | 4 | 2023 |
| Explicit two-sided unique-neighbor expanders JT Hsieh, T McKenzie, S Mohanty, P Paredes arXiv preprint arXiv:2302.01212, 2023 | 3 | 2023 |
| Certifying solution geometry in random csps: counts, clusters and balance JT Hsieh, S Mohanty, J Xu arXiv preprint arXiv:2106.12710, 2021 | 3 | 2021 |
| Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs JT Hsieh, PK Kothari, S Mohanty, DM Correia, B Sudakov arXiv preprint arXiv:2401.11590, 2024 | 1 | 2024 |
| On statistical inference when fixed points of belief propagation are unstable S Liu, S Mohanty IEEE Symposium on Foundations of computer science, 2021 | 1 | 2021 |
| Algorithms for noisy broadcast under erasures O Grossman, B Haeupler, S Mohanty arXiv preprint arXiv:1808.00838, 2018 | 1 | 2018 |
Prasad RaghavendraProfessor, University of California BerkeleyVerified email at cs.berkeley.edu
