Sanjeev Khanna

College of Central Florida — United States

Computer Science · Physical Sciences

53h-index11.2kcitations338works0.72yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(140), Optimization and Search Problems(106), Advanced Graph Theory Research(76), Privacy-Preserving Technologies in Data(24), Distributed systems and fault tolerance(20)

Publications337 total

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
arXiv (Cornell University)·2025Open Access
Graph Contrastive Learning versus Untrained Baselines: The Role of Dataset Size
arXiv (Cornell University)·2025Open Access
On the Parallel Complexity of Finding a Matroid Basis
arXiv (Cornell University)·2025Open Access
Development of a Chaos Theory-Based Digital Image Encryption Algorithm for Enhanced Security in Modern Applications
International Academic Journal of Science and Engineering·2025Open Access
Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
2025
Efficient Algorithms and New Characterizations for CSP Sparsification
2025
Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
2025
Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
arXiv (Cornell University)·2025Open Access
Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
arXiv (Cornell University)·2025Open Access
A Theory of Spectral CSP Sparsification
ArXiv.org·2025Open Access
Near-Optimal Hypergraph Sparsification in Insertion-Only and Bounded-Deletion Streams
arXiv (Cornell University)·2025Open Access
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs
Society for Industrial and Applied Mathematics eBooks·2025· 1 cited
Improved Approximation Algorithms for Flexible Graph Connectivity and Capacitated Network Design
arXiv (Cornell University)·2024Open Access
Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
2024· 2 cited
Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
arXiv (Cornell University)·2024· 1 citedOpen Access
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
arXiv (Cornell University)·2024· 1 citedOpen Access
Maximum Bipartite Matching in 𝑛 <sup>2+𝑜(1)</sup> Time via a Combinatorial Algorithm
2024· 2 citedOpen Access
Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
arXiv (Cornell University)·2024Open Access
Efficient Algorithms and New Characterizations for CSP Sparsification
arXiv (Cornell University)·2024Open Access
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
arXiv (Cornell University)·2024Open Access
page 1 of 17Next →

Frequent Co-authors

Chandra Chekuri(12), F. Bruce Shepherd(6), Peter Buneman(5), Madhu Sudan(4), Susan B. Davidson(4), Julia Chuzhoy(4), Michael B. Greenwald(3), Wang-Chiew Tan(3), Volkan Isler(3), Sudeepa Roy(3), Benjamin C. Pierce(2), David P. Williamson(2), Venkatesan Guruswami(2), Rajmohan Rajaraman(2), Mihalis Yannakakis(2), Keishi Tajima(2), Tova Milo(2), Joseph Naor(2), Leonid Zosin(2), Rajeev Motwani(2)