My research involves trying to quantify the fundamental limits and capabilities of computation. This involves questions like cryptography (can we build a code that is unbreakable?), algorithms (in what cases can we find better procedures to solve a problem than exhaustive search over all possiblities?), and computational complexity (can we sometimes prove that a problem is inherently intractable?).

Awards and Achievements

  • ACM award for best dissertation ( 2004)
  • Alfred P. Sloan fellowship ( 2007)
  • Invited Sectional Speaker, International Congress of Mathematicians ( 2014)
  • Foreign Policy magazine 100 leading global thinkers ( 2014)
  • Simons Investigator