Sidhanth Mohanty

According to our database, Sidhanth Mohanty authored at least 23 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Robust recovery for stochastic block models, simplified and generalized.

Sidhanth Mohanty, Prasad Raghavendra, David X. Wu

CoRR, 2024

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs.

Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty, David Munhá Correia, Benny Sudakov

CoRR, 2024

2023

Explicit two-sided unique-neighbor expanders.

Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, Pedro Paredes

CoRR, 2023

Local and Global Expansion in Random Geometric Graphs.

Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

A simple and sharper proof of the hypergraph Moore bound.

Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Explicit Near-Ramanujan Graphs of Every Degree.

Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes

SIAM J. Comput., June, 2022

Testing thresholds for high-dimensional sparse random geometric graphs.

Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Certifying Solution Geometry in Random CSPs: Counts, Clusters and Balance.

Jun-Ting Hsieh, Sidhanth Mohanty, Jeff Xu

Proceedings of the 37th Computational Complexity Conference, 2022

2021

Many nodal domains in random regular graphs.

Shirshendu Ganguly, Theo McKenzie, Sidhanth Mohanty, Nikhil Srivastava

CoRR, 2021

Computational phase transitions in sparse planted problems?

Siqi Liu, Sidhanth Mohanty, Prasad Raghavendra

CoRR, 2021

Local Statistics, Semidefinite Programming, and Community Detection.

Jess Banks, Sidhanth Mohanty, Prasad Raghavendra

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion.

Theo McKenzie, Sidhanth Mohanty

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

On statistical inference when fixed points of belief propagation are unstable.

Siqi Liu, Sidhanth Mohanty, Prasad Raghavendra

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Lifting sum-of-squares lower bounds: degree-2 to degree-4.

Sidhanth Mohanty, Prasad Raghavendra, Jeff Xu

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

The SDP Value for Random Two-Eigenvalue CSPs.

Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

<i>X</i>-Ramanujan graphs.

Sidhanth Mohanty, Ryan O'Donnell

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

High-Dimensional Expanders from Expanders.

Siqi Liu, Sidhanth Mohanty, Elizabeth Yang

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

List Decodable Mean Estimation in Nearly Linear Time.

Yeshwanth Cherapanamjeri, Sidhanth Mohanty, Morris Yau

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Pseudo-deterministic Streaming.

Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff

Electron. Colloquium Comput. Complex., 2019

X-Ramanujan Graphs.

Sidhanth Mohanty, Ryan O'Donnell

CoRR, 2019

2018

Algorithms for Noisy Broadcast under Erasures.

Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty

CoRR, 2018

Algorithms for Noisy Broadcast with Erasures.

Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

On Sketching the q to p Norms.

Aditya Krishnan, Sidhanth Mohanty, David P. Woodruff

Proceedings of the Approximation, 2018