Faculty

Institution

Unit

Venue

Sanjeev Khanna

Henry Salvatori Professor of Computer and Information Science

University of Pennsylvania

Affiliations

School of Engineering and Applied Science

Computer and Information Science

Sanjeev Khanna is currently serving as a Computer And Information Science Henry Salvatori Professor of Computer and Information Science at University of Pennsylvania.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Sanjeev Khanna

University of Pennsylvania

Henry Salvatori Professor of Computer and Information Science

You can click a keyword to filter the displayed items

computer science applied mathematics machine learning graph theory mathematical optimization systems engineering combinatorial optimization theoretical computer science computational complexity computational optimization data science approximation theory discrete algorithms operations research information security scheduling (computing) scheduling problems information retrieval mathematical programming distributed systems data provenance optimization problems data security communication security constraint satisfaction discrete optimization streaming algorithms graph algorithms network security edge-disjoint paths combinatorial theory data privacy information technology combinatorial problems structural graph theory network optimization graph processing streaming data scheduling analysis approximation algorithms regular bipartite graphs perfect matchings databases numerical algorithms wireless communications complexity theory extremal graph theory network routing algorithm vehicle routing problems denial-of-service attacks channel model database theory matching technique flow time workflow provenance stochastic matching problem maximum bipartite matching field robotics networked system design database processing image similarity similarity search path planning planar graphs computational complexity theory network routing ddos detection distributed processing multiple knapsack problem generalized assignment problem polygonal environment constraint satisfaction problems metric labeling problem formal investigation module privacy pairwise comparisons combinatorics

Video Presentations

Notable Scholarly Works

Notable Federal Grants

Collaborators

A Faster Combinatorial Algorithm for Maximum Bipartite Matching. Society for Industrial and Applied Mathematics eBooks (2024)

Julia ChuzhoySanjeev Khanna

maximum bipartite matchingengineeringapplied mathematicscombinatorial algorithm

Code Sparsification and Its Applications. Society for Industrial and Applied Mathematics eBooks (2024)

Sanjeev KhannaAaron (Louie) PuttermanMadhu Sudan

code sparsificationapplied mathematicscryptographymathematics

Maximum Bipartite Matching in 𝑛 2+𝑜(1) Time via a Combinatorial Algorithm. (2024)

Julia ChuzhoySanjeev Khanna

maximum bipartite matchingapplied mathematicsmachine learningcombinatorial algorithm

Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers. arXiv (Cornell University) (2024)

Sanjeev KhannaAaron PuttermanMadhu Sudan

graph theoryhypergraph theoryengineeringhypergraph cut sparsifierselectrical engineeringapplied mathematics

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. Society for Industrial and Applied Mathematics eBooks (2024)

Arpit AgarwalSanjeev KhannaHuan LiPrathamesh PatilChen WangNathan WhitePeilin Zhong

polylogarithmic depthsystems engineeringengineeringfluid dynamicsnear-linear workapplied mathematics

A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection. SIAM Journal on Computing (2023)

Deeparnab ChakrabartyYu ChenSanjeev Khanna

computer sciencematroid intersectionpolynomial lower boundparallel computingcomputational optimization

On Regularity Lemma and Barriers in Streaming and Dynamic Matching. (2023)

Sepehr AssadiSoheil BehnezhadSanjeev KhannaHuan Li

dynamic matchingstreaming datastreaming algorithmsregularity lemmadata streamsapplied mathematicsmachine learning

Query Complexity of the Metric Steiner Tree Problem. Society for Industrial and Applied Mathematics eBooks (2023)

Yu ChenSanjeev KhannaZihan Tan

mathematical optimizationquery complexitymathematical logiccombinatorial optimizationengineeringapplied algebraapplied mathematics

Set Cover in the One-Pass Edge-Arrival Streaming Model. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2023)

Sanjeev KhannaChristian KonradCezar-Mihail Alexandru

wireless communicationssystems engineeringstreaming datadistributed systemsmobile computingedge computingvehicular technology

A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization. IEEE Annual Symposium on Foundations of Computer Science (2022)

Deeparnab ChakrabartyYu ChenSanjeev Khanna

parallel computingapplied mathematicspolynomial lower bound

1
2
3
4
5
21
10 / page

Sanjeev Khanna

Henry Salvatori Professor of Computer and Information Science

University of Pennsylvania

Affiliations

School of Engineering and Applied Science

Computer and Information Science

Sanjeev Khanna is currently serving as a Computer And Information Science Henry Salvatori Professor of Computer and Information Science at University of Pennsylvania.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Sanjeev Khanna

