Sidhanth Mohanty

Email: sidhanthm (at) cs (dot) berkeley (dot) edu

Office: 635 Soda Hall

I am a first year PhD student in the Theory Group at UC Berkeley, fortunate to be advised by Prasad Raghavendra . Most recently, I have been thinking about problems to understand the power and limitations of semidefinite programming for average case problems. More generally, I am interested in random matrix theory, combinatorics, and geometry of polynomials. My undergraduate education was at Carnegie Mellon University where I had the fortune of being advised by Ryan O'Donnell on my senior thesis. I also had the pleasure of working with Anil Ada, Bernhard Haeupler, Ariel Procaccia, and David Woodruff.


Publications

Robust Community Detection via Semidefinite Programming
(with Jess Banks and Prasad Raghavendra)
In submission

X-Ramanujan Graphs [pdf]
(with Ryan O'Donnell)
In submission

On Sketching the q to p norms [pdf]
(with Aditya Krishnan and David P. Woodruff)
APPROX 2018

Algorithms for Noisy Broadcast with Erasures [pdf, slides]
(with Ofer Grossman and Bernhard Haeupler)
ICALP 2018