2026 Sanjeev Arora: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	77	1238	1197	655	629	225	34138

Research.com Recognitions

2018 - Member of the National Academy of Sciences
2015 - Fellow of the American Academy of Arts and Sciences
2011 - ACM Prize in Computing For contributions to computational complexity, algorithms, and optimization that have helped reshape our understanding of computation.
2008 - ACM Fellow For foundational work on probabilistically checkable proofs and approximate solutions to NP-hard optimization problems.
1996 - Fellow of Alfred P. Sloan Foundation

Overview

Sanjeev Arora is affiliated with Princeton University in the United States. Their research primarily focuses on Medicine, with a notable concentration in Pediatrics, Perinatology and Child Health, and Obstetrics and Gynecology. Additional areas of study include Public Health, Environmental and Occupational Health, Epidemiology, and Rehabilitation.

Their research covers several main topics, including:

Pregnancy and preeclampsia studies
Assisted Reproductive Technology and Twin Pregnancy
Birth, Development, and Health
Ectopic Pregnancy Diagnosis and Management
Prenatal Screening and Diagnostics
Maternal and fetal healthcare
Preterm Birth and Chorioamnionitis

Frequent publication venues for Sanjeev Arora include:

BMC Pregnancy and Childbirth
Fetal Diagnosis and Therapy
American Journal of Obstetrics and Gynecology
The Journal of Obstetrics and Gynecology of India
Journal Of Advanced Zoology

Key recent papers authored or co-authored by Sanjeev Arora are:

"Performance of Fetal Medicine Foundation algorithm for first trimester preeclampsia screening in an indigenous south Asian population" (2021), BMC Pregnancy and Childbirth
"Elective Fetal Reduction in Dichorionic Diamniotic Twin Pregnancies on Parental Request: A Single-Centre Experience" (2021), Fetal Diagnosis and Therapy
"Three-dimensional color Doppler acquisition of a highly vascular giant placental chorioangioma" (2021), American Journal of Obstetrics and Gynecology
"First-Trimester Crown-Rump Length (CRL) and Nuchal Translucency (NT) Discordance in Monochorionic Twins: An Ominous Sign or a Benign Feature?" (2020), The Journal of Obstetrics and Gynecology of India
"Examining The Relationship Between Gut Microbiota And Sports Performance: A Narrative Review" (2024), Journal Of Advanced Zoology

Frequent co-authors in their works include:

Anita Kaul
Smriti Prasad
Akshatha Sharma
Keerthana Anand
Daljit Singh Sahota

Sanjeev Arora has received several awards recognizing their contributions in the scientific community, including:

Member of the National Academy of Sciences, 2018
Fellow of the American Academy of Arts and Sciences, 2015
ACM Prize in Computing, 2011, awarded for contributions to computational complexity, algorithms, and optimization
ACM Fellow, 2008, for foundational work on probabilistically checkable proofs and approximate solutions to NP-hard optimization problems
Fellow of Alfred P. Sloan Foundation, 1996

Best Publications

Computational Complexity: A Modern Approach

Sanjeev Arora;Boaz Barak

4333
Citations
Proof verification and the hardness of approximation problems.

Sanjeev Arora;Carsten Lund;Rajeev Motwani;Madhu Sudan

3063
Citations
Probabilistic checking of proofs: a new characterization of NP

Sanjeev Arora;Shmuel Safra

2016
Citations
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Sanjeev Arora

1439
Citations
A Simple but Tough-to-Beat Baseline for Sentence Embeddings

Sanjeev Arora;Yingyu Liang;Tengyu Ma

1240
Citations
Computational Complexity: ADVANCED TOPICS

Sanjeev Arora;Boaz Barak

1080
Citations
Proof verification and hardness of approximation problems

S. Arora;C. Lund;R. Motwani;M. Sudan

1064
Citations
The Multiplicative Weights Update Method: A Meta-Algorithm and Applications

Sanjeev Arora;Elad Hazan;Satyen Kale

1038
Citations
Expander flows, geometric embeddings and graph partitioning

Sanjeev Arora;Satish Rao;Umesh Vazirani

983
Citations
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Sanjeev Arora;David Karger;Marek Karpinski

867
Citations
Improved low-degree testing and its applications

Sanjeev Arora;Madhu Sudan

579
Citations
Generalization and Equilibrium in Generative Adversarial Nets (GANs)

Sanjeev Arora;Rong Ge;Yingyu Liang;Tengyu Ma

575
Citations
Polynomial time approximation schemes for Euclidean TSP and other geometric problems

S. Arora

572
Citations
Fine-grained analysis of optimization and generalization for overparameterized two-layer neural networks

Sanjeev Arora;Simon S. Du;Wei Hu;Zhiyuan Li

522
Citations
Approximation schemes for Euclidean k-medians and related problems

Sanjeev Arora;Prabhakar Raghavan;Satish Rao

520
Citations
Subexponential Algorithms for Unique Games and Related Problems

Sanjeev Arora;Boaz Barak;David Steurer

502
Citations
Learning Topic Models -- Going beyond SVD

Sanjeev Arora;Rong Ge;Ankur Moitra

492
Citations
On Exact Computation with an Infinitely Wide Neural Net

Sanjeev Arora;Simon S. Du;Wei Hu;Zhiyuan Li

480
Citations
A Practical Algorithm for Topic Modeling with Provable Guarantees

Sanjeev Arora;Rong Ge;Yonatan Halpern;David Mimno

474
Citations
A Theoretical Analysis of Contrastive Unsupervised Representation Learning

Sanjeev Arora;Hrishikesh Khandeparkar;Mikhail Khodak;Orestis Plevrakis

461
Citations
The hardness of approximate optima in lattices, codes, and systems of linear equations

S. Arora;L. Babai;J. Stern;Z. Sweedyk

290
Citations

Frequent Co-Authors

Boaz Barak Harvard University

Rong Ge Duke University

Tengyu Ma Stanford University

Ankur Moitra MIT

Elad Hazan Princeton University

Yingyu Liang University of Wisconsin–Madison

Satyen Kale Google (United States)

David Steurer ETH Zurich

Simon S. Du University of Washington

Yuanzhi Li Carnegie Mellon University

External Links

Wikipedia of Sanjeev Arora Personal website of Sanjeev Arora Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Expanding your computer science education opens the door to a wide range of online degrees and certification options in the USA. For those interested in STEM fields, pursuing an online physics degree is an accessible way to build strong analytical and problem-solving skills.

Data science is one of the fastest-growing tech fields. If you’re considering this path, exploring a well-structured data science learning path can provide a clear roadmap—often with affordable tuition, flexible online delivery, and excellent career prospects.

Interested in engineering? Many reputable institutions now provide online electrical engineering programs, some of which are featured for their competitive electrical engineering online tuition costs. This makes earning a respected engineering degree more attainable, regardless of your location.

Additionally, if you’re seeking shorter study times and a rapid career boost, consider pursuing easy certifications that pay well. These can enhance your resume quickly without the need for a full degree.