Contact Info |  Publications | Course I have taught (webpages)| Talk Slides

Sanjeev Arora
Professor of Computer Science
Princeton University
Ph.D., UC Berkeley, 1994

Research Interests: My research area is Theoretical Computer Science, specifically, Computational Complexity, Uses of randomness in computation, Probabilistically Checkable Proofs (PCPs), Computing Approximate Solutions to NP-hard problems, Geometric embeddings of metric spaces Most of my papers are online on my publications list.

Contact Info:  Click here . (Email is the fastest way to reach me)

List of former and current students.

Random Links :

• NEW (Aug'07): My experiences with RSI; and Feldenkrais FAQ.
  
• pika : My undergrad living group at MIT. See if you can recognize me in their 1989-90 house picture
• Some of my photos.
• Trip to Lehigh Valley, PA with the Society for Industrial Archaeology. My writeup and B+W photos.
• Sites useful for my research.
• Haiku on complexity theory and PCP Theorem (composed by Satish Rao's students) and
  similar efforts by my Princeton students.
• Nice things to do around Princeton. A list I maintain (but update every few years).
• Pictures of Nia (born 5/12/99) Maintained for uncles and aunts in faraway places.Page 1, Page 2, Page 3, Page 4, Page 5, Page 6 , Page 7, Page 8,Page 9, Page 10, Page 11,Page 12,Page 13,Page 14,Page 15 Page 16 Page 17 Page 18 Page 19
• Pictures of Rohan (b. 5/10/02). Page 1 Page 2
• Pictures of Nia and Rohan Page 1, Christmas02, Page 3 , Page 4, Fall'03,Indiatrip'03, Summer'04part 1 and Europe'04

Number of times accessed since April 12 1996: