Sanjeev Khanna

Sanjeev Khanna

University of Pennsylvania

H-index: 68

North America-United States

About Sanjeev Khanna

Sanjeev Khanna, With an exceptional h-index of 68 and a recent h-index of 33 (since 2020), a distinguished researcher at University of Pennsylvania, specializes in the field of Theoretical computer science.

His recent articles reflect a diverse array of research interests and contributions to the field:

On regularity lemma and barriers in streaming and dynamic matching

A polynomial lower bound on the number of rounds for parallel submodular function minimization and matroid intersection

Query Complexity of the Metric Steiner Tree Problem

Set Cover in the One-pass Edge-arrival Streaming Model

A sharp memory-regret trade-off for multi-pass streaming bandits

PAC Top- Identification under SST in Limited Rounds

Sublinear algorithms and lower bounds for estimating MST and TSP cost in general metrics

Optimal bounds for dominating set in graph streams

Sanjeev Khanna Information

University

Position

Henry Salvatori Professor of Computer Science

Citations(all)

16887

Citations(since 2020)

4499

Cited By

15949

hIndex(all)

68

hIndex(since 2020)

33

i10Index(all)

176

i10Index(since 2020)

102

Email

University Profile Page

University of Pennsylvania

Google Scholar

View Google Scholar Profile

Sanjeev Khanna Skills & Research Interests

Theoretical computer science

Top articles of Sanjeev Khanna

Title

Journal

Author(s)

Publication Date

On regularity lemma and barriers in streaming and dynamic matching

Sepehr Assadi

Soheil Behnezhad

Sanjeev Khanna

Huan Li

2023/6/2

A polynomial lower bound on the number of rounds for parallel submodular function minimization and matroid intersection

SIAM Journal on Computing

Deeparnab Chakrabarty

Yu Chen

Sanjeev Khanna

2023/2/7

Query Complexity of the Metric Steiner Tree Problem

Yu Chen

Sanjeev Khanna

Zihan Tan

2023

Set Cover in the One-pass Edge-arrival Streaming Model

Sanjeev Khanna

Christian Konrad

Cezar-Mihail Alexandru

2023/6/18

A sharp memory-regret trade-off for multi-pass streaming bandits

Arpit Agarwal

Sanjeev Khanna

Prathamesh Patil

2022/6/28

PAC Top- Identification under SST in Limited Rounds

Arpit Agarwal

Sanjeev Khanna

Prathamesh Patil

2022/5/3

Sublinear algorithms and lower bounds for estimating MST and TSP cost in general metrics

arXiv preprint arXiv:2203.14798

Yu Chen

Sanjeev Khanna

Zihan Tan

2022/3/28

Optimal bounds for dominating set in graph streams

Leibniz international proceedings in informatics

Sanjeev Khanna

Christian Konrad

2022/1

Sublinear algorithms for hierarchical clustering

Advances in Neural Information Processing Systems

Arpit Agarwal

Sanjeev Khanna

Huan Li

Prathamesh Patil

2022/12/6

New trade-offs for fully dynamic matching via hierarchical edcs

Soheil Behnezhad

Sanjeev Khanna

2022

On weighted graph sparsification by linear sketching

Yu Chen

Sanjeev Khanna

Huan Li

2022/10/31

Better and simpler error analysis of the Sinkhorn–Knopp algorithm for matrix scaling

Mathematical Programming

Deeparnab Chakrabarty

Sanjeev Khanna

2021/7

Sublinear time hypergraph sparsification via cut and edge sampling queries

arXiv preprint arXiv:2106.10386

Yu Chen

Sanjeev Khanna

Ansh Nagda

2021/6/18

Hardness of approximation for orienteering with multiple time windows

Naveen Garg

Sanjeev Khanna

Amit Kumar

2021

Approximate optimization of convex functions with outlier noise

Advances in Neural Information Processing Systems

Anindya De

Sanjeev Khanna

Huan Li

MohammadHesam NikpeySalekde

2021/12/6

Near-perfect recovery in the one-dimensional latent space model

Yu Chen

Sampath Kannan

Sanjeev Khanna

2020/4/20

Sensitivity and Computational Complexity in Financial Networks

Algorithmic Finance

Brett Hemenway

Sanjeev Khanna

2016/1/1

Graph connectivity and single element recovery via linear and OR queries

Sepehr Assadi

Deeparnab Chakrabarty

Sanjeev Khanna

2020/7/12

Space-efficient query evaluation over probabilistic event streams

Rajeev Alur

Yu Chen

Kishor Jothimurugan

Sanjeev Khanna

2020/7/8

An efficient PTAS for stochastic load balancing with poisson jobs

arXiv preprint arXiv:2006.12670

Anindya De

Sanjeev Khanna

Huan Li

Hesam Nikpey

2020/6/23

See List of Professors in Sanjeev Khanna University(University of Pennsylvania)

Co-Authors

H-index: 69
Benjamin C. Pierce

Benjamin C. Pierce

University of Pennsylvania

H-index: 69
Madhu Sudan

Madhu Sudan

Harvard University

H-index: 64
Joseph Seffi Naor

Joseph Seffi Naor

Technion - Israel Institute of Technology

H-index: 60
Venkatesan Guruswami

Venkatesan Guruswami

Carnegie Mellon University

H-index: 59
Tova Milo

Tova Milo

Tel Aviv University

H-index: 58
Chandra Chekuri

Chandra Chekuri

University of Illinois at Urbana-Champaign

academic-engine