My research area is Theoretical Computer Science. Specific topics that I have worked on: Computational Complexity (see my book on this topic), Probabilistically Checkable Proofs (PCPs), computing approximate solutions to NP-hard problems, geometric embedding of metric spaces, unique games conjecture, complexity of financial derivatives, provable bounds for Machine Learning. See my group website.
Computer Science Dept,
35 Olden St
Princeton NJ 08540
609-258-3869 (but don't leave a msg; send email instead)
609-258-4562 (Ms Mitra Kelly; Admin. Assistant)
While on sabbatical in Spring 2013 I started a travelogue that I still maintain.