World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
73
Citations
18330
World Ranking
1616
National Ranking
836

Research.com Recognitions

  • 2018 - ACM Fellow For contributions to approximation algorithms, hardness of approximation, and sublinear algorithms
  • 2007 - Fellow of John Simon Guggenheim Memorial Foundation
  • 2000 - Fellow of Alfred P. Sloan Foundation

Overview

Sanjeev Khanna is affiliated with the University of Pennsylvania in the United States. Their primary field of study is Computer Science, with a strong focus on computational theory and mathematics, as reflected in their extensive publication record.

The key subfields within Computer Science in which Sanjeev Khanna has contributed include:

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Artificial Intelligence
  • Computational Mechanics
  • Computer Vision and Pattern Recognition

The main topics of research explored by Khanna incorporate:

  • Complexity and Algorithms in Graphs
  • Optimization and Search Problems
  • Advanced Graph Theory Research
  • Machine Learning and Algorithms
  • Sparse and Compressive Sensing Techniques
  • Stochastic Gradient Optimization Techniques
  • Interconnection Networks and Systems

Khanna has published predominantly in several venues, including:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • Mathematical Programming
  • SSRN Electronic Journal

Examples of recent research papers authored or coauthored by Khanna include:

  • "Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling," 2020, Mathematical Programming
  • "On Weighted Graph Sparsification by Linear Sketching," 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • "Constructing Large Matchings via Query Access to a Maximal Matching Oracle," 2020, arXiv (Cornell University)
  • "Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation," 2020, presented in arXiv (Cornell University) and Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent coauthors who appear alongside Khanna in research contributions include:

  • Yu Chen
  • Aaron Putterman
  • Sepehr Assadi
  • Deeparnab Chakrabarty
  • Madhu Sudan

Achievements in Khanna's academic career include recognition as an ACM Fellow in 2018, for work on approximation algorithms, hardness of approximation, and sublinear algorithms. Additional honors are fellowships awarded by the John Simon Guggenheim Memorial Foundation in 2007 and the Alfred P. Sloan Foundation in 2000.

Best Publications

  • Why and Where: A Characterization of Data Provenance

    Peter Buneman;Sanjeev Khanna;Wang Chiew Tan

  • Gaia Early Data Release 3. Structure and properties of the Magellanic Clouds

    X. Luri;L. Chemin;G. Clementini

  • A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

    Chandra Chekuri;Sanjeev Khanna

  • Space-efficient online computation of quantile summaries

    Michael Greenwald;Sanjeev Khanna

  • On Syntactic versus Computational Views of Approximability

    Sanjeev Khanna;Rajeev Motwani;Madhu Sudan;Umesh Vazirani

  • Complexity classifications of Boolean constraint satisfaction problems

    Nadia Creignou;Sanjeev Khanna;Madhu Sudan

  • Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

    Venkatesan Guruswami;Sanjeev Khanna;Rajmohan Rajaraman;Bruce Shepherd

  • A PTAS for the multiple knapsack problem

    Chandra Chekuri;Sanjeev Khanna

  • Data Provenance: Some Basic Issues

    Peter Buneman;Sanjeev Khanna;Wang Chiew Tan

  • Gaia Early Data Release 3 - Catalogue validation

    C. Fabricius;X. Luri;F. Arenou;C. Babusiaux;C. Babusiaux

  • Archiving scientific data

    Peter Buneman;Sanjeev Khanna;Keishi Tajima;Wang-Chiew Tan

  • Differential Privacy: An Economic Method for Choosing Epsilon

    Justin Hsu;Marco Gaboardi;Andreas Haeberlen;Sanjeev Khanna

  • Gaia Early Data Release 3 - The Gaia Catalogue of Nearby Stars

    R. L. Smart;L. M. Sarro;J. Rybizki

  • On propagation of deletions and annotations through views

    Peter Buneman;Sanjeev Khanna;Wang-Chiew Tan

  • Gaia Early Data Release 3 - Summary of the contents and survey properties (Corrigendum)

    A. G. A. Brown;A. Vallenari;T. Prusti

  • Randomized pursuit-evasion in a polygonal environment

    V. Isler;S. Kannan;S. Khanna

  • On Multidimensional Packing Problems

    Chandra Chekuri;Sanjeev Khanna

  • Approximation schemes for minimizing average weighted completion time with release dates

    F. Afrati;E. Bampis;C. Chekuri;D. Karger

  • The Approximability of Constraint Satisfaction Problems

    Sanjeev Khanna;Madhu Sudan;Luca Trevisan;David P. Williamson

  • Power-conserving computation of order-statistics over sensor networks

    Michael B. Greenwald;Sanjeev Khanna

  • On multi-dimensional packing problems

    Chandra Chekuri;Sanjeev Khanna

  • FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science

    Peter Buneman;Sanjeev Khanna;Wang-Chiew Tan

Frequent Co-Authors

Chandra Chekuri
Chandra Chekuri University of Illinois at Urbana-Champaign
Madhu Sudan
Madhu Sudan Harvard University
Julia Chuzhoy
Julia Chuzhoy Toyota Technological Institute at Chicago
Sampath Kannan
Sampath Kannan University of Pennsylvania
Susan B. Davidson
Susan B. Davidson University of Pennsylvania
Rajeev Motwani
Rajeev Motwani Stanford University
Ashish Goel
Ashish Goel Stanford University
Wang-Chiew Tan
Wang-Chiew Tan Facebook (United States)
Peter Buneman
Peter Buneman University of Edinburgh
Venkatesan Guruswami
Venkatesan Guruswami University of California, Berkeley

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a career in Computer Science opens doors to many online degree options, from introductory associate programs to advanced graduate studies. For those just starting their academic journey or seeking flexibility, consider enrolling in an online associate degree in Computer Science. These programs offer foundational skills and can often be completed in two years or less.

If you’re aiming to advance your career or specialize further, researching the most useful masters degrees can help you identify in-demand fields and guide your educational path. Earning a Master's in Computer Science, for example, is highly valued by employers and opens opportunities for higher salaries and leadership roles.

Affordability and accessibility are also important factors. Many students seek out the cheap online colleges that provide quality programs without overwhelming tuition costs. Additionally, if your academic profile isn’t perfect, there are universities for low gpa that offer a second chance at a quality education.

Investigating these pathways ensures you find a program that fits your career goals, financial situation, and academic background.

Best Scientists Citing Sanjeev Khanna

Trending Scientists

Recently Published Articles