- Home
- Best Scientists - Computer Science
- Sanjeev Khanna

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
69
Citations
15,688
253
World Ranking
1254
National Ranking
721

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

- Algorithm
- Computer network
- Programming language

His scientific interests lie mostly in Combinatorics, Discrete mathematics, Approximation algorithm, Time complexity and Theoretical computer science. He has researched Combinatorics in several fields, including Matching, Computational complexity theory and Bin packing problem. His research integrates issues of Multi-commodity flow problem, Metric and Relaxation in his study of Discrete mathematics.

His Approximation algorithm study integrates concerns from other disciplines, such as Linear programming, Routing, Bounded function and Disjoint sets. The concepts of his Time complexity study are interwoven with issues in Completion time, If and only if and Graph. Sanjeev Khanna focuses mostly in the field of Theoretical computer science, narrowing it down to matters related to Contrast and, in some cases, Online computation, Sequence, Data type, Group and Value.

- Why and Where: A Characterization of Data Provenance (1095 citations)
- Space-efficient online computation of quantile summaries (443 citations)
- Complexity classifications of Boolean constraint satisfaction problems (389 citations)

Sanjeev Khanna mostly deals with Combinatorics, Discrete mathematics, Approximation algorithm, Upper and lower bounds and Mathematical optimization. His Combinatorics research is multidisciplinary, incorporating elements of Matching and Bounded function. His study looks at the relationship between Discrete mathematics and fields such as Multi-commodity flow problem, as well as how they intersect with chemical problems.

Sanjeev Khanna studied Approximation algorithm and Computational complexity theory that intersect with Graph theory. His Mathematical optimization study incorporates themes from Mathematical economics and Scheduling. His Algorithm research is multidisciplinary, incorporating perspectives in Simple and Theoretical computer science.

- Combinatorics (40.26%)
- Discrete mathematics (33.00%)
- Approximation algorithm (21.12%)

- Combinatorics (40.26%)
- Discrete mathematics (33.00%)
- Upper and lower bounds (14.19%)

Combinatorics, Discrete mathematics, Upper and lower bounds, Algorithm and Bipartite graph are his primary areas of study. His work on Vertex, Approximation algorithm and Binary logarithm is typically connected to Omega as part of general Combinatorics study, connecting several disciplines of science. The study incorporates disciplines such as Graph, Model of computation, Computation and Streaming algorithm in addition to Discrete mathematics.

His Upper and lower bounds study combines topics from a wide range of disciplines, such as Conductance, Logarithm, Singular value decomposition, Function and Existential quantification. His work in the fields of Algorithm, such as Property testing, intersects with other areas such as Running time. His work deals with themes such as Private information retrieval and Partition, which intersect with Bipartite graph.

- Maximum matchings in dynamic graph streams and the simultaneous communication model (65 citations)
- On estimating maximum matching size in graph streams (54 citations)
- Randomized Composable Coresets for Matching and Vertex Cover (39 citations)

- Algorithm
- Computer network
- Programming language

Sanjeev Khanna mainly focuses on Discrete mathematics, Combinatorics, Upper and lower bounds, Streaming algorithm and Algorithm. His studies in Discrete mathematics integrate themes in fields like Matching, Graph, Approximation algorithm and Computation. His research in Approximation algorithm intersects with topics in Regular expression, Combinatory logic, Memory footprint and Programming paradigm.

His works in Open problem, Vertex, Vertex cover, Bipartite graph and Time complexity are all subjects of inquiry into Combinatorics. His Streaming algorithm research incorporates elements of Java, Model of computation and Theoretical computer science, Communication complexity. His work on Randomized algorithm as part of general Algorithm research is frequently linked to Running time, thereby connecting diverse disciplines of science.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Why and Where: A Characterization of Data Provenance

Peter Buneman;Sanjeev Khanna;Wang Chiew Tan.

international conference on database theory **(2001)**

1660 Citations

Space-efficient online computation of quantile summaries

Michael Greenwald;Sanjeev Khanna.

international conference on management of data **(2001)**

668 Citations

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

Chandra Chekuri;Sanjeev Khanna.

SIAM Journal on Computing **(2005)**

656 Citations

On Syntactic versus Computational Views of Approximability

Sanjeev Khanna;Rajeev Motwani;Madhu Sudan;Umesh Vazirani.

SIAM Journal on Computing **(1999)**

562 Citations

Complexity classifications of Boolean constraint satisfaction problems

Nadia Creignou;Sanjeev Khanna;Madhu Sudan.

**(1987)**

544 Citations

A PTAS for the multiple knapsack problem

Chandra Chekuri;Sanjeev Khanna.

symposium on discrete algorithms **(2000)**

417 Citations

Data Provenance: Some Basic Issues

Peter Buneman;Sanjeev Khanna;Wang Chiew Tan.

foundations of software technology and theoretical computer science **(2000)**

372 Citations

Archiving scientific data

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

ACM Transactions on Database Systems **(2004)**

338 Citations

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

Venkatesan Guruswami;Sanjeev Khanna;Rajmohan Rajaraman;Bruce Shepherd.

Journal of Computer and System Sciences **(2003)**

328 Citations

On propagation of deletions and annotations through views

Peter Buneman;Sanjeev Khanna;Wang-Chiew Tan.

symposium on principles of database systems **(2002)**

272 Citations

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

Contact us

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:

University of Illinois at Urbana-Champaign

Harvard University

University of Pennsylvania

University of Pennsylvania

Stanford University

Stanford University

Facebook (United States)

University of California, Berkeley

University of Edinburgh

Technion – Israel Institute of Technology

Aalborg University

Equal1 labs

University of Birmingham

Abbott (Sweden)

Chinese Academy of Sciences

Zhengzhou University

Gyeongsang National University

University of Queensland

Stanford University

IQinAbox

South China Agricultural University

Florida International University

Texas A&M University

University of Pennsylvania

University of Tokushima

Boston University

Something went wrong. Please try again later.