University of Pennsylvania

Henry Salvatori Professor of Computer and Information Science

You can click a keyword to filter the displayed items

Video Presentations

Notable Scholarly Works

Notable Federal Grants

Collaborators

A Faster Combinatorial Algorithm for Maximum Bipartite Matching. Society for Industrial and Applied Mathematics eBooks (2024)

Julia ChuzhoySanjeev Khanna

maximum bipartite matchingengineeringapplied mathematicscombinatorial algorithm

Code Sparsification and Its Applications. Society for Industrial and Applied Mathematics eBooks (2024)

Sanjeev KhannaAaron (Louie) PuttermanMadhu Sudan

code sparsificationapplied mathematicscryptographymathematics

Maximum Bipartite Matching in 𝑛 2+𝑜(1) Time via a Combinatorial Algorithm. (2024)

Julia ChuzhoySanjeev Khanna

maximum bipartite matchingapplied mathematicsmachine learningcombinatorial algorithm

Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers. arXiv (Cornell University) (2024)

Sanjeev KhannaAaron PuttermanMadhu Sudan

graph theoryhypergraph theoryengineeringhypergraph cut sparsifierselectrical engineeringapplied mathematics

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. Society for Industrial and Applied Mathematics eBooks (2024)

Arpit AgarwalSanjeev KhannaHuan LiPrathamesh PatilChen WangNathan WhitePeilin Zhong

polylogarithmic depthsystems engineeringengineeringfluid dynamicsnear-linear workapplied mathematics

A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection. SIAM Journal on Computing (2023)

Deeparnab ChakrabartyYu ChenSanjeev Khanna

computer sciencematroid intersectionpolynomial lower boundparallel computingcomputational optimization

On Regularity Lemma and Barriers in Streaming and Dynamic Matching. (2023)

Sepehr AssadiSoheil BehnezhadSanjeev KhannaHuan Li

dynamic matchingstreaming datastreaming algorithmsregularity lemmadata streamsapplied mathematicsmachine learning

Query Complexity of the Metric Steiner Tree Problem. Society for Industrial and Applied Mathematics eBooks (2023)

Yu ChenSanjeev KhannaZihan Tan

mathematical optimizationquery complexitymathematical logiccombinatorial optimizationengineeringapplied algebraapplied mathematics

Set Cover in the One-Pass Edge-Arrival Streaming Model. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2023)

Sanjeev KhannaChristian KonradCezar-Mihail Alexandru

wireless communicationssystems engineeringstreaming datadistributed systemsmobile computingedge computingvehicular technology

A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization. IEEE Annual Symposium on Foundations of Computer Science (2022)

Deeparnab ChakrabartyYu ChenSanjeev Khanna

parallel computingapplied mathematicspolynomial lower bound

1
2
3
4
5
21
10 / page

Similar Faculty Members

Ding-Zhu Du

Institution

University of Texas at Dallas

electrical engineering

software engineering education

Samir Khuller

Institution

Northwestern University

computer science

applied mathematics

Anupam Gupta

Institution

New York University

computational optimization

mathematical optimization

Weili Wu

Institution

University of Texas at Dallas

data management

pattern mining

Ming-Yang Kao

Institution

Northwestern University

computer science

applied mathematics

Yingshu Li

Institution

Georgia State University

computer science

systems engineering

Aravind Srinivasan

Institution

University of Maryland, College Park

computer science

applied mathematics

Michael D. Mitzenmacher

Institution

Harvard University

computer science

machine learning

Stephen Kobourov

Institution

University of Arizona

algorithm design

discrete algorithm

Stephan Olariu

Institution

Old Dominion University

mobile communication vehicle

system safety

Similar Faculty Members

Ding-Zhu Du

Institution

University of Texas at Dallas

electrical engineering

software engineering education

Samir Khuller

Institution

Northwestern University

computer science

applied mathematics

Anupam Gupta

Institution

New York University

computational optimization

mathematical optimization

Weili Wu

Institution

University of Texas at Dallas

data management

pattern mining

Ming-Yang Kao

Institution

Northwestern University

computer science

applied mathematics

Yingshu Li

Institution

Georgia State University

computer science

systems engineering

Aravind Srinivasan

Institution

University of Maryland, College Park

computer science

applied mathematics

Michael D. Mitzenmacher

Institution

Harvard University

computer science

machine learning

Stephen Kobourov

Institution

University of Arizona

algorithm design

discrete algorithm

Stephan Olariu

Institution

Old Dominion University

mobile communication vehicle

system safety