Peter Manohar

Email: pmanohar [at] cs [dot] cmu [dot] edu
Office: 9007 Gates Hillman Center

About Me

I am a second year PhD student at Carnegie Mellon University, advised by Venkat Guruswami. I am broadly interested in Complexity Theory and Cryptography, specifically in topics such as probabilistically checkable proofs, property testing, coding theory, the sum-of-squares hierarchy, and high-dimensional geometry.

Prior to CMU, I completed a B.S. in EECS at UC Berkeley, where I was advised by Alessandro Chiesa and Ren Ng.

My research is supported by an NSF fellowship and an ARCS scholarship.

I help co-organize CMU's Theory Club with Pedro Paredes.


  • A Stress-Free Sum-of-Squares Lower Bound for Coloring
    Pravesh Kothari, Peter Manohar
    CCC 2021
  • On Local Testability in the Non-Signaling Setting
    Alessandro Chiesa, Peter Manohar, Igor Shinkar
    ITCS 2020
  • Succinct Arguments in the Quantum Random Oracle Model
    Alessandro Chiesa, Peter Manohar, Nicholas Spooner
    TCC 2019 and QIP 2020
  • Probabilistic Checking against Non-Signaling Strategies from Linearity Testing
    Alessandro Chiesa, Peter Manohar, Igor Shinkar
    ITCS 2019
  • Testing Linearity against Non-Signaling Strategies
    Alessandro Chiesa, Peter Manohar, Igor Shinkar
    CCC 2018
  • On Axis-Parallel Tests for Tensor Product Codes
    Alessandro Chiesa, Peter Manohar, Igor Shinkar
    RANDOM 2017

Other projects

  • HABIT: Hardware-Assisted Bluetooth-based Infection Tracking
    Nathan Manohar, Peter Manohar, Rajit Manohar
    Preprint 2020
    Now deployed at high schools in Connecticut!
  • Lower Bounds for Caching with Delayed Hits
    Peter Manohar, Jalani Williams
    AndrewNets 2020
  • Raymarched Microgeometry on Triangle Meshes
    James Fong, Brian Lei, Peter Manohar
    CS 184 Final Project Showcase
  • ecfactory: A SageMath Library for Constructing Elliptic Curves
    Alessandro Chiesa, Peter Manohar
    SCIPR Lab