Peter ManoharEmail: pmanohar [at] cs [dot] cmu [dot] edu Office: 9231 Gates Hillman Center
I am a fifth year PhD student at Carnegie Mellon University, advised by Venkatesan Guruswami and Pravesh K. Kothari. I am broadly interested in Theoretical Computer Science, specifically in the areas of computational complexity, algorithms, and coding theory.
Currently, I am working on designing algorithms for smoothed variants of NP-hard constraint satisfaction problems and leveraging these algorithms to prove new lower bounds for locally decodable and correctable codes.
Prior to CMU, I completed a B.S. in EECS at UC Berkeley. At Berkeley, I was advised by Alessandro Chiesa, where I worked on property testing, probabilistically checkable proofs, and coding theory, and Ren Ng, where I worked on computer graphics.