default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSidhanth Mohanty
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Kuikui Liu, Sidhanth Mohanty, Amit Rajaraman, David X. Wu:
Fast Mixing in Sparse Random Ising Models. FOCS 2024: 120-128- [c19]Kuikui Liu, Sidhanth Mohanty, Prasad Raghavendra, Amit Rajaraman, David X. Wu:
Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains. FOCS 2024: 203-215 - [c18]Sidhanth Mohanty
, Prasad Raghavendra, David X. Wu:
Robust Recovery for Stochastic Block Models, Simplified and Generalized. STOC 2024: 367-374 - [c17]Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, Pedro Paredes:
Explicit Two-Sided Unique-Neighbor Expanders. STOC 2024: 788-799 - [i23]Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty, David Munhá Correia, Benny Sudakov:
Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs. CoRR abs/2401.11590 (2024) - [i22]Sidhanth Mohanty, Prasad Raghavendra, David X. Wu:
Robust recovery for stochastic block models, simplified and generalized. CoRR abs/2402.13921 (2024) - [i21]Kuikui Liu, Sidhanth Mohanty, Amit Rajaraman, David X. Wu:
Fast Mixing in Sparse Random Ising Models. CoRR abs/2405.06616 (2024) - [i20]Kuikui Liu, Sidhanth Mohanty, Prasad Raghavendra, Amit Rajaraman, David X. Wu:
Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains. CoRR abs/2405.20849 (2024) - 2023
- [b1]Sidhanth Mohanty:
Phase Transitions in Inference. University of California, Berkeley, USA, 2023 - [c16]Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty:
A simple and sharper proof of the hypergraph Moore bound. SODA 2023: 2324-2344 - [c15]Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang:
Local and Global Expansion in Random Geometric Graphs. STOC 2023: 817-825 - [i19]Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, Pedro Paredes:
Explicit two-sided unique-neighbor expanders. CoRR abs/2302.01212 (2023) - 2022
- [j1]Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes:
Explicit Near-Ramanujan Graphs of Every Degree. SIAM J. Comput. 51(3): 20-1 (2022) - [c14]Jun-Ting Hsieh, Sidhanth Mohanty, Jeff Xu:
Certifying Solution Geometry in Random CSPs: Counts, Clusters and Balance. CCC 2022: 11:1-11:18 - [c13]Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang:
Testing thresholds for high-dimensional sparse random geometric graphs. STOC 2022: 672-677 - [i18]Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty:
A simple and sharper proof of the hypergraph Moore bound. CoRR abs/2207.10850 (2022) - [i17]Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang:
Local and global expansion in random geometric graphs. CoRR abs/2210.00158 (2022) - 2021
- [c12]Siqi Liu, Sidhanth Mohanty, Prasad Raghavendra:
On statistical inference when fixed points of belief propagation are unstable. FOCS 2021: 395-405 - [c11]Theo McKenzie, Sidhanth Mohanty:
High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion. ICALP 2021: 96:1-96:15 - [c10]Jess Banks, Sidhanth Mohanty, Prasad Raghavendra:
Local Statistics, Semidefinite Programming, and Community Detection. SODA 2021: 1298-1316 - [i16]Siqi Liu, Sidhanth Mohanty, Prasad Raghavendra:
Computational phase transitions in sparse planted problems? CoRR abs/2101.10882 (2021) - [i15]Jun-Ting Hsieh, Sidhanth Mohanty, Jeff Xu:
Certifying solution geometry in random CSPs: counts, clusters and balance. CoRR abs/2106.12710 (2021) - [i14]Shirshendu Ganguly, Theo McKenzie, Sidhanth Mohanty, Nikhil Srivastava:
Many nodal domains in random regular graphs. CoRR abs/2109.11532 (2021) - [i13]Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang:
Testing thresholds for high-dimensional sparse random geometric graphs. CoRR abs/2111.11316 (2021) - 2020
- [c9]Yeshwanth Cherapanamjeri, Sidhanth Mohanty, Morris Yau:
List Decodable Mean Estimation in Nearly Linear Time. FOCS 2020: 141-148 - [c8]Siqi Liu, Sidhanth Mohanty, Elizabeth Yang:
High-Dimensional Expanders from Expanders. ITCS 2020: 12:1-12:32 - [c7]Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff:
Pseudo-Deterministic Streaming. ITCS 2020: 79:1-79:25 - [c6]Sidhanth Mohanty, Ryan O'Donnell:
X-Ramanujan graphs. SODA 2020: 1226-1243 - [c5]Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes:
The SDP Value for Random Two-Eigenvalue CSPs. STACS 2020: 50:1-50:45 - [c4]Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes:
Explicit near-Ramanujan graphs of every degree. STOC 2020: 510-523 - [c3]Sidhanth Mohanty, Prasad Raghavendra, Jeff Xu:
Lifting sum-of-squares lower bounds: degree-2 to degree-4. STOC 2020: 840-853 - [i12]Yeshwanth Cherapanamjeri, Sidhanth Mohanty, Morris Yau:
List Decodable Mean Estimation in Nearly Linear Time. CoRR abs/2005.09796 (2020) - [i11]Theo McKenzie, Sidhanth Mohanty:
High-girth near-Ramanujan graphs with lossy vertex expansion. CoRR abs/2007.13630 (2020)
2010 – 2019
- 2019
- [i10]Sidhanth Mohanty, Ryan O'Donnell:
X-Ramanujan Graphs. CoRR abs/1904.03500 (2019) - [i9]Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes:
The SDP value for random two-eigenvalue CSPs. CoRR abs/1906.06732 (2019) - [i8]Siqi Liu, Sidhanth Mohanty, Elizabeth Yang:
High-Dimensional Expanders from Expanders. CoRR abs/1907.10771 (2019) - [i7]Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes:
Explicit near-Ramanujan graphs of every degree. CoRR abs/1909.06988 (2019) - [i6]Sidhanth Mohanty, Prasad Raghavendra, Jeff Xu:
Lifting Sum-of-Squares Lower Bounds: Degree-2 to Degree-4. CoRR abs/1911.01411 (2019) - [i5]Jess Banks, Sidhanth Mohanty, Prasad Raghavendra:
Local Statistics, Semidefinite Programming, and Community Detection. CoRR abs/1911.01960 (2019) - [i4]Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff:
Pseudo-deterministic Streaming. CoRR abs/1911.11368 (2019) - [i3]Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff:
Pseudo-deterministic Streaming. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c2]Aditya Krishnan, Sidhanth Mohanty, David P. Woodruff:
On Sketching the q to p Norms. APPROX-RANDOM 2018: 15:1-15:20 - [c1]Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty:
Algorithms for Noisy Broadcast with Erasures. ICALP 2018: 153:1-153:12 - [i2]Aditya Krishnan, Sidhanth Mohanty, David P. Woodruff:
On Sketching the q to p norms. CoRR abs/1806.06429 (2018) - [i1]Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty:
Algorithms for Noisy Broadcast under Erasures. CoRR abs/1808.00838 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
