Sanjeev Khanna
University of Pennsylvania, Philadelphia, PA, USA
http://www.cis.upenn.edu/~sanjeev/
https://scholar.google.com/citations?user=HriWXcEAAAAJ
https://en.wikipedia.org/wiki/Sanjeev_Khanna
https://www.wikidata.org/entity/Q16221572
https://id.loc.gov/authorities/names/n00006263
Sanjeev Khanna
Aaron L. Putterman
Madhu Sudan 0001
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs.
2024
abs/2402.13151
CoRR
https://doi.org/10.48550/arXiv.2402.13151
db/journals/corr/corr2402.html#abs-2402-13151
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.
2024
abs/2402.14950
CoRR
https://doi.org/10.48550/arXiv.2402.14950
db/journals/corr/corr2402.html#abs-2402-14950
Yu Chen 0039
Sanjeev Khanna
Zihan Tan
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics.
37:1-37:16
2023
ICALP
https://doi.org/10.4230/LIPIcs.ICALP.2023.37
conf/icalp/2023
db/conf/icalp/icalp2023.html#0039KT23
Sanjeev Khanna
Christian Konrad 0001
Cezar-Mihail Alexandru
Set Cover in the One-pass Edge-arrival Streaming Model.
127-139
2023
PODS
https://doi.org/10.1145/3584372.3588678
conf/pods/2023
db/conf/pods/pods2023.html#Khanna0A23
Yu Chen 0039
Sanjeev Khanna
Zihan Tan
Query Complexity of the Metric Steiner Tree Problem.
4893-4935
2023
SODA
https://doi.org/10.1137/1.9781611977554.ch179
conf/soda/2023
db/conf/soda/soda2023.html#0039KT23
Sepehr Assadi
Soheil Behnezhad
Sanjeev Khanna
Huan Li
On Regularity Lemma and Barriers in Streaming and Dynamic Matching.
131-144
2023
STOC
https://doi.org/10.1145/3564246.3585110
conf/stoc/2023
db/conf/stoc/stoc2023.html#AssadiBKL23
Sanjeev Khanna
Aaron L. Putterman
Madhu Sudan 0001
Code Sparsification and its Applications.
2023
abs/2311.00788
CoRR
https://doi.org/10.48550/arXiv.2311.00788
db/journals/corr/corr2311.html#abs-2311-00788
Julia Chuzhoy
Sanjeev Khanna
A Faster Combinatorial Algorithm for Maximum Bipartite Matching.
2023
abs/2312.12584
CoRR
https://doi.org/10.48550/arXiv.2312.12584
db/journals/corr/corr2312.html#abs-2312-12584
Arpit Agarwal
Sanjeev Khanna
Prathamesh Patil
PAC Top-k Identification under SST in Limited Rounds.
6814-6839
2022
AISTATS
https://proceedings.mlr.press/v151/agarwal22a.html
conf/aistats/2022
db/conf/aistats/aistats2022.html#AgarwalKP22
Arpit Agarwal
Sanjeev Khanna
Prathamesh Patil
A Sharp Memory-Regret Trade-off for Multi-Pass Streaming Bandits.
1423-1462
2022
COLT
https://proceedings.mlr.press/v178/agarwal22a.html
conf/colt/2022
db/conf/colt/colt2022.html#AgarwalKP22
Yu Chen 0039
Sanjeev Khanna
Huan Li
On Weighted Graph Sparsification by Linear Sketching.
474-485
2022
conf/focs/2022
FOCS
https://doi.org/10.1109/FOCS54457.2022.00052
db/conf/focs/focs2022.html#ChenKL22
Sanjeev Khanna
Christian Konrad 0001
Optimal Bounds for Dominating Set in Graph Streams.
93:1-93:23
2022
ITCS
https://doi.org/10.4230/LIPIcs.ITCS.2022.93
conf/innovations/2022
db/conf/innovations/innovations2022.html#KhannaK22
Arpit Agarwal
Sanjeev Khanna
Huan Li
Prathamesh Patil
Sublinear Algorithms for Hierarchical Clustering.
2022
conf/nips/2022
NeurIPS
http://papers.nips.cc/paper_files/paper/2022/hash/16466b6c95c5924784486ac5a3feeb65-Abstract-Conference.html
db/conf/nips/neurips2022.html#AgarwalKLP22
Soheil Behnezhad
Sanjeev Khanna
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS.
3529-3566
2022
SODA
https://doi.org/10.1137/1.9781611977073.140
conf/soda/2022
db/conf/soda/soda2022.html#BehnezhadK22
Anindya De
Sanjeev Khanna
Huan Li
Hesam Nikpey
Nearly Tight Bounds for Discrete Search under Outlier Noise.
161-173
2022
SOSA
https://doi.org/10.1137/1.9781611977066.11
conf/sosa/2022
db/conf/sosa/sosa2022.html#DeKLN22
Soheil Behnezhad
Sanjeev Khanna
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS.
2022
abs/2201.02905
CoRR
https://arxiv.org/abs/2201.02905
db/journals/corr/corr2201.html#abs-2201-02905
Yu Chen 0039
Sanjeev Khanna
Zihan Tan
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics.
2022
abs/2203.14798
CoRR
https://doi.org/10.48550/arXiv.2203.14798
db/journals/corr/corr2203.html#abs-2203-14798
Arpit Agarwal
Sanjeev Khanna
Prathamesh Patil
A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits.
2022
abs/2205.00984
CoRR
https://doi.org/10.48550/arXiv.2205.00984
db/journals/corr/corr2205.html#abs-2205-00984
Arpit Agarwal
Sanjeev Khanna
Huan Li
Prathamesh Patil
Sublinear Algorithms for Hierarchical Clustering.
2022
abs/2206.07633
CoRR
https://doi.org/10.48550/arXiv.2206.07633
db/journals/corr/corr2206.html#abs-2206-07633
Sepehr Assadi
Soheil Behnezhad
Sanjeev Khanna
Huan Li
On Regularity Lemma and Barriers in Streaming and Dynamic Matching.
2022
abs/2207.09354
CoRR
https://doi.org/10.48550/arXiv.2207.09354
db/journals/corr/corr2207.html#abs-2207-09354
Yu Chen 0039
Sanjeev Khanna
Huan Li
On Weighted Graph Sparsification by Linear Sketching.
2022
abs/2209.07729
CoRR
https://doi.org/10.48550/arXiv.2209.07729
db/journals/corr/corr2209.html#abs-2209-07729
Yu Chen 0039
Sanjeev Khanna
Zihan Tan
Query Complexity of the Metric Steiner Tree Problem.
2022
abs/2211.03893
CoRR
https://doi.org/10.48550/arXiv.2211.03893
db/journals/corr/corr2211.html#abs-2211-03893
Deeparnab Chakrabarty
Sanjeev Khanna
Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling.
395-407
2021
188
Math. Program.
1
https://doi.org/10.1007/s10107-020-01503-3
db/journals/mp/mp188.html#ChakrabartyK21
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem.
2021
50
SIAM J. Comput.
3
https://doi.org/10.1137/16M1095482
db/journals/siamcomp/siamcomp50.html#AssadiKL21
Sepehr Assadi
Deeparnab Chakrabarty
Sanjeev Khanna
Graph Connectivity and Single Element Recovery via Linear and OR Queries.
7:1-7:19
2021
ESA
https://doi.org/10.4230/LIPIcs.ESA.2021.7
conf/esa/2021
db/conf/esa/esa2021.html#AssadiCK21
Deeparnab Chakrabarty
Yu Chen 0039
Sanjeev Khanna
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization.
37-48
2021
FOCS
https://doi.org/10.1109/FOCS52979.2021.00013
conf/focs/2021
db/conf/focs/focs2021.html#ChakrabartyCK21
Yu Chen 0039
Sanjeev Khanna
Ansh Nagda
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries.
53:1-53:21
2021
ICALP
https://doi.org/10.4230/LIPIcs.ICALP.2021.53
conf/icalp/2021
db/conf/icalp/icalp2021.html#ChenKN21
Anindya De
Sanjeev Khanna
Huan Li
MohammadHesam NikpeySalekde
Approximate optimization of convex functions with outlier noise.
8147-8157
2021
NeurIPS
https://proceedings.neurips.cc/paper/2021/hash/44b422a6d1df1d47db5d50a8d0aaca5d-Abstract.html
conf/nips/2021
db/conf/nips/neurips2021.html#DeKLN21
Naveen Garg 0001
Sanjeev Khanna
Amit Kumar 0001
Hardness of Approximation for Orienteering with Multiple Time Windows.
2977-2990
2021
SODA
https://doi.org/10.1137/1.9781611976465.177
conf/soda/2021
db/conf/soda/soda2021.html#GargKK21
Yu Chen 0039
Sanjeev Khanna
Ansh Nagda
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries.
2021
abs/2106.10386
CoRR
https://arxiv.org/abs/2106.10386
db/journals/corr/corr2106.html#abs-2106-10386
Deeparnab Chakrabarty
Yu Chen 0039
Sanjeev Khanna
A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization and Matroid Intersection.
2021
abs/2111.07474
CoRR
https://arxiv.org/abs/2111.07474
db/journals/corr/corr2111.html#abs-2111-07474
Mudabir Kabir Asathulla
Sanjeev Khanna
Nathaniel Lahn
Sharath Raghvendra
A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs.
2:1-2:30
2020
16
ACM Trans. Algorithms
1
https://doi.org/10.1145/3365006
db/journals/talg/talg16.html#AsathullaKLR20
Yu Chen 0039
Sanjeev Khanna
Ansh Nagda
Near-linear Size Hypergraph Cut Sparsifiers.
61-72
2020
FOCS
https://doi.org/10.1109/FOCS46700.2020.00015
conf/focs/2020
db/conf/focs/focs2020.html#ChenKN20
Yu Chen 0039
Sampath Kannan
Sanjeev Khanna
Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation.
30:1-30:19
2020
ICALP
https://doi.org/10.4230/LIPIcs.ICALP.2020.30
conf/icalp/2020
db/conf/icalp/icalp2020.html#ChenKK20
Anindya De
Sanjeev Khanna
Huan Li
Hesam Nikpey
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs.
37:1-37:18
2020
ICALP
https://doi.org/10.4230/LIPIcs.ICALP.2020.37
conf/icalp/2020
db/conf/icalp/icalp2020.html#DeKLN20
Arpit Agarwal
Shivani Agarwal 0001
Sanjeev Khanna
Prathamesh Patil
Rank Aggregation from Pairwise Comparisons in the Presence of Adversarial Corruptions.
85-95
2020
ICML
http://proceedings.mlr.press/v119/agarwal20a.html
conf/icml/2020
db/conf/icml/icml2020.html#0001AKP20
Rajeev Alur
Yu Chen 0039
Kishor Jothimurugan
Sanjeev Khanna
Space-efficient Query Evaluation over Probabilistic Event Streams.
74-87
2020
LICS
https://doi.org/10.1145/3373718.3394747
conf/lics/2020
db/conf/lics/lics2020.html#AlurCJK20
Yu Chen 0039
Sampath Kannan
Sanjeev Khanna
Near-Perfect Recovery in the One-Dimensional Latent Space Model.
1932-1942
2020
WWW
https://doi.org/10.1145/3366423.3380261
conf/www/2020
db/conf/www/www2020.html#ChenKK20
Yu Chen 0039
Sampath Kannan
Sanjeev Khanna
Near-Perfect Recovery in the One-Dimensional Latent Space Model.
2020
abs/2006.04351
CoRR
https://arxiv.org/abs/2006.04351
db/journals/corr/corr2006.html#abs-2006-04351
Yu Chen 0039
Sampath Kannan
Sanjeev Khanna
Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation.
2020
abs/2006.05490
CoRR
https://arxiv.org/abs/2006.05490
db/journals/corr/corr2006.html#abs-2006-05490
Anindya De
Sanjeev Khanna
Huan Li
Hesam Nikpey
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs.
2020
abs/2006.12670
CoRR
https://arxiv.org/abs/2006.12670
db/journals/corr/corr2006.html#abs-2006-12670
Sepehr Assadi
Deeparnab Chakrabarty
Sanjeev Khanna
Graph Connectivity and Single Element Recovery via Linear and OR Queries.
2020
abs/2007.06098
CoRR
https://arxiv.org/abs/2007.06098
db/journals/corr/corr2007.html#abs-2007-06098
Yu Chen 0039
Sanjeev Khanna
Ansh Nagda
Near-linear Size Hypergraph Cut Sparsifiers.
2020
abs/2009.04992
CoRR
https://arxiv.org/abs/2009.04992
db/journals/corr/corr2009.html#abs-2009-04992
Ashish Goel
Michael Kapralov
Sanjeev Khanna
Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs.
323-354
2019
39
Comb.
2
https://doi.org/10.1007/s00493-015-2653-6
db/journals/combinatorica/combinatorica39.html#GoelKK19
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
The Stochastic Matching Problem with (Very) Few Queries.
16:1-16:19
2019
7
ACM Trans. Economics and Comput.
3
https://doi.org/10.1145/3355903
db/journals/teco/teco7.html#AssadiKL19
Yu Chen 0039
Shahin Jabbari
Michael J. Kearns
Sanjeev Khanna
Jamie Morgenstern
Network Formation under Random Attack and Probabilistic Spread.
2019
IJCAI
https://doi.org/10.24963/ijcai.2019/26
conf/ijcai/2019
db/conf/ijcai/ijcai2019.html#ChenJKKM19
180-186
Sepehr Assadi
Michael Kapralov
Sanjeev Khanna
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling.
6:1-6:20
2019
ITCS
https://doi.org/10.4230/LIPIcs.ITCS.2019.6
conf/innovations/2019
db/conf/innovations/innovations2019.html#AssadiKK19
Arpit Agarwal
Sepehr Assadi
Sanjeev Khanna
Stochastic Submodular Cover with Limited Adaptivity.
323-342
2019
SODA
https://doi.org/10.1137/1.9781611975482.21
https://dl.acm.org/citation.cfm?id=3310456
conf/soda/2019
db/conf/soda/soda2019.html#AgarwalAK19
Sepehr Assadi
Yu Chen 0039
Sanjeev Khanna
Sublinear Algorithms for (Δ + 1) Vertex Coloring.
767-786
2019
SODA
https://doi.org/10.1137/1.9781611975482.48
https://dl.acm.org/citation.cfm?id=3310483
conf/soda/2019
db/conf/soda/soda2019.html#AssadiCK19
Sepehr Assadi
Yu Chen 0039
Sanjeev Khanna
Polynomial pass lower bounds for graph streaming algorithms.
265-276
2019
STOC
https://doi.org/10.1145/3313276.3316361
conf/stoc/2019
db/conf/stoc/stoc2019.html#AssadiCK19
Julia Chuzhoy
Sanjeev Khanna
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems.
389-400
2019
STOC
https://doi.org/10.1145/3313276.3316320
conf/stoc/2019
db/conf/stoc/stoc2019.html#ChuzhoyK19
Sepehr Assadi
Yu Chen 0039
Sanjeev Khanna
Polynomial Pass Lower Bounds for Graph Streaming Algorithms.
2019
abs/1904.04720
CoRR
http://arxiv.org/abs/1904.04720
db/journals/corr/corr1904.html#abs-1904-04720
Julia Chuzhoy
Sanjeev Khanna
A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems.
2019
abs/1905.11512
CoRR
http://arxiv.org/abs/1905.11512
db/journals/corr/corr1905.html#abs-1905-11512
Yu Chen 0039
Shahin Jabbari
Michael J. Kearns
Sanjeev Khanna
Jamie Morgenstern
Network Formation under Random Attack and Probabilistic Spread.
2019
abs/1906.00241
CoRR
http://arxiv.org/abs/1906.00241
db/journals/corr/corr1906.html#abs-1906-00241
Ashish Chiplunkar
Michael Kapralov
Sanjeev Khanna
Aida Mousavifar
Yuval Peres
Testing Graph Clusterability: Algorithms and Lower Bounds.
497-508
2018
FOCS
https://doi.org/10.1109/FOCS.2018.00054
https://doi.ieeecomputersociety.org/10.1109/FOCS.2018.00054
conf/focs/2018
db/conf/focs/focs2018.html#ChiplunkarKKMP18
Deeparnab Chakrabarty
Sanjeev Khanna
Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling.
4:1-4:11
2018
SOSA
https://doi.org/10.4230/OASIcs.SOSA.2018.4
conf/soda/2018sosa
db/conf/soda/sosa2018.html#ChakrabartyK18
Mudabir Kabir Asathulla
Sanjeev Khanna
Nathaniel Lahn
Sharath Raghvendra
A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs.
457-476
2018
SODA
https://doi.org/10.1137/1.9781611975031.31
conf/soda/2018
db/conf/soda/soda2018.html#AsathullaKLR18
Sepehr Assadi
Sanjeev Khanna
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem.
2412-2431
2018
SODA
https://doi.org/10.1137/1.9781611975031.155
conf/soda/2018
db/conf/soda/soda2018.html#AssadiK18
Deeparnab Chakrabarty
Sanjeev Khanna
Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling.
2018
abs/1801.02790
CoRR
http://arxiv.org/abs/1801.02790
db/journals/corr/corr1801.html#abs-1801-02790
Sepehr Assadi
Sanjeev Khanna
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem.
2018
abs/1801.02793
CoRR
http://arxiv.org/abs/1801.02793
db/journals/corr/corr1801.html#abs-1801-02793
Sepehr Assadi
Yu Chen 0039
Sanjeev Khanna
Sublinear Algorithms for (Δ+ 1) Vertex Coloring.
2018
abs/1807.08886
CoRR
http://arxiv.org/abs/1807.08886
db/journals/corr/corr1807.html#abs-1807-08886
Ashish Chiplunkar
Michael Kapralov
Sanjeev Khanna
Aida Mousavifar
Yuval Peres
Testing Graph Clusterability: Algorithms and Lower Bounds.
2018
abs/1808.04807
CoRR
http://arxiv.org/abs/1808.04807
db/journals/corr/corr1808.html#abs-1808-04807
Arpit Agarwal
Sepehr Assadi
Sanjeev Khanna
Stochastic Submodular Cover with Limited Adaptivity.
2018
abs/1810.13351
CoRR
http://arxiv.org/abs/1810.13351
db/journals/corr/corr1810.html#abs-1810-13351
Sepehr Assadi
Michael Kapralov
Sanjeev Khanna
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling.
2018
abs/1811.07780
CoRR
http://arxiv.org/abs/1811.07780
db/journals/corr/corr1811.html#abs-1811-07780
Marek Chrobak
Uriel Feige
Mohammad Taghi Hajiaghayi
Sanjeev Khanna
Fei Li 0001
Seffi Naor
A greedy approximation algorithm for minimum-gap scheduling.
279-292
2017
20
J. Sched.
3
https://doi.org/10.1007/s10951-016-0492-y
db/journals/scheduling/scheduling20.html#ChrobakFHKLN17
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Rakesh Vohra
Fast Convergence in the Double Oral Auction.
20:1-20:18
2017
5
ACM Trans. Economics and Comput.
4
https://doi.org/10.1145/3084358
db/journals/teco/teco5.html#AssadiKLV17
Arpit Agarwal
Shivani Agarwal 0001
Sepehr Assadi
Sanjeev Khanna
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons.
39-75
2017
COLT
http://proceedings.mlr.press/v65/agarwal17c.html
conf/colt/2017
db/conf/colt/colt2017.html#Agarwal0AK17
Konstantinos Mamouras
Mukund Raghothaman
Rajeev Alur
Zachary G. Ives
Sanjeev Khanna
StreamQRE: modular specification and efficient evaluation of quantitative queries over streaming data.
693-708
2017
PLDI
https://doi.org/10.1145/3062341.3062369
https://doi.org/10.1145/3140587.3062369
https://www.wikidata.org/entity/Q89311678
conf/pldi/2017
db/conf/pldi/pldi2017.html#MamourasRAIK17
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm.
99-116
2017
EC
https://doi.org/10.1145/3033274.3085146
conf/sigecom/2017
db/conf/sigecom/sigecom2017.html#AssadiKL17
Michael Kapralov
Sanjeev Khanna
Madhu Sudan 0001
Ameya Velingker
(1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space.
1703-1722
2017
SODA
https://doi.org/10.1137/1.9781611974782.112
http://dl.acm.org/citation.cfm?id=3039798
conf/soda/2017
db/conf/soda/soda2017.html#KapralovKSV17
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
On Estimating Maximum Matching Size in Graph Streams.
1723-1742
2017
SODA
https://doi.org/10.1137/1.9781611974782.113
http://dl.acm.org/citation.cfm?id=3039799
conf/soda/2017
db/conf/soda/soda2017.html#AssadiKL17
Sepehr Assadi
Sanjeev Khanna
Randomized Composable Coresets for Matching and Vertex Cover.
3-12
2017
SPAA
https://doi.org/10.1145/3087556.3087581
conf/spaa/2017
db/conf/spaa/spaa2017.html#AssadiK17
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
On Estimating Maximum Matching Size in Graph Streams.
2017
abs/1701.04364
CoRR
http://arxiv.org/abs/1701.04364
db/journals/corr/corr1701.html#AssadiKL17
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm.
2017
abs/1705.02280
CoRR
http://arxiv.org/abs/1705.02280
db/journals/corr/corr1705.html#AssadiKL17a
Sepehr Assadi
Sanjeev Khanna
Randomized Composable Coresets for Matching and Vertex Cover.
2017
abs/1705.08242
CoRR
http://arxiv.org/abs/1705.08242
db/journals/corr/corr1705.html#AssadiK17
Brett Hemenway
Sanjeev Khanna
Sensitivity and computational complexity in financial networks.
95-110
2016
5
Algorithmic Finance
3-4
https://doi.org/10.3233/AF-160166
db/journals/af/af5.html#HemenwayK16
Johannes Starlinger
Sarah Cohen Boulakia
Sanjeev Khanna
Susan B. Davidson
Ulf Leser
Effective and efficient similarity search in scientific workflow repositories.
584-594
2016
56
Future Gener. Comput. Syst.
https://doi.org/10.1016/j.future.2015.06.012
db/journals/fgcs/fgcs56.html#StarlingerBKDL16
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Val Tannen
Algorithms for Provisioning Queries and Analytics.
18:1-18:18
2016
ICDT
https://doi.org/10.4230/LIPIcs.ICDT.2016.18
conf/icdt/2016
db/conf/icdt/icdt2016.html#AssadiKLT16
Alexander J. T. Gurney
Sanjeev Khanna
Yang Li 0025
Rapid convergence versus policy expressiveness in interdomain routing.
1-9
2016
INFOCOM
https://doi.org/10.1109/INFOCOM.2016.7524406
conf/infocom/2016
db/conf/infocom/infocom2016.html#GurneyKL16
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
The Stochastic Matching Problem with (Very) Few Queries.
43-60
2016
EC
https://doi.org/10.1145/2940716.2940769
conf/sigecom/2016
db/conf/sigecom/sigecom2016.html#AssadiKL16
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Grigory Yaroslavtsev
Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model.
1345-1364
2016
SODA
https://doi.org/10.1137/1.9781611974331.ch93
http://dl.acm.org/citation.cfm?id=2884528
conf/soda/2016
db/conf/soda/soda2016.html#AssadiKLY16
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Tight bounds for single-pass streaming complexity of the set cover problem.
698-711
2016
STOC
https://doi.org/10.1145/2897518.2897576
conf/stoc/2016
db/conf/stoc/stoc2016.html#AssadiKL16
Sanjeev Goyal
Shahin Jabbari
Michael J. Kearns
Sanjeev Khanna
Jamie Morgenstern
Strategic Network Formation with Attack and Immunization.
429-443
2016
WINE
https://doi.org/10.1007/978-3-662-54110-4_30
conf/wine/2016
db/conf/wine/wine2016.html#GoyalJKKM16
Michael B. Greenwald
Sanjeev Khanna
Quantiles and Equi-depth Histograms over Streams.
45-86
2016
Data Stream Management
https://doi.org/10.1007/978-3-540-28608-0_3
books/sp/GGR2016
db/books/collections/GGR2016.html#GreenwaldK16
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem.
2016
abs/1603.05715
CoRR
http://arxiv.org/abs/1603.05715
db/journals/corr/corr1603.html#AssadiKL16
Deeparnab Chakrabarty
Chandra Chekuri
Sanjeev Khanna
Nitish Korula
Approximability of Capacitated Network Design.
493-514
2015
72
Algorithmica
2
https://doi.org/10.1007/s00453-013-9862-4
db/journals/algorithmica/algorithmica72.html#ChakrabartyCKK15
Michael Brautbar
Moez Draief
Sanjeev Khanna
On the Power of Planned Infections in Networks.
319-332
2015
11
Internet Math.
4-5
https://doi.org/10.1080/15427951.2014.982312
db/journals/im/im11.html#BrautbarDK15
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Val Tannen
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches.
52-68
2015
FSTTCS
https://doi.org/10.4230/LIPIcs.FSTTCS.2015.52
conf/fsttcs/2015
db/conf/fsttcs/fsttcs2015.html#AssadiKLT15
Yannis Mantzouratos
Tarik Tosun
Sanjeev Khanna
Mark Yim
On embeddability of modular robot designs.
1911-1918
2015
ICRA
https://doi.org/10.1109/ICRA.2015.7139448
conf/icra/2015
db/conf/icra/icra2015.html#MantzouratosTKY15
Deeparnab Chakrabarty
Sanjeev Khanna
Shi Li 0001
On (1, ∊)-Restricted Assignment Makespan Minimization.
1087-1101
2015
SODA
https://doi.org/10.1137/1.9781611973730.73
conf/soda/2015
db/conf/soda/soda2015.html#ChakrabartyKL15
Michael Kapralov
Sanjeev Khanna
Madhu Sudan 0001
Streaming Lower Bounds for Approximating MAX-CUT.
1263-1282
2015
SODA
https://doi.org/10.1137/1.9781611973730.84
conf/soda/2015
db/conf/soda/soda2015.html#KapralovKS15
Ashish Goel
Sanjeev Khanna
Sharath Raghvendra
Hongyang Zhang 0005
Connectivity in Random Forests and Credit Networks.
2037-2048
2015
SODA
https://doi.org/10.1137/1.9781611973730.135
conf/soda/2015
db/conf/soda/soda2015.html#GoelKRZ15
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Rakesh V. Vohra
Fast Convergence in the Double Oral Auction.
60-73
2015
WINE
https://doi.org/10.1007/978-3-662-48995-6_5
conf/wine/2015
db/conf/wine/wine2015.html#AssadiKLV15
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Grigory Yaroslavtsev
Tight Bounds for Linear Sketches of Approximate Matchings.
2015
abs/1505.01467
CoRR
http://arxiv.org/abs/1505.01467
db/journals/corr/corr1505.html#AssadiKLY15
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Rakesh Vohra
Fast Convergence in the Double Oral Auction.
2015
abs/1510.00086
CoRR
http://arxiv.org/abs/1510.00086
db/journals/corr/corr1510.html#AssadiKLV15
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Val Tannen
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches.
2015
abs/1510.03252
CoRR
http://arxiv.org/abs/1510.03252
db/journals/corr/corr1510.html#AssadiKLT15
Sanjeev Goyal
Shahin Jabbari
Michael J. Kearns
Sanjeev Khanna
Jamie Morgenstern
Strategic Network Formation with Attack and Immunization.
2015
abs/1511.05196
CoRR
http://arxiv.org/abs/1511.05196
db/journals/corr/corr1511.html#GoyalJKKM15
Sepehr Assadi
Sanjeev Khanna
Yang Li 0025
Val Tannen
Algorithms for Provisioning Queries and Analytics.
2015
abs/1512.06143
CoRR
http://arxiv.org/abs/1512.06143
db/journals/corr/corr1512.html#AssadiKLT15a
Susan B. Davidson
Sanjeev Khanna
Tova Milo
Sudeepa Roy
Top-k and Clustering with Noisy Comparisons.
35:1-35:39
2014
39
ACM Trans. Database Syst.
4
https://doi.org/10.1145/2684066
db/journals/tods/tods39.html#DavidsonKMR14
Justin Hsu
Marco Gaboardi
Andreas Haeberlen
Sanjeev Khanna
Arjun Narayan
Benjamin C. Pierce
Aaron Roth 0001
Differential Privacy: An Economic Method for Choosing Epsilon.
398-410
2014
CSF
https://doi.org/10.1109/CSF.2014.35
https://doi.ieeecomputersociety.org/10.1109/CSF.2014.35
conf/csfw/2014
db/conf/csfw/csf2014.html#HsuGHKNPR14
Johannes Starlinger
Sarah Cohen Boulakia
Sanjeev Khanna
Susan B. Davidson
Ulf Leser
Layer Decomposition: An Effective Structure-Based Approach for Scientific Workflow Similarity.
169-176
2014
eScience
https://doi.org/10.1109/eScience.2014.19
https://doi.ieeecomputersociety.org/10.1109/eScience.2014.19
conf/eScience/2014
db/conf/eScience/eScience2014.html#StarlingerBKDL14
Anand Bhalgat
Sanjeev Khanna
A Utility Equivalence Theorem for Concave Functions.
126-137
2014
IPCO
https://doi.org/10.1007/978-3-319-07557-0_11
conf/ipco/2014
db/conf/ipco/ipco2014.html#BhalgatK14
Sanjeev Khanna
Matchings, Random Walks, and Sampling.
32-33
2014
LATA
https://doi.org/10.1007/978-3-319-04921-2_3
conf/lata/2014
db/conf/lata/lata2014.html#Khanna14
Ahmed Hefny
Robert E. Kass
Sanjeev Khanna
Matthew A. Smith 0001
Geoffrey J. Gordon
Fast and Improved SLEX Analysis of High-Dimensional Time Series.
94-103
2014
MLINI@NIPS
https://doi.org/10.1007/978-3-319-45174-9_10
conf/nips/2014mlini
db/conf/nips/mlini2014.html#HefnyKKSG14
Michael Kapralov
Sanjeev Khanna
Madhu Sudan 0001
Approximating matching size from random streams.
734-751
2014
SODA
https://doi.org/10.1137/1.9781611973402.55
conf/soda/2014
db/conf/soda/soda2014.html#KapralovKS14
Ashish Goel
Sanjeev Khanna
Daniel H. Larkin
Robert Endre Tarjan
Disjoint Set Union with Randomized Linking.
1005-1017
2014
SODA
https://doi.org/10.1137/1.9781611973402.75
conf/soda/2014
db/conf/soda/soda2014.html#GoelKLT14
Sanjeev Khanna
Brendan Lucier
Influence Maximization in Undirected Networks.
1482-1496
2014
SODA
https://doi.org/10.1137/1.9781611973402.109
conf/soda/2014
db/conf/soda/soda2014.html#KhannaL14
Justin Hsu
Marco Gaboardi
Andreas Haeberlen
Sanjeev Khanna
Arjun Narayan
Benjamin C. Pierce
Aaron Roth 0001
Differential Privacy: An Economic Method for Choosing Epsilon.
2014
abs/1402.3329
CoRR
http://arxiv.org/abs/1402.3329
db/journals/corr/corr1402.html#HsuGHKNPR14
Michael Kapralov
Sanjeev Khanna
Madhu Sudan 0001
Streaming Lower Bounds for Approximating MAX-CUT.
2014
abs/1409.2138
CoRR
http://arxiv.org/abs/1409.2138
db/journals/corr/corr1409.html#KapralovKS14
Deeparnab Chakrabarty
Sanjeev Khanna
Shi Li 0001
On $(1, ε)$-Restricted Assignment Makespan Minimization.
2014
abs/1410.7506
CoRR
http://arxiv.org/abs/1410.7506
db/journals/corr/corr1410.html#ChakrabartyKL14
Ashish Goel
Michael Kapralov
Sanjeev Khanna
Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs.
1392-1404
2013
42
SIAM J. Comput.
3
https://doi.org/10.1137/100812513
db/journals/siamcomp/siamcomp42.html#GoelKK13
Chandra Chekuri
Sanjeev Khanna
F. Bruce Shepherd
The All-or-Nothing Multicommodity Flow Problem.
1467-1493
2013
42
SIAM J. Comput.
4
https://doi.org/10.1137/100796820
db/journals/siamcomp/siamcomp42.html#ChekuriKS13
Tanmoy Chakraborty 0001
Zhiyi Huang 0002
Sanjeev Khanna
Dynamic and Nonuniform Pricing Strategies for Revenue Maximization.
2424-2451
2013
42
SIAM J. Comput.
6
https://doi.org/10.1137/100787799
db/journals/siamcomp/siamcomp42.html#00010K13
Susan B. Davidson
Sanjeev Khanna
Tova Milo
To Show or Not to Show in Workflow Provenance.
217-226
2013
In Search of Elegance in the Theory and Practice of Computation
https://doi.org/10.1007/978-3-642-41660-6_10
conf/birthday/2013buneman
db/conf/birthday/buneman2013.html#DavidsonKM13
Marek Chrobak
Uriel Feige
Mohammad Taghi Hajiaghayi
Sanjeev Khanna
Fei Li 0001
Seffi Naor
A Greedy Approximation Algorithm for Minimum-Gap Scheduling.
97-109
2013
CIAC
https://doi.org/10.1007/978-3-642-38233-8_9
conf/ciac/2013
db/conf/ciac/ciac2013.html#ChrobakFHKLN13
Susan B. Davidson
Sanjeev Khanna
Tova Milo
Sudeepa Roy
Using the crowd for top-k and group-by queries.
225-236
2013
ICDT
https://doi.org/10.1145/2448496.2448524
conf/icdt/2013
db/conf/icdt/icdt2013.html#DavidsonKMR13
Michael Brautbar
Moez Draief
Sanjeev Khanna
On the Power of Adversarial Infections in Networks.
44-55
2013
WAW
https://doi.org/10.1007/978-3-319-03536-9_4
conf/waw/2013
db/conf/waw/waw2013.html#BrautbarDK13
Sanjeev Khanna
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013
SODA
SIAM
2013
978-1-61197-251-1
978-1-61197-310-5
https://doi.org/10.1137/1.9781611973105
db/conf/soda/soda2013.html
Julia Chuzhoy
Sanjeev Khanna
An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design.
401-413
2012
8
Theory Comput.
1
https://doi.org/10.4086/toc.2012.v008a018
db/journals/toc/toc8.html#ChuzhoyK12
Sanjeev Khanna
Santosh S. Venkatesh
Omid Fatemieh
Fariba Khan
Carl A. Gunter
Adaptive Selective Verification: An Efficient Adaptive Countermeasure to Thwart DoS Attacks.
715-728
2012
20
IEEE/ACM Trans. Netw.
3
https://doi.org/10.1109/TNET.2011.2171057
db/journals/ton/ton20.html#KhannaVFKG12
Parinya Chalermsook
Julia Chuzhoy
Sampath Kannan
Sanjeev Khanna
Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply.
73-84
2012
APPROX-RANDOM
https://doi.org/10.1007/978-3-642-32512-0_7
conf/approx/2012
db/conf/approx/approx2012.html#ChalermsookCKK12
Justin Hsu
Sanjeev Khanna
Aaron Roth 0001
Distributed Private Heavy Hitters.
461-472
2012
ICALP (1)
https://doi.org/10.1007/978-3-642-31594-7_39
conf/icalp/2012-1
db/conf/icalp/icalp2012-1.html#HsuKR12
Ashish Goel
Michael Kapralov
Sanjeev Khanna
On the communication and streaming complexity of maximum bipartite matching.
468-485
2012
SODA
https://doi.org/10.1137/1.9781611973099.41
https://dl.acm.org/citation.cfm?id=2095157
conf/soda/2012
db/conf/soda/soda2012.html#GoelKK12
Anand Bhalgat
Tanmoy Chakraborty 0001
Sanjeev Khanna
Mechanism Design for a Risk Averse Seller.
198-211
2012
WINE
https://doi.org/10.1007/978-3-642-35311-6_15
conf/wine/2012
db/conf/wine/wine2012.html#BhalgatCK12
Christian Borgs
Michael Brautbar
Jennifer T. Chayes
Sanjeev Khanna
Brendan Lucier
The Power of Local Information in Social Networks.
406-419
2012
WINE
https://doi.org/10.1007/978-3-642-35311-6_30
conf/wine/2012
db/conf/wine/wine2012.html#BorgsBCKL12
Justin Hsu
Sanjeev Khanna
Aaron Roth 0001
Distributed Private Heavy Hitters
http://arxiv.org/abs/1202.4910
2012
CoRR
abs/1202.4910
db/journals/corr/corr1202.html#abs-1202-4910
Christian Borgs
Michael Brautbar
Jennifer T. Chayes
Sanjeev Khanna
Brendan Lucier
The Power of Local Information in Social Networks
http://arxiv.org/abs/1202.6033
2012
CoRR
abs/1202.6033
db/journals/corr/corr1202.html#abs-1202-6033
Sanjeev Khanna
Sudeepa Roy
Val Tannen
Queries with Difference on Probabilistic Databases.
1051-1062
2011
4
Proc. VLDB Endow.
11
http://www.vldb.org/pvldb/vol4/p1051-khanna.pdf
db/journals/pvldb/pvldb4.html#KhannaRT11
Anand Bhalgat
Deeparnab Chakrabarty
Sanjeev Khanna
Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs.
75-86
2011
APPROX-RANDOM
https://doi.org/10.1007/978-3-642-22935-0_7
conf/approx/2011
db/conf/approx/approx2011.html#BhalgatCK11
Anand Bhalgat
Deeparnab Chakrabarty
Sanjeev Khanna
Social Welfare in One-Sided Matching Markets without Money.
87-98
2011
APPROX-RANDOM
https://doi.org/10.1007/978-3-642-22935-0_8
conf/approx/2011
db/conf/approx/approx2011.html#BhalgatCK11a
Susan B. Davidson
Sanjeev Khanna
Val Tannen
Sudeepa Roy
Yi Chen 0001
Tova Milo
Julia Stoyanovich
Enabling Privacy in Provenance-Aware Workflow Systems.
215-218
2011
CIDR
http://cidrdb.org/cidr2011/Papers/CIDR11_Paper30.pdf
conf/cidr/2011
db/conf/cidr/cidr2011.html#DavidsonKTRCMS11
Zhiyi Huang 0002
Sampath Kannan
Sanjeev Khanna
Algorithms for the Generalized Sorting Problem.
738-747
2011
FOCS
https://doi.org/10.1109/FOCS.2011.54
https://doi.ieeecomputersociety.org/10.1109/FOCS.2011.54
conf/focs/2011
db/conf/focs/focs2011.html#HuangKK11
Sanjeev Khanna
Madhu Sudan 0001
Delays and the Capacity of Continuous-Time Channels.
758-767
2011
FOCS
https://doi.org/10.1109/FOCS.2011.60
https://doi.ieeecomputersociety.org/10.1109/FOCS.2011.60
conf/focs/2011
db/conf/focs/focs2011.html#KhannaS11
Susan B. Davidson
Sanjeev Khanna
Sudeepa Roy
Julia Stoyanovich
Val Tannen
Yi Chen 0001
On provenance and privacy.
3-10
2011
ICDT
https://doi.org/10.1145/1938551.1938554
conf/icdt/2011
db/conf/icdt/icdt2011.html#DavidsonKRSTC11
Brendan Juba
Adam Tauman Kalai
Sanjeev Khanna
Madhu Sudan 0001
Compression without a common prior: an information-theoretic justification for ambiguity in language.
79-86
2011
ICS
http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/23.html
conf/innovations/2011
db/conf/innovations/innovations2011.html#JubaKKS11
Deeparnab Chakrabarty
Chandra Chekuri
Sanjeev Khanna
Nitish Korula
Approximability of Capacitated Network Design.
78-91
2011
IPCO
https://doi.org/10.1007/978-3-642-20807-2_7
conf/ipco/2011
db/conf/ipco/ipco2011.html#ChakrabartyCKK11
Susan B. Davidson
Sanjeev Khanna
Tova Milo
Debmalya Panigrahi
Sudeepa Roy
Provenance views for module privacy.
175-186
2011
PODS
https://doi.org/10.1145/1989284.1989305
conf/pods/2011
db/conf/pods/pods2011.html#DavidsonKMPR11
Anand Bhalgat
Ashish Goel
Sanjeev Khanna
Improved Approximation Results for Stochastic Knapsack Problems.
1647-1665
2011
SODA
https://doi.org/10.1137/1.9781611973082.127
http://dl.acm.org/citation.cfm?id=2133163
conf/soda/2011
db/conf/soda/soda2011.html#BhalgatGK11
Anand Bhalgat
Deeparnab Chakrabarty
Sanjeev Khanna
Social Welfare in One-sided Matching Markets without Money
http://arxiv.org/abs/1104.2964
2011
CoRR
abs/1104.2964
db/journals/corr/corr1104.html#abs-1104-2964
Sanjeev Khanna
Madhu Sudan 0001
Delays and the Capacity of Continuous-time Channels
http://arxiv.org/abs/1105.3425
2011
CoRR
abs/1105.3425
db/journals/corr/corr1105.html#abs-1105-3425
Anand Bhalgat
Tanmoy Chakraborty 0001
Sanjeev Khanna
Mechanism Design with Risk Aversion
http://arxiv.org/abs/1107.4722
2011
CoRR
abs/1107.4722
db/journals/corr/corr1107.html#abs-1107-4722
Matthew Andrews
Julia Chuzhoy
Venkatesan Guruswami
Sanjeev Khanna
Kunal Talwar
Lisa Zhang
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.
485-520
2010
30
Comb.
5
https://doi.org/10.1007/s00493-010-2455-9
db/journals/combinatorica/combinatorica30.html#AndrewsCGKTZ10
Stanislav Angelov
Sanjeev Khanna
Mirkó Visontai
Robust self-assembly of graphs.
111-133
2010
9
Nat. Comput.
1
https://doi.org/10.1007/s11047-009-9149-5
db/journals/nc/nc9.html#AngelovKV10
Ashish Goel
Michael Kapralov
Sanjeev Khanna
Perfect matchings via uniform sampling in regular bipartite graphs.
2010
6
ACM Trans. Algorithms
2
https://doi.org/10.1145/1721837.1721843
db/journals/talg/talg6.html#GoelKK10
27:1-27:13
Tanmoy Chakraborty 0001
Zhiyi Huang 0002
Sanjeev Khanna
Dynamic and non-uniform pricing strategies for revenue maximization.
20:1
2010
BQGT
https://doi.org/10.1145/1807406.1807426
conf/bqgt/2010
db/conf/bqgt/bqgt2010.html#00010K10
Anand Bhalgat
Tanmoy Chakraborty 0001
Sanjeev Khanna
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games.
73-82
2010
EC
https://doi.org/10.1145/1807342.1807353
conf/sigecom/2010
db/conf/sigecom/sigecom2010.html#BhalgatCK10
Zhuowei Bao
Susan B. Davidson
Sanjeev Khanna
Sudeepa Roy
An optimal labeling scheme for workflow provenance using skeleton labels.
711-722
2010
SIGMOD Conference
https://doi.org/10.1145/1807167.1807244
conf/sigmod/2010
db/conf/sigmod/sigmod2010.html#BaoDKR10
Ashish Goel
Michael Kapralov
Sanjeev Khanna
Perfect matchings in o(n log n) time in regular bipartite graphs.
39-46
2010
STOC
https://doi.org/10.1145/1806689.1806697
conf/stoc/2010
db/conf/stoc/stoc2010.html#GoelKK10
Patrick Briest
Parinya Chalermsook
Sanjeev Khanna
Bundit Laekhanukit
Danupon Nanongkai
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.
444-454
2010
WINE
https://doi.org/10.1007/978-3-642-17572-5_37
conf/wine/2010
db/conf/wine/wine2010.html#BriestCKLN10
Ashish Goel
Michael Kapralov
Sanjeev Khanna
Graph Sparsification via Refinement Sampling
http://arxiv.org/abs/1004.4915
2010
CoRR
abs/1004.4915
db/journals/corr/corr1004.html#abs-1004-4915
Susan B. Davidson
Sanjeev Khanna
Debmalya Panigrahi
Sudeepa Roy
Preserving Module Privacy in Workflow Provenance
http://arxiv.org/abs/1005.5543
2010
CoRR
abs/1005.5543
db/journals/corr/corr1005.html#abs-1005-5543
Deeparnab Chakrabarty
Chandra Chekuri
Sanjeev Khanna
Nitish Korula
Approximability of Capacitated Network Design
http://arxiv.org/abs/1009.5734
2010
CoRR
abs/1009.5734
db/journals/corr/corr1009.html#abs-1009-5734
Anand Bhalgat
Deeparnab Chakrabarty
Sanjeev Khanna
Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP
http://arxiv.org/abs/1011.3770
2010
CoRR
abs/1011.3770
db/journals/corr/corr1011.html#abs-1011-3770
Chandra Chekuri
Sanjeev Khanna
F. Bruce Shepherd
A Note on Multiflows and Treewidth.
400-412
2009
54
Algorithmica
3
https://doi.org/10.1007/s00453-007-9129-z
db/journals/algorithmica/algorithmica54.html#ChekuriKS09
Stanislav Angelov
Sanjeev Khanna
Keshav Kunal
The Network as a Storage Device: Dynamic Routing with Bounded Buffers.
71-94
2009
55
Algorithmica
1
https://doi.org/10.1007/s00453-007-9143-1
db/journals/algorithmica/algorithmica55.html#AngelovKK09
Julia Chuzhoy
Sanjeev Khanna
Polynomial flow-cut gaps and hardness of directed cut problems.
2009
56
J. ACM
2
https://doi.org/10.1145/1502793.1502795
db/journals/jacm/jacm56.html#ChuzhoyK09
6:1-6:28
Chandra Chekuri
Sanjeev Khanna
F. Bruce Shepherd
Edge-Disjoint Paths in Planar Graphs with Constant Congestion.
281-301
2009
39
SIAM J. Comput.
1
https://doi.org/10.1137/060674442
db/journals/siamcomp/siamcomp39.html#ChekuriKS09
Leana Golubchik
Sanjeev Khanna
Samir Khuller
Ramakrishna Thurimella
An Zhu
Approximation algorithms for data placement on parallel disks.
2009
5
ACM Trans. Algorithms
4
https://doi.org/10.1145/1597036.1597037
db/journals/talg/talg5.html#GolubchikKKTZ09
34:1-34:26
Deeparnab Chakrabarty
Julia Chuzhoy
Sanjeev Khanna
On Allocating Goods to Maximize Fairness.
107-116
2009
FOCS
https://doi.org/10.1109/FOCS.2009.51
https://doi.ieeecomputersociety.org/10.1109/FOCS.2009.51
conf/focs/2009
db/conf/focs/focs2009.html#ChakrabartyCK09
Julia Chuzhoy
Sanjeev Khanna
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design.
437-441
2009
FOCS
https://doi.org/10.1109/FOCS.2009.38
https://doi.ieeecomputersociety.org/10.1109/FOCS.2009.38
conf/focs/2009
db/conf/focs/focs2009.html#ChuzhoyK09
Tanmoy Chakraborty 0001
Zhiyi Huang 0002
Sanjeev Khanna
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization.
495-504
2009
FOCS
https://doi.org/10.1109/FOCS.2009.43
https://doi.ieeecomputersociety.org/10.1109/FOCS.2009.43
conf/focs/2009
db/conf/focs/focs2009.html#ChakrabortyHK09
Zhuowei Bao
Sarah Cohen Boulakia
Susan B. Davidson
Anat Eyal
Sanjeev Khanna
Differencing Provenance in Scientific Workflows.
808-819
2009
ICDE
https://doi.org/10.1109/ICDE.2009.103
https://doi.ieeecomputersociety.org/10.1109/ICDE.2009.103
conf/icde/2009
db/conf/icde/icde2009.html#BaoBDEK09
Olivier Biton
Susan B. Davidson
Sanjeev Khanna
Sudeepa Roy
Optimizing user views for workflows.
310-323
2009
ICDT
https://doi.org/10.1145/1514894.1514931
conf/icdt/2009
db/conf/icdt/icdt2009.html#BitonDKR09
Tanmoy Chakraborty 0001
Sanjeev Khanna
Nash Dynamics in Constant Player and Bounded Jump Congestion Games.
196-207
2009
SAGT
https://doi.org/10.1007/978-3-642-04645-2_18
conf/sagt/2009
db/conf/sagt/sagt2009.html#ChakrabortyK09
Liming Zhao
Aline Normoyle
Sanjeev Khanna
Alla Safonova
Automatic construction of a minimum size motion graph.
27-35
2009
Symposium on Computer Animation
https://doi.org/10.1145/1599470.1599474
conf/sca/2009
db/conf/sca/sca2009.html#ZhaoNKS09
Tanmoy Chakraborty 0001
Michael J. Kearns
Sanjeev Khanna
Network bargaining: algorithms and structural results.
159-168
2009
EC
https://doi.org/10.1145/1566374.1566398
conf/sigecom/2009
db/conf/sigecom/sigecom2009.html#ChakrabortyKK09
Ashish Goel
Michael Kapralov
Sanjeev Khanna
Perfect matchings via uniform sampling in regular bipartite graphs.
11-17
2009
SODA
https://doi.org/10.1137/1.9781611973068.2
http://dl.acm.org/citation.cfm?id=1496770.1496772
conf/soda/2009
db/conf/soda/soda2009.html#GoelKK09
Ashish Goel
Sanjeev Khanna
Brad Null
The ratio index for budgeted learning, with applications.
18-27
2009
SODA
https://doi.org/10.1137/1.9781611973068.3
http://dl.acm.org/citation.cfm?id=1496770.1496773
conf/soda/2009
db/conf/soda/soda2009.html#GoelKN09
Anand Bhalgat
Tanmoy Chakraborty 0001
Sanjeev Khanna
Nash Dynamics in Congestion Games with Similar Resources.
362-373
2009
WINE
https://doi.org/10.1007/978-3-642-10841-9_33
conf/wine/2009
db/conf/wine/wine2009.html#BhalgatCK09
Deeparnab Chakrabarty
Julia Chuzhoy
Sanjeev Khanna
On Allocating Goods to Maximize Fairness
http://arxiv.org/abs/0901.0205
2009
CoRR
abs/0901.0205
db/journals/corr/corr0901.html#abs-0901-0205
Ashish Goel
Sanjeev Khanna
Perfect Matchings in Õ(n1.5) Time in Regular Bipartite Graphs
http://arxiv.org/abs/0902.1617
2009
CoRR
abs/0902.1617
db/journals/corr/corr0902.html#abs-0902-1617
Tanmoy Chakraborty 0001
Zhiyi Huang 0002
Sanjeev Khanna
Dynamic and Non-Uniform Pricing Strategies for Revenue Maximization
http://arxiv.org/abs/0905.3191
2009
CoRR
abs/0905.3191
db/journals/corr/corr0905.html#abs-0905-3191
Ashish Goel
Michael Kapralov
Sanjeev Khanna
Perfect Matchings in O(n \log n) Time in Regular Bipartite Graphs
http://arxiv.org/abs/0909.3346
2009
CoRR
abs/0909.3346
db/journals/corr/corr0909.html#abs-0909-3346
Patrick Briest
Sanjeev Khanna
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
http://arxiv.org/abs/0910.0110
2009
CoRR
abs/0910.0110
db/journals/corr/corr0910.html#abs-0910-0110
Stanislav Angelov
Sanjeev Khanna
Mirkó Visontai
On the complexity of graph self-assembly in accretive systems.
183-201
2008
7
Nat. Comput.
2
https://doi.org/10.1007/s11047-007-9048-6
db/journals/nc/nc7.html#AngelovKV08
Stanislav Angelov
Sanjeev Khanna
Mirkó Visontai
Robust Self-assembly of Graphs.
127-143
2008
DNA
https://doi.org/10.1007/978-3-642-03076-5_11
conf/dna/2008
db/conf/dna/dna2008.html#AngelovKV08
Julia Chuzhoy
Sanjeev Khanna
Algorithms for Single-Source Vertex Connectivity.
105-114
2008
FOCS
https://doi.org/10.1109/FOCS.2008.63
https://doi.ieeecomputersociety.org/10.1109/FOCS.2008.63
conf/focs/2008
db/conf/focs/focs2008.html#ChuzhoyK08
Sampath Kannan
Sanjeev Khanna
Sudeepa Roy
STCON in Directed Unique-Path Graphs.
2008
FSTTCS
https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1758
conf/fsttcs/2008
db/conf/fsttcs/fsttcs2008.html#KannanKR08
256-267
Chandra Chekuri
Sanjeev Khanna
Algorithms for 2-Route Cut Problems.
472-484
2008
ICALP (1)
https://doi.org/10.1007/978-3-540-70575-8_39
conf/icalp/2008-1
db/conf/icalp/icalp2008-1.html#ChekuriK08
Sanjeev Khanna
Santosh S. Venkatesh
Omid Fatemieh
Fariba Khan
Carl A. Gunter
Adaptive SelectiveVerification.
529-537
2008
INFOCOM
https://doi.org/10.1109/INFOCOM.2008.101
conf/infocom/2008
db/conf/infocom/infocom2008.html#KhannaVFKG08
Ashish Goel
Sanjeev Khanna
On the Network Coding Advantage for Wireless Multicast in Euclidean Space.
64-69
2008
IPSN
https://doi.org/10.1109/IPSN.2008.29
https://doi.ieeecomputersociety.org/10.1109/IPSN.2008.29
conf/ipsn/2008
db/conf/ipsn/ipsn2008.html#GoelK08
Tanmoy Chakraborty 0001
Julia Chuzhoy
Sanjeev Khanna
Network design for vertex connectivity.
167-176
2008
STOC
https://doi.org/10.1145/1374376.1374403
conf/stoc/2008
db/conf/stoc/stoc2008.html#ChakrabortyCK08
Ashish Goel
Michael Kapralov
Sanjeev Khanna
Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
http://arxiv.org/abs/0811.2457
2008
CoRR
abs/0811.2457
db/journals/corr/corr0811.html#abs-0811-2457
Julia Chuzhoy
Sanjeev Khanna
An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
http://arxiv.org/abs/0812.4442
2008
CoRR
abs/0812.4442
db/journals/corr/corr0812.html#abs-0812-4442
Stanislav Angelov
Boulos Harb
Sampath Kannan
Sanjeev Khanna
Junhyong Kim
Efficient Enumeration of Phylogenetically Informative Substrings.
701-723
2007
14
J. Comput. Biol.
6
https://doi.org/10.1089/cmb.2007.R011
https://www.wikidata.org/entity/Q42628681
db/journals/jcb/jcb14.html#AngelovHKKK07
Chandra Chekuri
Sanjeev Khanna
Edge-disjoint paths revisited.
2007
3
ACM Trans. Algorithms
4
https://doi.org/10.1145/1290672.1290683
db/journals/talg/talg3.html#ChekuriK07
46
Sanjeev Khanna
Keshav Kunal
Benjamin C. Pierce
A Formal Investigation of.
485-496
2007
conf/fsttcs/2007
FSTTCS
https://doi.org/10.1007/978-3-540-77050-3_40
db/conf/fsttcs/fsttcs2007.html#KhannaKP07
Julia Chuzhoy
Venkatesan Guruswami
Sanjeev Khanna
Kunal Talwar
Hardness of routing with congestion in directed graphs.
165-178
2007
conf/stoc/2007
STOC
https://doi.org/10.1145/1250790.1250816
db/conf/stoc/stoc2007.html#ChuzhoyGKT07
Julia Chuzhoy
Sanjeev Khanna
Polynomial flow-cut gaps and hardness of directed cut problems.
179-188
2007
conf/stoc/2007
STOC
https://doi.org/10.1145/1250790.1250817
db/conf/stoc/stoc2007.html#ChuzhoyK07
Matthew Andrews
Julia Chuzhoy
Venkatesan Guruswami
Sanjeev Khanna
Kunal Talwar
Lisa Zhang
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs.
2007
TR07
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-113/index.html
TR07-113
db/journals/eccc/eccc14.html#AndrewsCGKTZ07
Volkan Isler
Sampath Kannan
Sanjeev Khanna
Randomized Pursuit-Evasion with Local Visibility.
26-41
2006
20
SIAM J. Discret. Math.
1
https://doi.org/10.1137/S0895480104442169
db/journals/siamdm/siamdm20.html#IslerKK06
Chandra Chekuri
Sanjeev Khanna
F. Bruce Shepherd
An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow.
137-146
2006
2
Theory Comput.
7
https://doi.org/10.4086/toc.2006.v002a007
db/journals/toc/toc2.html#ChekuriKS06
Stanislav Angelov
Sanjeev Khanna
Mirkó Visontai
On the Complexity of Graph Self-assembly in Accretive Systems.
95-110
2006
conf/dna/2006
DNA
https://doi.org/10.1007/11925903_8
db/conf/dna/dna2006.html#AngelovKV06
Stanislav Angelov
Boulos Harb
Sampath Kannan
Sanjeev Khanna
Junhyong Kim
Efficient Enumeration of Phylogenetically Informative Substrings.
248-264
2006
conf/recomb/2006
RECOMB
https://doi.org/10.1007/11732990_22
db/conf/recomb/recomb2006.html#AngelovHKKK06
Julia Chuzhoy
Sanjeev Khanna
Hardness of cut problems in directed graphs.
527-536
2006
conf/stoc/2006
STOC
https://doi.org/10.1145/1132516.1132593
db/conf/stoc/stoc2006.html#ChuzhoyK06
Chandra Chekuri
Sanjeev Khanna
F. Bruce Shepherd
Edge-disjoint paths in Planar graphs with constant congestion.
757-766
2006
conf/stoc/2006
STOC
https://doi.org/10.1145/1132516.1132621
db/conf/stoc/stoc2006.html#ChekuriKS06
Michael B. Greenwald
Sanjeev Khanna
Keshav Kunal
Benjamin C. Pierce
Alan Schmitt
Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data.
269-283
2006
conf/wdag/2006
DISC
https://doi.org/10.1007/11864219_19
db/conf/wdag/disc2006.html#GreenwaldKKPS06
Julia Chuzhoy
Sanjeev Khanna
Hardness of Directed Routing with Congestion.
2006
TR06
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-109/index.html
TR06-109
db/journals/eccc/eccc13.html#ChuzhoyK06
Volkan Isler
Sanjeev Khanna
John R. Spletzer
Camillo J. Taylor
Target tracking with distributed sensors: The focus of attention problem.
225-247
2005
100
Comput. Vis. Image Underst.
1-2
https://doi.org/10.1016/j.cviu.2004.10.008
db/journals/cviu/cviu100.html#IslerKST05
Julia Chuzhoy
Sudipto Guha
Eran Halperin
Sanjeev Khanna
Guy Kortsarz
Robert Krauthgamer
Joseph Naor
Asymmetric k-center is log* n-hard to approximate.
538-551
2005
52
J. ACM
4
https://doi.org/10.1145/1082036.1082038
db/journals/jacm/jacm52.html#ChuzhoyGHKKKN05
Chandra Chekuri
Sanjeev Khanna
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem.
713-728
2005
35
SIAM J. Comput.
3
https://doi.org/10.1137/S0097539700382820
https://www.wikidata.org/entity/Q62002052
db/journals/siamcomp/siamcomp35.html#ChekuriK05
Volkan Isler
Sampath Kannan
Sanjeev Khanna
Randomized pursuit-evasion in a polygonal environment.
875-884
2005
21
IEEE Trans. Robotics
5
https://doi.org/10.1109/TRO.2005.851373
db/journals/trob/trob21.html#IslerKK05
Stanislav Angelov
Sanjeev Khanna
Keshav Kunal
The Network as a Storage Device: Dynamic Routing with Bounded Buffers.
1-13
2005
conf/approx/2005
APPROX-RANDOM
https://doi.org/10.1007/11538462_1
db/conf/approx/approx2005.html#AngelovKK05
Matthew Andrews
Julia Chuzhoy
Sanjeev Khanna
Lisa Zhang
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion.
226-244
2005
conf/focs/2005
FOCS
https://doi.org/10.1109/SFCS.2005.41
https://doi.ieeecomputersociety.org/10.1109/SFCS.2005.41
db/conf/focs/focs2005.html#AndrewsCZ05
Nikhil Bansal 0001
Moses Charikar
Sanjeev Khanna
Joseph Naor
Approximating the average response time in broadcast scheduling.
215-221
2005
conf/soda/2005
SODA
http://dl.acm.org/citation.cfm?id=1070432.1070463
db/conf/soda/soda2005.html#BansalCKN05
Chandra Chekuri
Sanjeev Khanna
F. Bruce Shepherd
Multicommodity flow, well-linked terminals, and routing problems.
183-192
2005
conf/stoc/2005
STOC
https://doi.org/10.1145/1060590.1060618
db/conf/stoc/stoc2005.html#ChekuriKS05
Sanjeev Khanna
Aravind Srinivasan
Special issue: 35th Annual ACM Symposium on Theory of Computing.
305-
2004
69
J. Comput. Syst. Sci.
3
https://doi.org/10.1016/j.jcss.2004.06.004
db/journals/jcss/jcss69.html#KhannaS04
Chandra Chekuri
Sanjeev Khanna
On Multidimensional Packing Problems.
837-851
2004
33
SIAM J. Comput.
4
https://doi.org/10.1137/S0097539799356265
db/journals/siamcomp/siamcomp33.html#ChekuriK04
Venkatesan Guruswami
Sanjeev Khanna
On the Hardness of 4-Coloring a 3-Colorable Graph.
30-40
2004
18
SIAM J. Discret. Math.
1
https://doi.org/10.1137/S0895480100376794
db/journals/siamdm/siamdm18.html#GuruswamiK04
Chandra Chekuri
Sanjeev Khanna
Joseph Naor
Leonid Zosin
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem.
608-625
2004
18
SIAM J. Discret. Math.
3
https://doi.org/10.1137/S0895480101396937
db/journals/siamdm/siamdm18.html#ChekuriKNZ04
Peter Buneman
Sanjeev Khanna
Keishi Tajima
Wang Chiew Tan
Archiving scientific data.
2-42
2004
29
ACM Trans. Database Syst.
https://doi.org/10.1145/974750.974752
db/journals/tods/tods29.html#BunemanKTT04
Chandra Chekuri
Sanjeev Khanna
F. Bruce Shepherd
Edge-Disjoint Paths in Planar Graphs.
71-80
2004
conf/focs/2004
FOCS
https://doi.org/10.1109/FOCS.2004.27
https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.27
db/conf/focs/focs2004.html#ChekuriKS04
Julia Chuzhoy
Sudipto Guha
Sanjeev Khanna
Joseph Naor
Machine Minimization for Scheduling Jobs with Interval Constraints.
81-90
2004
conf/focs/2004
FOCS
https://doi.org/10.1109/FOCS.2004.38
https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.38
db/conf/focs/focs2004.html#ChuzhoyGKN04
Andreas Björklund
Thore Husfeldt
Sanjeev Khanna
Approximating Longest Directed Paths and Cycles.
222-233
https://doi.org/10.1007/978-3-540-27836-8_21
2004
conf/icalp/2004
ICALP
db/conf/icalp/icalp2004.html#BjorklundHK04
Carl A. Gunter
Sanjeev Khanna
Kaijun Tan
Santosh S. Venkatesh
DoS Protection for Reliably Authenticated Broadcast.
2004
conf/ndss/2004
NDSS
https://www.ndss-symposium.org/ndss2004/dos-protection-reliably-authenticated-broadcast/
db/conf/ndss/ndss2004.html#GunterKTV04
Michael Greenwald
Sanjeev Khanna
Power-Conserving Computation of Order-Statistics over Sensor Networks.
2004
conf/pods/2004
PODS
https://doi.org/10.1145/1055558.1055597
http://www.acm.org/sigmod/pods/proc04/pdf/P-28.pdf
db/conf/pods/pods2004.html#GreenwaldK04
275-285
Tugkan Batu
Sampath Kannan
Sanjeev Khanna
Andrew McGregor 0001
Reconstructing strings from random traces.
910-918
2004
conf/soda/2004
SODA
http://dl.acm.org/citation.cfm?id=982792.982929
db/conf/soda/soda2004.html#BatuKKM04
Volkan Isler
Sampath Kannan
Sanjeev Khanna
Randomized pursuit-evasion with limited visibility.
1060-1069
2004
conf/soda/2004
SODA
http://dl.acm.org/citation.cfm?id=982792.982950
db/conf/soda/soda2004.html#IslerKK04
Julia Chuzhoy
Sudipto Guha
Eran Halperin
Sanjeev Khanna
Guy Kortsarz
Joseph Naor
Asymmetric k-center is log* n-hard to approximate.
21-27
2004
conf/stoc/2004
STOC
https://doi.org/10.1145/1007352.1007363
db/conf/stoc/stoc2004.html#ChuzhoyGHKKN04
Chandra Chekuri
Sanjeev Khanna
F. Bruce Shepherd
The all-or-nothing multicommodity flow problem.
156-165
2004
conf/stoc/2004
STOC
https://doi.org/10.1145/1007352.1007383
db/conf/stoc/stoc2004.html#ChekuriKS04
Chandra Chekuri
Ashish Goel
Sanjeev Khanna
Amit Kumar 0001
Multi-processor scheduling to minimize flow time with epsilon resource augmentation.
363-372
2004
conf/stoc/2004
STOC
https://doi.org/10.1145/1007352.1007411
db/conf/stoc/stoc2004.html#ChekuriGKK04
Stanislav Angelov
Sanjeev Khanna
Li Li
Fernando Pereira
ATDD: An Algorithmic Tool for Domain Discovery in Protein Sequences.
206-217
https://doi.org/10.1007/978-3-540-30219-3_18
2004
conf/wabi/2004
WABI
db/conf/wabi/wabi2004.html#AngelovKLP04
Stanislav Angelov
Boulos Harb
Sampath Kannan
Sanjeev Khanna
Junhyong Kim
Li-San Wang
Genome Identification and Classification by Short Oligo Arrays.
400-411
https://doi.org/10.1007/978-3-540-30219-3_34
2004
conf/wabi/2004
WABI
db/conf/wabi/wabi2004.html#AngelovHKKKW04
Volkan Isler
Sampath Kannan
Sanjeev Khanna
Locating and Capturing an Evader in a Polygonal Environment.
251-266
2004
WAFR
https://doi.org/10.1007/10991541_18
conf/wafr/2004
db/conf/wafr/wafr2004.html#IslerKK04
Klaus Jansen
Sanjeev Khanna
José D. P. Rolim
Dana Ron
Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings
3122
3-540-22894-2
APPROX-RANDOM
Lecture Notes in Computer Science
Springer
2004
https://doi.org/10.1007/b99805
db/conf/approx/approx2004.html
Chandra Chekuri
Sanjeev Khanna
Approximation Algorithms for Minimizing AverageWeighted Completion Time.
2004
Handbook of Scheduling
http://www.crcnetbase.com/doi/abs/10.1201/9780203489802.ch11
reference/crc/2004sch
db/reference/crc/sch2004.html#ChekuriK04
Micah Adler
Sanjeev Khanna
Rajmohan Rajaraman
Adi Rosén
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
123-152
2003
36
Algorithmica
2
https://doi.org/10.1007/s00453-002-1019-9
db/journals/algorithmica/algorithmica36.html#AdlerKR03
Venkatesan Guruswami
Sanjeev Khanna
Rajmohan Rajaraman
F. Bruce Shepherd
Mihalis Yannakakis
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems.
473-496
2003
67
J. Comput. Syst. Sci.
3
https://doi.org/10.1016/S0022-0000(03)00066-7
db/journals/jcss/jcss67.html#GuruswamiKRSY03
Volkan Isler
John R. Spletzer
Sanjeev Khanna
Camillo J. Taylor
Target tracking with distributed sensors: the focus of attention problem.
792-798
2003
IROS
https://doi.org/10.1109/IROS.2003.1250726
conf/iros/2003
db/conf/iros/iros2003.html#IslerSKT03
Sampath Kannan
Sanjeev Khanna
Selection with monotone comparison cost.
10-17
2003
conf/soda/2003
SODA
http://dl.acm.org/citation.cfm?id=644108.644111
db/conf/soda/soda2003.html#KannanK03
Chandra Chekuri
Sanjeev Khanna
Edge disjoint paths revisited.
628-637
2003
conf/soda/2003
SODA
http://dl.acm.org/citation.cfm?id=644108.644212
db/conf/soda/soda2003.html#ChekuriK03
Andreas Björklund
Thore Husfeldt
Sanjeev Khanna
Approximating Longest Directed Path
Electron. Colloquium Comput. Complex.
2003
TR03-032
TR03
db/journals/eccc/eccc10.html#ECCC-TR03-032
https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-032/index.html
Julia Chuzhoy
Sudipto Guha
Sanjeev Khanna
Joseph Naor
Asymmetric k-center is log*n-hard to Approximate
Electron. Colloquium Comput. Complex.
2003
TR03
TR03-038
db/journals/eccc/eccc10.html#ECCC-TR03-038
https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-038/index.html
Sanjeev Khanna
Guest Editor's Foreword.
749
2002
64
J. Comput. Syst. Sci.
4
https://doi.org/10.1006/jcss.2002.1825
db/journals/jcss/jcss64.html#Khanna02
Sanjeev Khanna
Joseph Naor
Danny Raz
Control Message Aggregation in Group Communication Protocols.
135-146
2002
conf/icalp/2002
ICALP
https://doi.org/10.1007/3-540-45465-9_13
db/conf/icalp/icalp2002.html#KhannaNR02
Peter Buneman
Sanjeev Khanna
Wang Chiew Tan
On Propagation of Deletions and Annotations Through Views.
150-158
2002
conf/pods/2002
PODS
https://doi.org/10.1145/543613.543633
http://www.acm.org/sigs/sigmod/pods/proc02/papers/150-BunemanKT.pdf
db/conf/pods/pods02.html#BunemanKT02
Peter Buneman
Sanjeev Khanna
Keishi Tajima
Wang Chiew Tan
Archiving scientific data.
1-12
2002
conf/sigmod/2002
SIGMOD Conference
https://doi.org/10.1145/564691.564693
db/conf/sigmod/sigmod2002.html#BunemanKTT02
Chandra Chekuri
Sanjeev Khanna
Approximation schemes for preemptive weighted flow time.
297-305
2002
conf/stoc/2002
STOC
https://doi.org/10.1145/509907.509954
db/conf/stoc/stoc2002.html#ChekuriK02
Nadia Creignou
Sanjeev Khanna
Madhu Sudan 0001
Complexity classifications of Boolean constraint satisfaction problems.
I-XII, 1-106
SIAM
2001
SIAM monographs on discrete mathematics and applications
7
978-0-89871-479-1
Chandra Chekuri
Sanjeev Khanna
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines.
848-861
2001
conf/icalp/2001
ICALP
https://doi.org/10.1007/3-540-48224-5_69
db/conf/icalp/icalp2001.html#ChekuriK01
Peter Buneman
Sanjeev Khanna
Wang Chiew Tan
Why and Where: A Characterization of Data Provenance.
2001
conf/icdt/2001
ICDT
db/conf/icdt/icdt2001.html#BunemanKT01
316-330
https://doi.org/10.1007/3-540-44503-X_20
...
conf/icde/Woodruff97
books/mk/BunemanSA99
books/aw/AbiteboulHV95
journals/jodl/AbiteboulQMWW97
...
conf/icde/CuiW00
www/org/w3/TR/NOTE-xml-ql
...
...
journals/jacm/Klug88
conf/pods/Wong93
conf/sigmod/BunemanDHS96
conf/icde/PapakonstantinouGW95
...
...
conf/sigmod/ZhugeGHW95
Sanjeev Khanna
Wang Chiew Tan
On Computing Functions with Uncertainty.
2001
conf/pods/2001
PODS
db/conf/pods/pods2001.html#KhannaT01
https://doi.org/10.1145/375551.375577
http://www.acm.org/sigs/sigmod/pods/proc01/online/p110.pdf
Maria Adamou
Sanjeev Khanna
Insup Lee 0001
Insik Shin
Shiyu Zhou
Fair Real-Time Traffic Scheduling over a Wireless LA.
279-288
2001
conf/rtss/2001
RTSS
https://doi.org/10.1109/REAL.2001.990624
https://doi.ieeecomputersociety.org/10.1109/REAL.2001.990624
db/conf/rtss/rtss2001.html#AdamouKLSZ01
Michael Greenwald
Sanjeev Khanna
Space-Efficient Online Computation of Quantile Summaries.
58-66
2001
conf/sigmod/2001
SIGMOD Conference
db/conf/sigmod/sigmod2001.html#GreenwaldK01
https://doi.org/10.1145/375663.375670
https://doi.org/10.1145/376284.375670
Chandra Chekuri
Sanjeev Khanna
Joseph Naor
Leonid Zosin
Approximation algorithms for the metric labeling problem via a new linear programming formulation.
109-118
2001
conf/soda/2001
SODA
http://dl.acm.org/citation.cfm?id=365411.365426
db/conf/soda/soda2001.html#ChekuriKNZ01
Chandra Chekuri
Sanjeev Khanna
Joseph Naor
A deterministic algorithm for the cost-distance problem.
232-233
2001
conf/soda/2001
SODA
http://dl.acm.org/citation.cfm?id=365411.365452
db/conf/soda/soda2001.html#ChekuriKN01
Chandra Chekuri
Sanjeev Khanna
An Zhu
Algorithms for minimizing weighted flow time.
84-93
2001
conf/stoc/2001
STOC
https://doi.org/10.1145/380752.380778
db/conf/stoc/stoc2001.html#ChekuriKZ01
Chandra Chekuri
Sanjeev Khanna
Approximation Schemes for Preemptive Weighted Flow Time
Electron. Colloquium Comput. Complex.
2001
TR01
TR01-065
db/journals/eccc/eccc8.html#ECCC-TR01-065
https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-065/index.html
Sanjeev Khanna
Nathan Linial
Shmuel Safra
On the Hardness of Approximating the Chromatic Number.
393-415
2000
20
Comb.
3
https://doi.org/10.1007/s004930070013
db/journals/combinatorica/combinatorica20.html#KhannaLS00
Sanjeev Khanna
Shiyu Zhou
On Indexed Data Broadcast
575-591
2000
60
J. Comput. Syst. Sci.
3
db/journals/jcss/jcss60.html#KhannaZ00
https://doi.org/10.1006/jcss.1999.1688
Sanjeev Khanna
Vincenzo Liberatore
On Broadcast Disk Paging.
1683-1702
2000
29
SIAM J. Comput.
5
db/journals/siamcomp/siamcomp29.html#KhannaL00
https://doi.org/10.1137/S0097539798341399
Sanjeev Khanna
Madhu Sudan 0001
Luca Trevisan
David P. Williamson
The Approximability of Constraint Satisfaction Problems.
1863-1920
2000
30
SIAM J. Comput.
6
https://doi.org/10.1137/S0097539799349948
db/journals/siamcomp/siamcomp30.html#KhannaSTW00
Venkatesan Guruswami
Sanjeev Khanna
On the Hardness of 4-Coloring a 3-Colorable Graph.
188-197
2000
conf/coco/2000
CCC
https://doi.org/10.1109/CCC.2000.856749
https://doi.ieeecomputersociety.org/10.1109/CCC.2000.856749
https://www.wikidata.org/entity/Q56269091
db/conf/coco/coco2000.html#GuruswamiK00
Peter Buneman
Sanjeev Khanna
Wang Chiew Tan
Data Provenance: Some Basic Issues.
87-93
2000
conf/fsttcs/2000
FSTTCS
https://doi.org/10.1007/3-540-44450-5_6
db/conf/fsttcs/fsttcs2000.html#BunemanKT00
Chandra Chekuri
Sanjeev Khanna
A PTAS for the multiple knapsack problem.
213-222
2000
conf/soda/2000
SODA
http://dl.acm.org/citation.cfm?id=338219.338254
db/conf/soda/soda2000.html#ChekuriK00
Leana Golubchik
Sanjeev Khanna
Samir Khuller
Ramakrishna Thurimella
An Zhu
Approximation algorithms for data placement on parallel disks.
223-232
2000
conf/soda/2000
SODA
http://dl.acm.org/citation.cfm?id=338219.338255
db/conf/soda/soda2000.html#GolubchikKKTZ00
Sanjeev Khanna
Francis Zane
Watermarking maps: hiding information in structured data.
596-605
2000
conf/soda/2000
SODA
http://dl.acm.org/citation.cfm?id=338219.338612
db/conf/soda/soda2000.html#KhannaZ00
Sanjeev Khanna
Joseph Naor
F. Bruce Shepherd
Directed network design with orientation constraints.
663-671
2000
conf/soda/2000
SODA
http://dl.acm.org/citation.cfm?id=338219.338620
db/conf/soda/soda2000.html#KhannaNS00
Venkatesan Guruswami
Sanjeev Khanna
On the Hardness of 4-coloring a 3-colorable Graph
Electron. Colloquium Comput. Complex.
2000
TR00
TR00-073
db/journals/eccc/eccc7.html#ECCC-TR00-073
https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-073/index.html
Alok Aggarwal
Don Coppersmith
Sanjeev Khanna
Rajeev Motwani 0001
Baruch Schieber
The Angular-Metric Traveling Salesman Problem.
697-711
1999
29
SIAM J. Comput.
3
db/journals/siamcomp/siamcomp29.html#AggarwalCKMS99
https://doi.org/10.1137/S0097539796312721
Foto N. Afrati
Evripidis Bampis
Chandra Chekuri
David R. Karger
Claire Kenyon
Sanjeev Khanna
Ioannis Milis
Maurice Queyranne
Martin Skutella
Clifford Stein 0001
Maxim Sviridenko
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
32-44
1999
conf/focs/1999
FOCS
https://doi.org/10.1109/SFFCS.1999.814574
https://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814574
db/conf/focs/focs99.html#AfratiBCKKKMQSSS99
Yevgeniy Dodis
Sanjeev Khanna
Space Time Tradeoffs for Graph Properties.
291-300
https://doi.org/10.1007/3-540-48523-6_26
1999
conf/icalp/99
ICALP
db/conf/icalp/icalp99.html#DodisK99
Matthew Andrews
Sanjeev Khanna
Krishnan Kumaran
Integrated Scheduling of Unicast and Multicast Traffic in an Input-Queued Switch.
1144-1151
1999
conf/infocom/1999
INFOCOM
db/conf/infocom/infocom1999-3.html#AndrewsKK99
https://doi.org/10.1109/INFCOM.1999.751670
https://doi.ieeecomputersociety.org/10.1109/INFCOM.1999.751670
Susanne Albers
Sanjeev Arora
Sanjeev Khanna
Page Replacement for General Caching Problems.
31-40
1999
conf/soda/1999
SODA
http://dl.acm.org/citation.cfm?id=314500.314528
db/conf/soda/soda99.html#AlbersAK99
Chandra Chekuri
Sanjeev Khanna
On Multi-Dimensional Packing Problems.
185-194
1999
conf/soda/1999
SODA
http://dl.acm.org/citation.cfm?id=314500.314555
db/conf/soda/soda99.html#ChekuriK99
Yevgeniy Dodis
Venkatesan Guruswami
Sanjeev Khanna
The 2-Catalog Segmentation Problem.
897-898
1999
conf/soda/1999
SODA
http://dl.acm.org/citation.cfm?id=314500.315075
db/conf/soda/soda99.html#DodisGK99
Micah Adler
Sanjeev Khanna
Rajmohan Rajaraman
Adi Rosén
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
1-12
1999
conf/spaa/1999
SPAA
https://doi.org/10.1145/305619.305620
db/conf/spaa/spaa99.html#AdlerKRR99
Venkatesan Guruswami
Sanjeev Khanna
Rajmohan Rajaraman
F. Bruce Shepherd
Mihalis Yannakakis
Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems.
19-28
1999
conf/stoc/1999
STOC
https://doi.org/10.1145/301250.301262
db/conf/stoc/stoc1999.html#GuruswamiKRSY99
Yevgeniy Dodis
Sanjeev Khanna
Design Networks with Bounded Pairwise Distance.
750-759
1999
conf/stoc/1999
STOC
https://doi.org/10.1145/301250.301447
db/conf/stoc/stoc1999.html#DodisK99
Sanjeev Khanna
Rajeev Motwani 0001
Randall H. Wilson
On Certificates and Lookahead in Dynamic Graph Problems.
377-394
1998
21
Algorithmica
4
db/journals/algorithmica/algorithmica21.html#KhannaMW98
https://doi.org/10.1007/PL00009220
Sanjeev Khanna
Rajeev Motwani 0001
Madhu Sudan 0001
Umesh V. Vazirani
On Syntactic versus Computational Views of Approximability.
164-191
1998
28
SIAM J. Comput.
1
db/journals/siamcomp/siamcomp28.html#KhannaMSV98
https://doi.org/10.1137/S0097539795286612
Krishnan Kumaran
Sanjeev Khanna
On Wireless Spectrum Estimation and Generalized Graph Coloring.
1273-1283
1998
conf/infocom/1998
INFOCOM
db/conf/infocom/infocom1998-3.html#KumaranK98
https://doi.org/10.1109/INFCOM.1998.662942
https://doi.ieeecomputersociety.org/10.1109/INFCOM.1998.662942
Sanjeev Khanna
S. Muthukrishnan 0001
Mike Paterson
On Approximating Rectangle Tiling and Packing.
384-393
1998
conf/soda/1998
SODA
db/conf/soda/soda98.html#KhannaMP98
http://dl.acm.org/citation.cfm?id=314613.314768
Sanjeev Khanna
Shiyu Zhou
On Indexed Data Broadcast.
463-472
1998
conf/stoc/1998
STOC
https://doi.org/10.1145/276698.276859
db/conf/stoc/stoc1998.html#KhannaZ98
Sanjeev Khanna
Vincenzo Liberatore
On Broadcast Disk Paging.
634-643
1998
conf/stoc/1998
STOC
https://doi.org/10.1145/276698.276879
db/conf/stoc/stoc1998.html#KhannaL98
Sanjeev Khanna
A polynomial time approximation scheme for the SONET ring loading problem.
36-41
1997
2
Bell Labs Tech. J.
2
https://doi.org/10.1002/bltj.2047
db/journals/bell/bell2.html#Khanna97
Viggo Kann
Sanjeev Khanna
Jens Lagergren
Alessandro Panconesi
On the Hardness of Approximating Max k-Cut and its Dual.
1997
1997
Chic. J. Theor. Comput. Sci.
http://cjtcs.cs.uchicago.edu/articles/1997/2/contents.html
db/journals/cjtcs/cjtcs1997.html#KannKLP97
Sanjeev Khanna
W. Kent Fuchs
A Graph Partitioning Approach to Sequential Diagnosis.
39-47
1997
46
IEEE Trans. Computers
1
db/journals/tc/tc46.html#KhannaF97
https://doi.org/10.1109/12.559801
http://doi.ieeecomputersociety.org/10.1109/12.559801
Sanjeev Khanna
Madhu Sudan 0001
Luca Trevisan
Constraint Satisfaction: The Approximability of Minimization Problems.
282-296
https://doi.org/10.1109/CCC.1997.612323
https://doi.ieeecomputersociety.org/10.1109/CCC.1997.612323
1997
conf/coco/1997
CCC
db/conf/coco/coco97.html#KhannaST97
Sanjeev Khanna
S. Muthukrishnan 0001
Steven Skiena
Efficient Array Partitioning.
616-626
1997
conf/icalp/1997
ICALP
db/conf/icalp/icalp97.html#KhannaMS97
https://doi.org/10.1007/3-540-63165-8_216
Alok Aggarwal
Don Coppersmith
Sanjeev Khanna
Rajeev Motwani 0001
Baruch Schieber
The Angular-Metric Traveling Salesman Problem.
221-229
1997
conf/soda/1997
SODA
db/conf/soda/soda97.html#AggarwalCKMS97
http://dl.acm.org/citation.cfm?id=314161.314259
Sanjeev Khanna
Madhu Sudan 0001
David P. Williamson
A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction.
11-20
1997
conf/stoc/1997
STOC
https://doi.org/10.1145/258533.258538
db/conf/stoc/stoc1997.html#KhannaSW97
Sanjeev Khanna
A structural view of approximation.
Stanford University, USA
1996
https://searchworks.stanford.edu/view/3408563
Viggo Kann
Sanjeev Khanna
Jens Lagergren
Alessandro Panconesi
On the Hardness of Approximating Max k-Cut and Its Dual.
61-67
1996
conf/istcs/1996
ISTCS
db/conf/istcs/istcs1996.html#KannKLP96
Sanjeev Khanna
Rajeev Motwani 0001
Randall H. Wilson
On Certificates and Lookahead in Dynamic Graph Problems.
222-231
1996
conf/soda/1996
SODA
db/conf/soda/soda96.html#KhannaMW96
http://dl.acm.org/citation.cfm?id=313852.314067
Sanjeev Khanna
Rajeev Motwani 0001
Towards a Syntactic Characterization of PTAS.
329-337
1996
conf/stoc/1996
STOC
https://doi.org/10.1145/237814.237979
db/conf/stoc/stoc1996.html#KhannaM96
Sanjeev Khanna
Madhu Sudan 0001
The Optimization Complexity of Constraint Satisfaction Problems
Electron. Colloquium Comput. Complex.
1996
TR96-028
TR96
db/journals/eccc/eccc3.html#ECCC-TR96-028
https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-028/index.html
Sanjeev Khanna
Madhu Sudan 0001
David P. Williamson
A Complete Characterization of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction
Electron. Colloquium Comput. Complex.
1996
TR96-062
TR96
db/journals/eccc/eccc3.html#ECCC-TR96-062
https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-062/index.html
Sanjeev Khanna
Madhu Sudan 0001
Luca Trevisan
Constraint satisfaction: The approximability of minimization problems.
Electron. Colloquium Comput. Complex.
1996
TR96-064
TR96
db/journals/eccc/eccc3.html#ECCC-TR96-064
https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-064/index.html
Sanjeev Khanna
W. Kent Fuchs
A Linear Time Algorithm for Sequential Diagnosis in Hypercubes.
48-53
1995
26
J. Parallel Distributed Comput.
1
db/journals/jpdc/jpdc26.html#KhannaF95
https://doi.org/10.1006/jpdc.1995.1046
Sanjeev Khanna
Rajeev Motwani 0001
Madhu Sudan 0001
Umesh V. Vazirani
On Syntactic versus Computational Views of Approximability
Electron. Colloquium Comput. Complex.
1995
TR95-023
TR95
db/journals/eccc/eccc2.html#ECCC-TR95-023
https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-023/index.html
On Syntactic versus Computational Views of Approximability
Sanjeev Khanna
Rajeev Motwani 0001
Madhu Sudan 0001
Umesh V. Vazirani
819-830
conf/focs/FOCS35
1994
FOCS
db/conf/focs/focs94.html#KhannaMSV94
https://doi.org/10.1109/SFCS.1994.365712
https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365712
Sanjeev Khanna
Nathan Linial
Shmuel Safra
On the Hardness of Approximating the Chromatic Number.
250-260
1993
conf/istcs/1993
ISTCS
db/conf/istcs/istcs1993.html#KhannaLS93
https://doi.org/10.1109/ISTCS.1993.253464
https://doi.ieeecomputersociety.org/10.1109/ISTCS.1993.253464
Kurt Maly
Sanjeev Khanna
Ravi Mukkamala
C. Michael Overstreet
Ramesh Yerraballi
Edwin C. Foudriat
B. Madan
Parallel TCP/IP for Multiprocessor Workstations.
103-118
1992
conf/hpn/1992
HPN
db/conf/hpn/hpn1992.html#MalyKMOYFM92
Kurt Maly
Frank Paterra
C. Michael Overstreet
Ravi Mukkamala
Sanjeev Khanna
Concurrent Use of Parallel Communication to Enable Remote Visualization.
449-452
1992
conf/icci/1992
ICCI
db/conf/icci/icci1992.html#MalyPOMK92
Kurt Maly
Sanjeev Khanna
C. Michael Overstreet
Ravi Mukkamala
Mohammad Zubair
Y. S. Sekhar
Multiprocessor Architectures for High Speed Networks: A Performance Study.
645-651
1992
conf/ifip/1992-1
IFIP Congress (1)
db/conf/ifip/ifip92-1.html#MalyKOMZS92
Edwin C. Foudriat
Kurt Maly
C. Michael Overstreet
Sanjeev Khanna
Frank Paterra
A carrier sensed multiple access protocol high data rate ring networks.
59-70
1991
21
Comput. Commun. Rev.
2
https://doi.org/10.1145/122419.122423
db/journals/ccr/ccr21.html#FoudriatMOKP91
Sanjeev Khanna
Logic Programming for Software Verification and Testing.
350-357
1991
34
Comput. J.
4
db/journals/cj/cj34.html#Khanna91
https://doi.org/10.1093/comjnl/34.4.350
Sanjeev Khanna
Logic Programming for Software Testing.
225-234
1990
conf/icci/1990
ICCI
db/conf/icci/icci90.html#Khanna90
https://doi.org/10.1007/3-540-53504-7_79
Maria Adamou
Micah Adler
Foto N. Afrati
Arpit Agarwal
Shivani Agarwal 0001
Alok Aggarwal
Susanne Albers
Cezar-Mihail Alexandru
Rajeev Alur
Matthew Andrews
Stanislav Angelov
Sanjeev Arora
Mudabir Kabir Asathulla
Sepehr Assadi
Evripidis Bampis
Nikhil Bansal 0001
Zhuowei Bao
Tugkan Batu
Soheil Behnezhad
Anand Bhalgat
Olivier Biton
Andreas Björklund
Christian Borgs
Sarah Cohen Boulakia
Mickey BrautbarMichael Brautbar
Patrick Briest
Peter Buneman
Deeparnab Chakrabarty
Tanmoy Chakraborty 0001
Parinya Chalermsook
Moses Charikar
Jennifer T. Chayes
Chandra Chekuri
Yi Chen 0001
Yu Chen 0039
Ashish Chiplunkar
Marek Chrobak
Julia Chuzhoy
Don Coppersmith
Nadia Creignou
Susan B. Davidson
Anindya De
Yevgeniy Dodis
Moez Draief
Anat Eyal
Omid Fatemieh
Uriel Feige
Edwin C. Foudriat
W. Kent Fuchs
Marco Gaboardi
Naveen Garg 0001
Ashish Goel
Leana Golubchik
Geoffrey J. Gordon
Sanjeev Goyal
Michael B. GreenwaldMichael Greenwald
Sudipto Guha
Carl A. Gunter
Alexander J. T. Gurney
Venkatesan Guruswami
Andreas Haeberlen
Mohammad HajiaghayiMohammad Taghi Hajiaghayi
Eran Halperin
Boulos Harb
Ahmed Hefny
Brett Hemenway
Justin Hsu
Zhiyi Huang 0002
Thore Husfeldt
Volkan Isler
Zachary G. Ives
Shahin Jabbari
Klaus Jansen
Kishor Jothimurugan
Brendan Juba
Adam Tauman Kalai
Viggo Kann
Sampath Kannan
Michael Kapralov
David R. Karger
Robert E. Kass
Michael KearnsMichael J. Kearns
Fariba Khan
Samir Khuller
Junhyong Kim
Christian Konrad 0001
Guy Kortsarz
Nitish Korula
Robert Krauthgamer
Amit Kumar 0001
Krishnan Kumaran
Keshav Kunal
Bundit Laekhanukit
Jens Lagergren
Nathaniel Lahn
Daniel H. Larkin
Insup Lee 0001
Ulf Leser
Fei Li 0001
Huan Li
Li Li
Shi Li 0001
Yang Li 0025
Vincenzo Liberatore
Nathan Linial
Brendan Lucier
B. Madan
Kurt Maly
Konstantinos Mamouras
Yannis Mantzouratos
Claire MathieuClaire Kenyon
Andrew McGregor 0001
Ioannis Milis
Tova Milo
Jamie Morgenstern
Rajeev Motwani 0001
Aida Sadat MousavifarAida Mousavifar
Ravi Mukkamala
S. Muthukrishnan 0001
Ansh Nagda
Danupon Nanongkai
Joseph NaorSeffi Naor
Arjun Narayan
Hesam Nikpey
MohammadHesam NikpeySalekde
Aline Normoyle
Brad Null
C. Michael Overstreet
Alessandro Panconesi
Debmalya Panigrahi
Frank Paterra
Mike Paterson
Prathamesh Patil
Fernando Pereira
Yuval Peres
Benjamin C. Pierce
Aaron L. Putterman
Maurice Queyranne
Mukund Raghothaman
Sharath Raghvendra
Rajmohan Rajaraman
Danny Raz
José D. P. Rolim
Dana Ron
Adi Rosén
Aaron Roth 0001
Sudeepa Roy
Alla Safonova
Shmuel Safra
Baruch Schieber
Alan Schmitt
Y. S. Sekhar
F. Bruce Shepherd
Insik Shin
Steven Skiena
Martin Skutella
Matthew A. Smith 0001
John R. Spletzer
Aravind Srinivasan
Johannes Starlinger
Clifford Stein 0001
Julia Stoyanovich
Madhu Sudan 0001
Maxim Sviridenko
Keishi Tajima
Kunal Talwar
Kaijun Tan
Wang Chiew Tan
Zihan Tan
Val Tannen
Robert E. TarjanRobert Endre Tarjan
Camillo J. Taylor
Ramakrishna Thurimella
Tarik Tosun
Luca Trevisan
Umesh V. Vazirani
Ameya Velingker
Santosh S. Venkatesh
Mirkó Visontai
Rakesh V. VohraRakesh Vohra
Chen Wang
Li-San Wang
Nathan White
David P. Williamson
Randall H. Wilson
Mihalis Yannakakis
Grigory Yaroslavtsev
Ramesh Yerraballi
Mark Yim
Francis Zane
Hongyang R. ZhangHongyang Zhang 0005
Lisa Zhang
Liming Zhao
Peilin Zhong
Shiyu Zhou
An Zhu
Leonid Zosin
Mohammad Zubair