Sidhanth Mohanty

Orcid: 0000-0001-8794-7616

According to our database1, Sidhanth Mohanty authored at least 26 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Robust Recovery for Stochastic Block Models, Simplified and Generalized.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Explicit Two-Sided Unique-Neighbor Expanders.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Fast Mixing in Sparse Random Ising Models.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Phase Transitions in Inference
PhD thesis, 2023

Local and Global Expansion in Random Geometric Graphs.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

A simple and sharper proof of the hypergraph Moore bound.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Explicit Near-Ramanujan Graphs of Every Degree.
SIAM J. Comput., June, 2022

Testing thresholds for high-dimensional sparse random geometric graphs.
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.
Proceedings of the 37th Computational Complexity Conference, 2022

2021
Many nodal domains in random regular graphs.
CoRR, 2021

Computational phase transitions in sparse planted problems?
CoRR, 2021

Local Statistics, Semidefinite Programming, and Community Detection.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

On statistical inference when fixed points of belief propagation are unstable.
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.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

The SDP Value for Random Two-Eigenvalue CSPs.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

<i>X</i>-Ramanujan graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

High-Dimensional Expanders from Expanders.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

List Decodable Mean Estimation in Nearly Linear Time.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Pseudo-deterministic Streaming.
Electron. Colloquium Comput. Complex., 2019

X-Ramanujan Graphs.
CoRR, 2019

2018
Algorithms for Noisy Broadcast under Erasures.
CoRR, 2018

Algorithms for Noisy Broadcast with Erasures.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

On Sketching the q to p Norms.
Proceedings of the Approximation, 2018


  Loading...