default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanjeev Khanna
Person information
- affiliation: University of Pennsylvania, Philadelphia, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c177]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. ICALP 2024: 98:1-98:17- [c176]Julia Chuzhoy, Sanjeev Khanna:
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. SODA 2024: 2185-2235 - [c175]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 - [c174]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Code Sparsification and its Applications. SODA 2024: 5145-5168 - [c173]Julia Chuzhoy
, Sanjeev Khanna:
Maximum Bipartite Matching in n2+o(1) Time via a Combinatorial Algorithm. STOC 2024: 83-94 - [i69]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. CoRR abs/2402.13151 (2024) - [i68]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) - [i67]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Characterizations of Sparsifiability for Affine CSPs and Symmetric CSPs. CoRR abs/2404.06327 (2024) - [i66]Julia Chuzhoy, Sanjeev Khanna:
Maximum Bipartite Matching in n2+o(1) Time via a Combinatorial Algorithm. CoRR abs/2405.20861 (2024) - [i65]Sepehr Assadi, Sanjeev Khanna:
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs. CoRR abs/2406.13573 (2024) - [i64]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers. CoRR abs/2407.03934 (2024) - 2023
- [c172]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 - [c171]Sanjeev Khanna, Christian Konrad, Cezar-Mihail Alexandru:
Set Cover in the One-pass Edge-arrival Streaming Model. PODS 2023: 127-139 - [c170]Yu Chen, Sanjeev Khanna, Zihan Tan:
Query Complexity of the Metric Steiner Tree Problem. SODA 2023: 4893-4935 - [c169]Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li:
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. STOC 2023: 131-144 - [i63]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Code Sparsification and its Applications. CoRR abs/2311.00788 (2023) - [i62]Julia Chuzhoy, Sanjeev Khanna:
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. CoRR abs/2312.12584 (2023) - 2022
- [c168]Arpit Agarwal, Sanjeev Khanna, Prathamesh Patil:
PAC Top-k Identification under SST in Limited Rounds. AISTATS 2022: 6814-6839 - [c167]Arpit Agarwal, Sanjeev Khanna, Prathamesh Patil:
A Sharp Memory-Regret Trade-off for Multi-Pass Streaming Bandits. COLT 2022: 1423-1462 - [c166]Yu Chen, Sanjeev Khanna, Huan Li:
On Weighted Graph Sparsification by Linear Sketching. FOCS 2022: 474-485 - [c165]Sanjeev Khanna, Christian Konrad:
Optimal Bounds for Dominating Set in Graph Streams. ITCS 2022: 93:1-93:23 - [c164]Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil:
Sublinear Algorithms for Hierarchical Clustering. NeurIPS 2022 - [c163]Soheil Behnezhad, Sanjeev Khanna:
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. SODA 2022: 3529-3566 - [c162]Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
Nearly Tight Bounds for Discrete Search under Outlier Noise. SOSA 2022: 161-173 - [i61]Soheil Behnezhad, Sanjeev Khanna:
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. CoRR abs/2201.02905 (2022) - [i60]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) - [i59]Arpit Agarwal, Sanjeev Khanna, Prathamesh Patil:
A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits. CoRR abs/2205.00984 (2022) - [i58]Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil:
Sublinear Algorithms for Hierarchical Clustering. CoRR abs/2206.07633 (2022) - [i57]Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li:
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR abs/2207.09354 (2022) - [i56]Yu Chen, Sanjeev Khanna, Huan Li:
On Weighted Graph Sparsification by Linear Sketching. CoRR abs/2209.07729 (2022) - [i55]Yu Chen, Sanjeev Khanna, Zihan Tan:
Query Complexity of the Metric Steiner Tree Problem. CoRR abs/2211.03893 (2022) - 2021
- [j56]Deeparnab Chakrabarty, Sanjeev Khanna:
Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling. Math. Program. 188(1): 395-407 (2021) - [j55]Sepehr Assadi, Sanjeev Khanna, Yang Li:
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem. SIAM J. Comput. 50(3) (2021) - [c161]Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna:
Graph Connectivity and Single Element Recovery via Linear and OR Queries. ESA 2021: 7:1-7:19 - [c160]Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna:
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization. FOCS 2021: 37-48 - [c159]Yu Chen, Sanjeev Khanna, Ansh Nagda:
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries. ICALP 2021: 53:1-53:21 - [c158]Anindya De, Sanjeev Khanna, Huan Li, MohammadHesam NikpeySalekde:
Approximate optimization of convex functions with outlier noise. NeurIPS 2021: 8147-8157 - [c157]Naveen Garg, Sanjeev Khanna, Amit Kumar:
Hardness of Approximation for Orienteering with Multiple Time Windows. SODA 2021: 2977-2990 - [i54]Yu Chen, Sanjeev Khanna, Ansh Nagda:
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries. CoRR abs/2106.10386 (2021) - [i53]Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna:
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection. CoRR abs/2111.07474 (2021) - 2020
- [j54]Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra:
A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs. ACM Trans. Algorithms 16(1): 2:1-2:30 (2020) - [c156]Yu Chen, Sanjeev Khanna, Ansh Nagda:
Near-linear Size Hypergraph Cut Sparsifiers. FOCS 2020: 61-72 - [c155]Yu Chen, Sampath Kannan, Sanjeev Khanna:
Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation. ICALP 2020: 30:1-30:19 - [c154]Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. ICALP 2020: 37:1-37:18 - [c153]Arpit Agarwal, Shivani Agarwal, Sanjeev Khanna, Prathamesh Patil:
Rank Aggregation from Pairwise Comparisons in the Presence of Adversarial Corruptions. ICML 2020: 85-95 - [c152]Rajeev Alur, Yu Chen, Kishor Jothimurugan, Sanjeev Khanna:
Space-efficient Query Evaluation over Probabilistic Event Streams. LICS 2020: 74-87 - [c151]Yu Chen, Sampath Kannan, Sanjeev Khanna:
Near-Perfect Recovery in the One-Dimensional Latent Space Model. WWW 2020: 1932-1942 - [i52]Yu Chen, Sampath Kannan, Sanjeev Khanna:
Near-Perfect Recovery in the One-Dimensional Latent Space Model. CoRR abs/2006.04351 (2020) - [i51]Yu Chen, Sampath Kannan, Sanjeev Khanna:
Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation. CoRR abs/2006.05490 (2020) - [i50]Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey:
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. CoRR abs/2006.12670 (2020) - [i49]Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna:
Graph Connectivity and Single Element Recovery via Linear and OR Queries. CoRR abs/2007.06098 (2020) - [i48]Yu Chen, Sanjeev Khanna, Ansh Nagda:
Near-linear Size Hypergraph Cut Sparsifiers. CoRR abs/2009.04992 (2020)
2010 – 2019
- 2019
- [j53]Ashish Goel, Michael Kapralov, Sanjeev Khanna:
Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs. Comb. 39(2): 323-354 (2019) - [j52]Sepehr Assadi, Sanjeev Khanna, Yang Li:
The Stochastic Matching Problem with (Very) Few Queries. ACM Trans. Economics and Comput. 7(3): 16:1-16:19 (2019) - [c150]Yu Chen, Shahin Jabbari, Michael J. Kearns, Sanjeev Khanna, Jamie Morgenstern:
Network Formation under Random Attack and Probabilistic Spread. IJCAI 2019: 180-186 - [c149]Sepehr Assadi, Michael Kapralov, Sanjeev Khanna:
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. ITCS 2019: 6:1-6:20 - [c148]Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna:
Stochastic Submodular Cover with Limited Adaptivity. SODA 2019: 323-342 - [c147]Sepehr Assadi, Yu Chen, Sanjeev Khanna:
Sublinear Algorithms for (Δ + 1) Vertex Coloring. SODA 2019: 767-786 - [c146]Sepehr Assadi, Yu Chen, Sanjeev Khanna:
Polynomial pass lower bounds for graph streaming algorithms. STOC 2019: 265-276 - [c145]Julia Chuzhoy, Sanjeev Khanna:
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems. STOC 2019: 389-400 - [i47]Sepehr Assadi, Yu Chen, Sanjeev Khanna:
Polynomial Pass Lower Bounds for Graph Streaming Algorithms. CoRR abs/1904.04720 (2019) - [i46]Julia Chuzhoy, Sanjeev Khanna:
A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems. CoRR abs/1905.11512 (2019) - [i45]Yu Chen, Shahin Jabbari, Michael J. Kearns, Sanjeev Khanna, Jamie Morgenstern:
Network Formation under Random Attack and Probabilistic Spread. CoRR abs/1906.00241 (2019) - 2018
- [c144]Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres:
Testing Graph Clusterability: Algorithms and Lower Bounds. FOCS 2018: 497-508 - [c143]Deeparnab Chakrabarty, Sanjeev Khanna:
Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling. SOSA 2018: 4:1-4:11 - [c142]Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra:
A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs. SODA 2018: 457-476 - [c141]Sepehr Assadi, Sanjeev Khanna:
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. SODA 2018: 2412-2431 - [i44]Deeparnab Chakrabarty, Sanjeev Khanna:
Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling. CoRR abs/1801.02790 (2018) - [i43]Sepehr Assadi, Sanjeev Khanna:
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. CoRR abs/1801.02793 (2018) - [i42]Sepehr Assadi, Yu Chen, Sanjeev Khanna:
Sublinear Algorithms for (Δ+ 1) Vertex Coloring. CoRR abs/1807.08886 (2018) - [i41]Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres:
Testing Graph Clusterability: Algorithms and Lower Bounds. CoRR abs/1808.04807 (2018) - [i40]Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna:
Stochastic Submodular Cover with Limited Adaptivity. CoRR abs/1810.13351 (2018) - [i39]Sepehr Assadi, Michael Kapralov, Sanjeev Khanna:
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. CoRR abs/1811.07780 (2018) - 2017
- [j51]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A greedy approximation algorithm for minimum-gap scheduling. J. Sched. 20(3): 279-292 (2017) - [j50]Sepehr Assadi, Sanjeev Khanna, Yang Li, Rakesh Vohra:
Fast Convergence in the Double Oral Auction. ACM Trans. Economics and Comput. 5(4): 20:1-20:18 (2017) - [c140]Arpit Agarwal, Shivani Agarwal, Sepehr Assadi, Sanjeev Khanna:
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons. COLT 2017: 39-75 - [c139]Konstantinos Mamouras, Mukund Raghothaman, Rajeev Alur, Zachary G. Ives, Sanjeev Khanna:
StreamQRE: modular specification and efficient evaluation of quantitative queries over streaming data. PLDI 2017: 693-708 - [c138]Sepehr Assadi, Sanjeev Khanna, Yang Li:
The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm. EC 2017: 99-116 - [c137]Michael Kapralov, Sanjeev Khanna, Madhu Sudan, Ameya Velingker:
(1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space. SODA 2017: 1703-1722 - [c136]Sepehr Assadi, Sanjeev Khanna, Yang Li:
On Estimating Maximum Matching Size in Graph Streams. SODA 2017: 1723-1742 - [c135]Sepehr Assadi, Sanjeev Khanna:
Randomized Composable Coresets for Matching and Vertex Cover. SPAA 2017: 3-12 - [i38]Sepehr Assadi, Sanjeev Khanna, Yang Li:
On Estimating Maximum Matching Size in Graph Streams. CoRR abs/1701.04364 (2017) - [i37]Sepehr Assadi, Sanjeev Khanna, Yang Li:
The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm. CoRR abs/1705.02280 (2017) - [i36]Sepehr Assadi, Sanjeev Khanna:
Randomized Composable Coresets for Matching and Vertex Cover. CoRR abs/1705.08242 (2017) - 2016
- [j49]Brett Hemenway, Sanjeev Khanna:
Sensitivity and computational complexity in financial networks. Algorithmic Finance 5(3-4): 95-110 (2016) - [j48]Johannes Starlinger, Sarah Cohen Boulakia, Sanjeev Khanna, Susan B. Davidson, Ulf Leser:
Effective and efficient similarity search in scientific workflow repositories. Future Gener. Comput. Syst. 56: 584-594 (2016) - [c134]Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen:
Algorithms for Provisioning Queries and Analytics. ICDT 2016: 18:1-18:18 - [c133]Alexander J. T. Gurney, Sanjeev Khanna, Yang Li:
Rapid convergence versus policy expressiveness in interdomain routing. INFOCOM 2016: 1-9 - [c132]Sepehr Assadi, Sanjeev Khanna, Yang Li:
The Stochastic Matching Problem with (Very) Few Queries. EC 2016: 43-60 - [c131]Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev:
Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. SODA 2016: 1345-1364 - [c130]Sepehr Assadi, Sanjeev Khanna, Yang Li:
Tight bounds for single-pass streaming complexity of the set cover problem. STOC 2016: 698-711 - [c129]Sanjeev Goyal, Shahin Jabbari, Michael J. Kearns, Sanjeev Khanna, Jamie Morgenstern:
Strategic Network Formation with Attack and Immunization. WINE 2016: 429-443 - [p1]Michael B. Greenwald, Sanjeev Khanna:
Quantiles and Equi-depth Histograms over Streams. Data Stream Management 2016: 45-86 - [i35]Sepehr Assadi, Sanjeev Khanna, Yang Li:
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem. CoRR abs/1603.05715 (2016) - 2015
- [j47]Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
Approximability of Capacitated Network Design. Algorithmica 72(2): 493-514 (2015) - [j46]Michael Brautbar, Moez Draief, Sanjeev Khanna:
On the Power of Planned Infections in Networks. Internet Math. 11(4-5): 319-332 (2015) - [c128]Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen:
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches. FSTTCS 2015: 52-68 - [c127]Yannis Mantzouratos, Tarik Tosun, Sanjeev Khanna, Mark Yim:
On embeddability of modular robot designs. ICRA 2015: 1911-1918 - [c126]Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li:
On (1, ∊)-Restricted Assignment Makespan Minimization. SODA 2015: 1087-1101 - [c125]Michael Kapralov, Sanjeev Khanna, Madhu Sudan:
Streaming Lower Bounds for Approximating MAX-CUT. SODA 2015: 1263-1282 - [c124]Ashish Goel, Sanjeev Khanna, Sharath Raghvendra, Hongyang Zhang:
Connectivity in Random Forests and Credit Networks. SODA 2015: 2037-2048 - [c123]Sepehr Assadi, Sanjeev Khanna, Yang Li, Rakesh V. Vohra:
Fast Convergence in the Double Oral Auction. WINE 2015: 60-73 - [i34]Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev:
Tight Bounds for Linear Sketches of Approximate Matchings. CoRR abs/1505.01467 (2015) - [i33]Sepehr Assadi, Sanjeev Khanna, Yang Li, Rakesh Vohra:
Fast Convergence in the Double Oral Auction. CoRR abs/1510.00086 (2015) - [i32]Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen:
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches. CoRR abs/1510.03252 (2015) - [i31]Sanjeev Goyal, Shahin Jabbari, Michael J. Kearns, Sanjeev Khanna, Jamie Morgenstern:
Strategic Network Formation with Attack and Immunization. CoRR abs/1511.05196 (2015) - [i30]Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen:
Algorithms for Provisioning Queries and Analytics. CoRR abs/1512.06143 (2015) - 2014
- [j45]Susan B. Davidson, Sanjeev Khanna, Tova Milo, Sudeepa Roy:
Top-k and Clustering with Noisy Comparisons. ACM Trans. Database Syst. 39(4): 35:1-35:39 (2014) - [c122]Justin Hsu, Marco Gaboardi, Andreas Haeberlen, Sanjeev Khanna, Arjun Narayan, Benjamin C. Pierce, Aaron Roth:
Differential Privacy: An Economic Method for Choosing Epsilon. CSF 2014: 398-410 - [c121]Johannes Starlinger, Sarah Cohen Boulakia, Sanjeev Khanna, Susan B. Davidson, Ulf Leser:
Layer Decomposition: An Effective Structure-Based Approach for Scientific Workflow Similarity. eScience 2014: 169-176 - [c120]Anand Bhalgat, Sanjeev Khanna:
A Utility Equivalence Theorem for Concave Functions. IPCO 2014: 126-137 - [c119]Sanjeev Khanna:
Matchings, Random Walks, and Sampling. LATA 2014: 32-33 - [c118]Ahmed Hefny, Robert E. Kass, Sanjeev Khanna, Matthew A. Smith, Geoffrey J. Gordon:
Fast and Improved SLEX Analysis of High-Dimensional Time Series. MLINI@NIPS 2014: 94-103 - [c117]Michael Kapralov, Sanjeev Khanna, Madhu Sudan:
Approximating matching size from random streams. SODA 2014: 734-751 - [c116]Ashish Goel, Sanjeev Khanna, Daniel H. Larkin, Robert Endre Tarjan:
Disjoint Set Union with Randomized Linking. SODA 2014: 1005-1017 - [c115]Sanjeev Khanna, Brendan Lucier:
Influence Maximization in Undirected Networks. SODA 2014: 1482-1496 - [i29]Justin Hsu, Marco Gaboardi, Andreas Haeberlen, Sanjeev Khanna, Arjun Narayan, Benjamin C. Pierce, Aaron Roth:
Differential Privacy: An Economic Method for Choosing Epsilon. CoRR abs/1402.3329 (2014) - [i28]Michael Kapralov, Sanjeev Khanna, Madhu Sudan:
Streaming Lower Bounds for Approximating MAX-CUT. CoRR abs/1409.2138 (2014) - [i27]Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li:
On $(1, ε)$-Restricted Assignment Makespan Minimization. CoRR abs/1410.7506 (2014) - 2013
- [j44]Ashish Goel, Michael Kapralov, Sanjeev Khanna:
Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs. SIAM J. Comput. 42(3): 1392-1404 (2013) - [j43]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
The All-or-Nothing Multicommodity Flow Problem. SIAM J. Comput. 42(4): 1467-1493 (2013) - [j42]Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna:
Dynamic and Nonuniform Pricing Strategies for Revenue Maximization. SIAM J. Comput. 42(6): 2424-2451 (2013) - [c114]Susan B. Davidson, Sanjeev Khanna, Tova Milo:
To Show or Not to Show in Workflow Provenance. In Search of Elegance in the Theory and Practice of Computation 2013: 217-226 - [c113]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A Greedy Approximation Algorithm for Minimum-Gap Scheduling. CIAC 2013: 97-109 - [c112]Susan B. Davidson, Sanjeev Khanna, Tova Milo, Sudeepa Roy:
Using the crowd for top-k and group-by queries. ICDT 2013: 225-236 - [c111]Michael Brautbar, Moez Draief, Sanjeev Khanna:
On the Power of Adversarial Infections in Networks. WAW 2013: 44-55 - [e2]