Arora (computer scientist)

Arora (computer scientist)
Name	Sanjeev Arora
Birth date	1968
Birth place	India
Nationality	United States
Fields	Computer science, Theoretical computer science, Algorithms
Workplaces	Princeton University, Massachusetts Institute of Technology, Harvard University
Alma mater	Indian Institute of Technology Roorkee, Stony Brook University
Doctoral advisor	Robert M. Karp
Known for	Probabilistically checkable proofs, Approximation algorithms, Hardness of approximation, Complexity theory
Awards	Gödel Prize, Nevalinna Prize, Grace Murray Hopper Award

Arora (computer scientist) is an Indian-American theoretical Computer scientist known for foundational work in probabilistically checkable proofs, approximation algorithms, and computational complexity theory. His research established deep connections among NP-completeness, PCP theorem, and hardness of approximation results that influenced subsequent developments in cryptography, machine learning, and quantum computing. He has held faculty positions at leading institutions and received major international awards for contributions to theoretical computer science.

Early life and education

Arora was born in India and completed undergraduate studies at the Indian Institute of Technology Roorkee before emigrating to the United States for graduate work. He earned his Ph.D. at Stony Brook University under the supervision of Robert M. Karp, where he studied topics related to randomized algorithms and computational complexity theory. During graduate school he collaborated with researchers at institutions such as Bell Labs, Microsoft Research, and the Institute for Advanced Study, connecting him with figures from theoretical computer science like Umesh Vazirani, Shafi Goldwasser, and Silvio Micali.

Research contributions

Arora's research contributions span several interrelated domains of theoretical computer science. He was a central author of work proving tight forms of the Probabilistically Checkable Proofs (PCP) theorem, collaborating with scholars such as Shmuel Safra, Moses Charikar, and Subhash Khot, which connected PCP constructions to concrete hardness results for approximation algorithms including those for the set cover problem, vertex cover problem, and Max-SAT. His results clarified limitations on polynomial-time approximation ratios by leveraging reductions related to NP-completeness and structural properties of graph theory.

Arora co-developed algorithmic frameworks that advanced design and analysis of polynomial-time approximation schemes (PTAS) and fully polynomial-time approximation schemes (FPTAS) for optimization problems studied by researchers at MIT, Stanford University, and UC Berkeley. His work on sublinear-time algorithms and property testing interfaced with contributions from Oded Goldreich, Dana Ron, and Eli Upfal, influencing streaming algorithms studied at Carnegie Mellon University and University of Washington.

In complexity theory, Arora contributed to understanding probabilistic proof systems, interactive proofs, and hardness amplification, often in dialogue with researchers at Princeton University, Harvard University, and Columbia University. His analyses influenced cryptographic hardness assumptions used by groups working on lattice-based cryptography and post-quantum proposals at NYU and University of Toronto.

Beyond theory, Arora engaged with applied areas: connections between optimization and learning theory informed advances in deep learning and nonconvex optimization studied at Google Research and Facebook AI Research. He also co-advised interdisciplinary projects linking computational complexity to statistical physics topics explored at the Perimeter Institute and Santa Fe Institute.

Academic career and positions

Arora held faculty appointments at prominent research universities, including positions at Massachusetts Institute of Technology, Harvard University, and ultimately Princeton University where he served as a professor in the Department of Computer Science. He has been a visiting scholar at the Institute for Advanced Study and a fellow at Microsoft Research and Bell Labs. Arora taught graduate and undergraduate courses in algorithms, complexity theory, and optimization, supervising doctoral students who went on to faculty positions at institutions such as UC Berkeley, Stanford University, Carnegie Mellon University, and University of Illinois Urbana–Champaign.

He has participated in program committees for leading conferences including STOC, FOCS, and SODA, and served on editorial boards of journals like the Journal of the ACM and SIAM Journal on Computing. Arora collaborated with researchers at research labs and universities worldwide, presenting invited talks at venues including ICLR, NeurIPS, and the International Congress of Mathematicians.

Awards and honors

Arora's work has been recognized with major prizes and honors. He is a recipient of the Gödel Prize for contributions to the PCP theorem and hardness of approximation, the Nevalinna Prize for advances in computational complexity, and the Grace Murray Hopper Award for early-career achievements in computer science. He has been elected a fellow of societies such as the Association for Computing Machinery and the American Academy of Arts and Sciences and received honorary lectureships at institutions including ETH Zurich and École Normale Supérieure.

Other distinctions include invited keynote addresses at STOC and FOCS, named professorships at Princeton University, and multiple best-paper awards at conferences such as SODA and ICALP for work that bridged theory and applications.

Selected publications

- Arora, S., Safra, S., et al., "Proofs That Yield Nothing But Their Validity", in proceedings of STOC — foundational PCP-theorem related work with broad implications for NP-completeness and approximation algorithms. - Arora, S., et al., "Approximation Schemes for NP-hard Problems", in Journal of the ACM — techniques for PTAS and FPTAS impacting optimization research at MIT and Stanford University. - Arora, S., Khot, S., "Hardness of Approximation Results", in proceedings of FOCS — establishing tight inapproximability bounds for problems like Max-SAT and vertex cover. - Arora, S., Safra, S., Sudan, M., "Interactive Proofs and Probabilistic Checking", invited article at the International Congress of Mathematicians — survey connecting interactive proof systems with PCP constructs. - Arora, S., Barak, B., "Computational Complexity: A Modern Approach" — comprehensive textbook used in courses at Princeton University and Harvard University influencing curricula in algorithms and complexity theory.

Category:Living people Category:Theoretical computer scientists Category:Princeton University faculty