default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Sanjeev Khanna
University of Pennsylvania, Philadelphia, PA, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 314 matches
- 2024
- Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. ICALP 2024: 98:1-98:17 - Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong:
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. SODA 2024: 3997-4061 - Julia Chuzhoy, Sanjeev Khanna:
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. SODA 2024: 2185-2235 - Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Code Sparsification and its Applications. SODA 2024: 5145-5168 - Julia Chuzhoy, Sanjeev Khanna:
Maximum Bipartite Matching in n2+o(1) Time via a Combinatorial Algorithm. STOC 2024: 83-94 - Harkeerat Kaur, Vinit Jakhetiya, Puneet Goyal, Pritee Khanna, Balasubramanian Raman, Sanjeev Kumar:
Computer Vision and Image Processing - 8th International Conference, CVIP 2023, Jammu, India, November 3-5, 2023, Revised Selected Papers, Part I. Communications in Computer and Information Science 2009, Springer 2024, ISBN 978-3-031-58180-9 [contents] - Harkeerat Kaur, Vinit Jakhetiya, Puneet Goyal, Pritee Khanna, Balasubramanian Raman, Sanjeev Kumar:
Computer Vision and Image Processing - 8th International Conference, CVIP 2023, Jammu, India, November 3-5, 2023, Revised Selected Papers, Part II. Communications in Computer and Information Science 2010, Springer 2024, ISBN 978-3-031-58173-1 [contents] - Harkeerat Kaur, Vinit Jakhetiya, Puneet Goyal, Pritee Khanna, Balasubramanian Raman, Sanjeev Kumar:
Computer Vision and Image Processing - 8th International Conference, CVIP 2023, Jammu, India, November 3-5, 2023, Revised Selected Papers, Part III. Communications in Computer and Information Science 2011, Springer 2024, ISBN 978-3-031-58534-0 [contents] - Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. CoRR abs/2402.13151 (2024) - Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong:
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. CoRR abs/2402.14950 (2024) - Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Characterizations of Sparsifiability for Affine CSPs and Symmetric CSPs. CoRR abs/2404.06327 (2024) - Julia Chuzhoy, Sanjeev Khanna:
Maximum Bipartite Matching in n2+o(1) Time via a Combinatorial Algorithm. CoRR abs/2405.20861 (2024) - Sepehr Assadi, Sanjeev Khanna:
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs. CoRR abs/2406.13573 (2024) - Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers. CoRR abs/2407.03934 (2024) - 2023
- Yu Chen, Sanjeev Khanna, Zihan Tan:
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. ICALP 2023: 37:1-37:16 - Sanjeev Khanna, Christian Konrad, Cezar-Mihail Alexandru:
Set Cover in the One-pass Edge-arrival Streaming Model. PODS 2023: 127-139 - Yu Chen, Sanjeev Khanna, Zihan Tan:
Query Complexity of the Metric Steiner Tree Problem. SODA 2023: 4893-4935 - Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li:
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. STOC 2023: 131-144 - Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Code Sparsification and its Applications. CoRR abs/2311.00788 (2023) - Julia Chuzhoy, Sanjeev Khanna:
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. CoRR abs/2312.12584 (2023) - 2022
- Arpit Agarwal, Sanjeev Khanna, Prathamesh Patil:
PAC Top-k Identification under SST in Limited Rounds. AISTATS 2022: 6814-6839 - Arpit Agarwal, Sanjeev Khanna, Prathamesh Patil:
A Sharp Memory-Regret Trade-off for Multi-Pass Streaming Bandits. COLT 2022: 1423-1462 - Yu Chen, Sanjeev Khanna, Huan Li:
On Weighted Graph Sparsification by Linear Sketching. FOCS 2022: 474-485 - Sanjeev Khanna, Christian Konrad:
Optimal Bounds for Dominating Set in Graph Streams. ITCS 2022: 93:1-93:23 - Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil:
Sublinear Algorithms for Hierarchical Clustering. NeurIPS 2022 - Soheil Behnezhad, Sanjeev Khanna:
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. SODA 2022: 3529-3566 - Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
Nearly Tight Bounds for Discrete Search under Outlier Noise. SOSA 2022: 161-173 - Soheil Behnezhad, Sanjeev Khanna:
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. CoRR abs/2201.02905 (2022) - Yu Chen, Sanjeev Khanna, Zihan Tan:
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. CoRR abs/2203.14798 (2022) - Arpit Agarwal, Sanjeev Khanna, Prathamesh Patil:
A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits. CoRR abs/2205.00984 (2022)
skipping 284 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-02 07:39 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint