Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sanjeev Khanna
@inproceedings{DBLP:conf/soda/ChuzhoyK24,
author = {Julia Chuzhoy and
Sanjeev Khanna},
editor = {David P. Woodruff},
title = {A Faster Combinatorial Algorithm for Maximum Bipartite Matching},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {2185--2235},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.79},
doi = {10.1137/1.9781611977912.79},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChuzhoyK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgarwalKLPWWZ24,
author = {Arpit Agarwal and
Sanjeev Khanna and
Huan Li and
Prathamesh Patil and
Chen Wang and
Nathan White and
Peilin Zhong},
editor = {David P. Woodruff},
title = {Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic
Depth},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {3997--4061},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.140},
doi = {10.1137/1.9781611977912.140},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AgarwalKLPWWZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhannaPS24,
author = {Sanjeev Khanna and
Aaron (Louie) Putterman and
Madhu Sudan},
editor = {David P. Woodruff},
title = {Code Sparsification and its Applications},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {5145--5168},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.185},
doi = {10.1137/1.9781611977912.185},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KhannaPS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-13151,
author = {Sanjeev Khanna and
Aaron (Louie) Putterman and
Madhu Sudan},
title = {Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs},
journal = {CoRR},
volume = {abs/2402.13151},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.13151},
doi = {10.48550/ARXIV.2402.13151},
eprinttype = {arXiv},
eprint = {2402.13151},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-13151.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-14950,
author = {Arpit Agarwal and
Sanjeev Khanna and
Huan Li and
Prathamesh Patil and
Chen Wang and
Nathan White and
Peilin Zhong},
title = {Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic
Depth},
journal = {CoRR},
volume = {abs/2402.14950},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.14950},
doi = {10.48550/ARXIV.2402.14950},
eprinttype = {arXiv},
eprint = {2402.14950},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-14950.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0039KT23,
author = {Yu Chen and
Sanjeev Khanna and
Zihan Tan},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Sublinear Algorithms and Lower Bounds for Estimating {MST} and {TSP}
Cost in General Metrics},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {37:1--37:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.37},
doi = {10.4230/LIPICS.ICALP.2023.37},
timestamp = {Wed, 05 Jul 2023 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/icalp/0039KT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Khanna0A23,
author = {Sanjeev Khanna and
Christian Konrad and
Cezar{-}Mihail Alexandru},
editor = {Floris Geerts and
Hung Q. Ngo and
Stavros Sintos},
title = {Set Cover in the One-pass Edge-arrival Streaming Model},
booktitle = {Proceedings of the 42nd {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2023, Seattle, WA, USA, June 18-23, 2023},
pages = {127--139},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3584372.3588678},
doi = {10.1145/3584372.3588678},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/Khanna0A23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/0039KT23,
author = {Yu Chen and
Sanjeev Khanna and
Zihan Tan},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Query Complexity of the Metric Steiner Tree Problem},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {4893--4935},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch179},
doi = {10.1137/1.9781611977554.CH179},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/0039KT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiBKL23,
author = {Sepehr Assadi and
Soheil Behnezhad and
Sanjeev Khanna and
Huan Li},
editor = {Barna Saha and
Rocco A. Servedio},
title = {On Regularity Lemma and Barriers in Streaming and Dynamic Matching},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {131--144},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585110},
doi = {10.1145/3564246.3585110},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiBKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-00788,
author = {Sanjeev Khanna and
Aaron (Louie) Putterman and
Madhu Sudan},
title = {Code Sparsification and its Applications},
journal = {CoRR},
volume = {abs/2311.00788},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.00788},
doi = {10.48550/ARXIV.2311.00788},
eprinttype = {arXiv},
eprint = {2311.00788},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-00788.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-12584,
author = {Julia Chuzhoy and
Sanjeev Khanna},
title = {A Faster Combinatorial Algorithm for Maximum Bipartite Matching},
journal = {CoRR},
volume = {abs/2312.12584},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.12584},
doi = {10.48550/ARXIV.2312.12584},
eprinttype = {arXiv},
eprint = {2312.12584},
timestamp = {Wed, 17 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-12584.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/AgarwalKP22,
author = {Arpit Agarwal and
Sanjeev Khanna and
Prathamesh Patil},
editor = {Gustau Camps{-}Valls and
Francisco J. R. Ruiz and
Isabel Valera},
title = {{PAC} Top-k Identification under {SST} in Limited Rounds},
booktitle = {International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2022, 28-30 March 2022, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {151},
pages = {6814--6839},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v151/agarwal22a.html},
timestamp = {Sat, 30 Sep 2023 09:34:08 +0200},
biburl = {https://dblp.org/rec/conf/aistats/AgarwalKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AgarwalKP22,
author = {Arpit Agarwal and
Sanjeev Khanna and
Prathamesh Patil},
editor = {Po{-}Ling Loh and
Maxim Raginsky},
title = {A Sharp Memory-Regret Trade-off for Multi-Pass Streaming Bandits},
booktitle = {Conference on Learning Theory, 2-5 July 2022, London, {UK}},
series = {Proceedings of Machine Learning Research},
volume = {178},
pages = {1423--1462},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v178/agarwal22a.html},
timestamp = {Tue, 12 Jul 2022 17:36:51 +0200},
biburl = {https://dblp.org/rec/conf/colt/AgarwalKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenKL22,
author = {Yu Chen and
Sanjeev Khanna and
Huan Li},
title = {On Weighted Graph Sparsification by Linear Sketching},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {474--485},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00052},
doi = {10.1109/FOCS54457.2022.00052},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChenKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/KhannaK22,
author = {Sanjeev Khanna and
Christian Konrad},
editor = {Mark Braverman},
title = {Optimal Bounds for Dominating Set in Graph Streams},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {93:1--93:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.93},
doi = {10.4230/LIPICS.ITCS.2022.93},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/KhannaK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AgarwalKLP22,
author = {Arpit Agarwal and
Sanjeev Khanna and
Huan Li and
Prathamesh Patil},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Sublinear Algorithms for Hierarchical Clustering},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/16466b6c95c5924784486ac5a3feeb65-Abstract-Conference.html},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/AgarwalKLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BehnezhadK22,
author = {Soheil Behnezhad and
Sanjeev Khanna},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {New Trade-Offs for Fully Dynamic Matching via Hierarchical {EDCS}},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {3529--3566},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.140},
doi = {10.1137/1.9781611977073.140},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BehnezhadK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/DeKLN22,
author = {Anindya De and
Sanjeev Khanna and
Huan Li and
Hesam Nikpey},
editor = {Karl Bringmann and
Timothy M. Chan},
title = {Nearly Tight Bounds for Discrete Search under Outlier Noise},
booktitle = {5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual
Conference, January 10-11, 2022},
pages = {161--173},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977066.11},
doi = {10.1137/1.9781611977066.11},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/DeKLN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-02905,
author = {Soheil Behnezhad and
Sanjeev Khanna},
title = {New Trade-Offs for Fully Dynamic Matching via Hierarchical {EDCS}},
journal = {CoRR},
volume = {abs/2201.02905},
year = {2022},
url = {https://arxiv.org/abs/2201.02905},
eprinttype = {arXiv},
eprint = {2201.02905},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-02905.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-14798,
author = {Yu Chen and
Sanjeev Khanna and
Zihan Tan},
title = {Sublinear Algorithms and Lower Bounds for Estimating {MST} and {TSP}
Cost in General Metrics},
journal = {CoRR},
volume = {abs/2203.14798},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.14798},
doi = {10.48550/ARXIV.2203.14798},
eprinttype = {arXiv},
eprint = {2203.14798},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-14798.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-00984,
author = {Arpit Agarwal and
Sanjeev Khanna and
Prathamesh Patil},
title = {A Sharp Memory-Regret Trade-Off for Multi-Pass Streaming Bandits},
journal = {CoRR},
volume = {abs/2205.00984},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.00984},
doi = {10.48550/ARXIV.2205.00984},
eprinttype = {arXiv},
eprint = {2205.00984},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-00984.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-07633,
author = {Arpit Agarwal and
Sanjeev Khanna and
Huan Li and
Prathamesh Patil},
title = {Sublinear Algorithms for Hierarchical Clustering},
journal = {CoRR},
volume = {abs/2206.07633},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.07633},
doi = {10.48550/ARXIV.2206.07633},
eprinttype = {arXiv},
eprint = {2206.07633},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-07633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-09354,
author = {Sepehr Assadi and
Soheil Behnezhad and
Sanjeev Khanna and
Huan Li},
title = {On Regularity Lemma and Barriers in Streaming and Dynamic Matching},
journal = {CoRR},
volume = {abs/2207.09354},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.09354},
doi = {10.48550/ARXIV.2207.09354},
eprinttype = {arXiv},
eprint = {2207.09354},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-09354.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-07729,
author = {Yu Chen and
Sanjeev Khanna and
Huan Li},
title = {On Weighted Graph Sparsification by Linear Sketching},
journal = {CoRR},
volume = {abs/2209.07729},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.07729},
doi = {10.48550/ARXIV.2209.07729},
eprinttype = {arXiv},
eprint = {2209.07729},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-07729.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03893,
author = {Yu Chen and
Sanjeev Khanna and
Zihan Tan},
title = {Query Complexity of the Metric Steiner Tree Problem},
journal = {CoRR},
volume = {abs/2211.03893},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03893},
doi = {10.48550/ARXIV.2211.03893},
eprinttype = {arXiv},
eprint = {2211.03893},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03893.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChakrabartyK21,
author = {Deeparnab Chakrabarty and
Sanjeev Khanna},
title = {Better and simpler error analysis of the Sinkhorn-Knopp algorithm
for matrix scaling},
journal = {Math. Program.},
volume = {188},
number = {1},
pages = {395--407},
year = {2021},
url = {https://doi.org/10.1007/s10107-020-01503-3},
doi = {10.1007/S10107-020-01503-3},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ChakrabartyK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AssadiKL21,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
title = {Tight Bounds for Single-Pass Streaming Complexity of the Set Cover
Problem},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {3},
year = {2021},
url = {https://doi.org/10.1137/16M1095482},
doi = {10.1137/16M1095482},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AssadiKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AssadiCK21,
author = {Sepehr Assadi and
Deeparnab Chakrabarty and
Sanjeev Khanna},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Graph Connectivity and Single Element Recovery via Linear and {OR}
Queries},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {7:1--7:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.7},
doi = {10.4230/LIPICS.ESA.2021.7},
timestamp = {Tue, 31 Aug 2021 14:18:27 +0200},
biburl = {https://dblp.org/rec/conf/esa/AssadiCK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabartyCK21,
author = {Deeparnab Chakrabarty and
Yu Chen and
Sanjeev Khanna},
title = {A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular
Function Minimization},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {37--48},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00013},
doi = {10.1109/FOCS52979.2021.00013},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChakrabartyCK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChenKN21,
author = {Yu Chen and
Sanjeev Khanna and
Ansh Nagda},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling
Queries},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {53:1--53:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.53},
doi = {10.4230/LIPICS.ICALP.2021.53},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChenKN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/DeKLN21,
author = {Anindya De and
Sanjeev Khanna and
Huan Li and
MohammadHesam NikpeySalekde},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Approximate optimization of convex functions with outlier noise},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {8147--8157},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/44b422a6d1df1d47db5d50a8d0aaca5d-Abstract.html},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/DeKLN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GargKK21,
author = {Naveen Garg and
Sanjeev Khanna and
Amit Kumar},
editor = {D{\'{a}}niel Marx},
title = {Hardness of Approximation for Orienteering with Multiple Time Windows},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2977--2990},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.177},
doi = {10.1137/1.9781611976465.177},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/GargKK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-10386,
author = {Yu Chen and
Sanjeev Khanna and
Ansh Nagda},
title = {Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling
Queries},
journal = {CoRR},
volume = {abs/2106.10386},
year = {2021},
url = {https://arxiv.org/abs/2106.10386},
eprinttype = {arXiv},
eprint = {2106.10386},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-10386.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-07474,
author = {Deeparnab Chakrabarty and
Yu Chen and
Sanjeev Khanna},
title = {A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular
Function Minimization and Matroid Intersection},
journal = {CoRR},
volume = {abs/2111.07474},
year = {2021},
url = {https://arxiv.org/abs/2111.07474},
eprinttype = {arXiv},
eprint = {2111.07474},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-07474.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AsathullaKLR20,
author = {Mudabir Kabir Asathulla and
Sanjeev Khanna and
Nathaniel Lahn and
Sharath Raghvendra},
title = {A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in
Planar Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {1},
pages = {2:1--2:30},
year = {2020},
url = {https://doi.org/10.1145/3365006},
doi = {10.1145/3365006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AsathullaKLR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenKN20,
author = {Yu Chen and
Sanjeev Khanna and
Ansh Nagda},
editor = {Sandy Irani},
title = {Near-linear Size Hypergraph Cut Sparsifiers},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {61--72},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00015},
doi = {10.1109/FOCS46700.2020.00015},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChenKK20,
author = {Yu Chen and
Sampath Kannan and
Sanjeev Khanna},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Sublinear Algorithms and Lower Bounds for Metric {TSP} Cost Estimation},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {30:1--30:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.30},
doi = {10.4230/LIPICS.ICALP.2020.30},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChenKK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DeKLN20,
author = {Anindya De and
Sanjeev Khanna and
Huan Li and
Hesam Nikpey},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {An Efficient {PTAS} for Stochastic Load Balancing with Poisson Jobs},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {37:1--37:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.37},
doi = {10.4230/LIPICS.ICALP.2020.37},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DeKLN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/0001AKP20,
author = {Arpit Agarwal and
Shivani Agarwal and
Sanjeev Khanna and
Prathamesh Patil},
title = {Rank Aggregation from Pairwise Comparisons in the Presence of Adversarial
Corruptions},
booktitle = {Proceedings of the 37th International Conference on Machine Learning,
{ICML} 2020, 13-18 July 2020, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {119},
pages = {85--95},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v119/agarwal20a.html},
timestamp = {Tue, 15 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/0001AKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AlurCJK20,
author = {Rajeev Alur and
Yu Chen and
Kishor Jothimurugan and
Sanjeev Khanna},
editor = {Holger Hermanns and
Lijun Zhang and
Naoki Kobayashi and
Dale Miller},
title = {Space-efficient Query Evaluation over Probabilistic Event Streams},
booktitle = {{LICS} '20: 35th Annual {ACM/IEEE} Symposium on Logic in Computer
Science, Saarbr{\"{u}}cken, Germany, July 8-11, 2020},
pages = {74--87},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3373718.3394747},
doi = {10.1145/3373718.3394747},
timestamp = {Sat, 30 Sep 2023 09:52:07 +0200},
biburl = {https://dblp.org/rec/conf/lics/AlurCJK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/ChenKK20,
author = {Yu Chen and
Sampath Kannan and
Sanjeev Khanna},
editor = {Yennun Huang and
Irwin King and
Tie{-}Yan Liu and
Maarten van Steen},
title = {Near-Perfect Recovery in the One-Dimensional Latent Space Model},
booktitle = {{WWW} '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020},
pages = {1932--1942},
publisher = {{ACM} / {IW3C2}},
year = {2020},
url = {https://doi.org/10.1145/3366423.3380261},
doi = {10.1145/3366423.3380261},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/ChenKK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-04351,
author = {Yu Chen and
Sampath Kannan and
Sanjeev Khanna},
title = {Near-Perfect Recovery in the One-Dimensional Latent Space Model},
journal = {CoRR},
volume = {abs/2006.04351},
year = {2020},
url = {https://arxiv.org/abs/2006.04351},
eprinttype = {arXiv},
eprint = {2006.04351},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-04351.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-05490,
author = {Yu Chen and
Sampath Kannan and
Sanjeev Khanna},
title = {Sublinear Algorithms and Lower Bounds for Metric {TSP} Cost Estimation},
journal = {CoRR},
volume = {abs/2006.05490},
year = {2020},
url = {https://arxiv.org/abs/2006.05490},
eprinttype = {arXiv},
eprint = {2006.05490},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-05490.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-12670,
author = {Anindya De and
Sanjeev Khanna and
Huan Li and
Hesam Nikpey},
title = {An Efficient {PTAS} for Stochastic Load Balancing with Poisson Jobs},
journal = {CoRR},
volume = {abs/2006.12670},
year = {2020},
url = {https://arxiv.org/abs/2006.12670},
eprinttype = {arXiv},
eprint = {2006.12670},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-12670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-06098,
author = {Sepehr Assadi and
Deeparnab Chakrabarty and
Sanjeev Khanna},
title = {Graph Connectivity and Single Element Recovery via Linear and {OR}
Queries},
journal = {CoRR},
volume = {abs/2007.06098},
year = {2020},
url = {https://arxiv.org/abs/2007.06098},
eprinttype = {arXiv},
eprint = {2007.06098},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-06098.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-04992,
author = {Yu Chen and
Sanjeev Khanna and
Ansh Nagda},
title = {Near-linear Size Hypergraph Cut Sparsifiers},
journal = {CoRR},
volume = {abs/2009.04992},
year = {2020},
url = {https://arxiv.org/abs/2009.04992},
eprinttype = {arXiv},
eprint = {2009.04992},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-04992.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GoelKK19,
author = {Ashish Goel and
Michael Kapralov and
Sanjeev Khanna},
title = {Perfect Matchings in {\~{O}} (n 1.5) Time in Regular Bipartite Graphs},
journal = {Comb.},
volume = {39},
number = {2},
pages = {323--354},
year = {2019},
url = {https://doi.org/10.1007/s00493-015-2653-6},
doi = {10.1007/S00493-015-2653-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GoelKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/AssadiKL19,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
title = {The Stochastic Matching Problem with (Very) Few Queries},
journal = {{ACM} Trans. Economics and Comput.},
volume = {7},
number = {3},
pages = {16:1--16:19},
year = {2019},
url = {https://doi.org/10.1145/3355903},
doi = {10.1145/3355903},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/AssadiKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/ChenJKKM19,
author = {Yu Chen and
Shahin Jabbari and
Michael J. Kearns and
Sanjeev Khanna and
Jamie Morgenstern},
editor = {Sarit Kraus},
title = {Network Formation under Random Attack and Probabilistic Spread},
booktitle = {Proceedings of the Twenty-Eighth International Joint Conference on
Artificial Intelligence, {IJCAI} 2019, Macao, China, August 10-16,
2019},
pages = {180--186},
publisher = {ijcai.org},
year = {2019},
url = {https://doi.org/10.24963/ijcai.2019/26},
doi = {10.24963/IJCAI.2019/26},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/ChenJKKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AssadiKK19,
author = {Sepehr Assadi and
Michael Kapralov and
Sanjeev Khanna},
editor = {Avrim Blum},
title = {A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs
via Edge Sampling},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {6:1--6:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.6},
doi = {10.4230/LIPICS.ITCS.2019.6},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AssadiKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgarwalAK19,
author = {Arpit Agarwal and
Sepehr Assadi and
Sanjeev Khanna},
editor = {Timothy M. Chan},
title = {Stochastic Submodular Cover with Limited Adaptivity},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {323--342},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.21},
doi = {10.1137/1.9781611975482.21},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/AgarwalAK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiCK19,
author = {Sepehr Assadi and
Yu Chen and
Sanjeev Khanna},
editor = {Timothy M. Chan},
title = {Sublinear Algorithms for ({\(\Delta\)} + 1) Vertex Coloring},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {767--786},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.48},
doi = {10.1137/1.9781611975482.48},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiCK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiCK19,
author = {Sepehr Assadi and
Yu Chen and
Sanjeev Khanna},
editor = {Moses Charikar and
Edith Cohen},
title = {Polynomial pass lower bounds for graph streaming algorithms},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {265--276},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316361},
doi = {10.1145/3313276.3316361},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiCK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyK19,
author = {Julia Chuzhoy and
Sanjeev Khanna},
editor = {Moses Charikar and
Edith Cohen},
title = {A new algorithm for decremental single-source shortest paths with
applications to vertex-capacitated flow and cut problems},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {389--400},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316320},
doi = {10.1145/3313276.3316320},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-04720,
author = {Sepehr Assadi and
Yu Chen and
Sanjeev Khanna},
title = {Polynomial Pass Lower Bounds for Graph Streaming Algorithms},
journal = {CoRR},
volume = {abs/1904.04720},
year = {2019},
url = {http://arxiv.org/abs/1904.04720},
eprinttype = {arXiv},
eprint = {1904.04720},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-04720.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-11512,
author = {Julia Chuzhoy and
Sanjeev Khanna},
title = {A New Algorithm for Decremental Single-Source Shortest Paths with
Applications to Vertex-Capacitated Flow and Cut Problems},
journal = {CoRR},
volume = {abs/1905.11512},
year = {2019},
url = {http://arxiv.org/abs/1905.11512},
eprinttype = {arXiv},
eprint = {1905.11512},
timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-11512.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-00241,
author = {Yu Chen and
Shahin Jabbari and
Michael J. Kearns and
Sanjeev Khanna and
Jamie Morgenstern},
title = {Network Formation under Random Attack and Probabilistic Spread},
journal = {CoRR},
volume = {abs/1906.00241},
year = {2019},
url = {http://arxiv.org/abs/1906.00241},
eprinttype = {arXiv},
eprint = {1906.00241},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-00241.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChiplunkarKKMP18,
author = {Ashish Chiplunkar and
Michael Kapralov and
Sanjeev Khanna and
Aida Mousavifar and
Yuval Peres},
editor = {Mikkel Thorup},
title = {Testing Graph Clusterability: Algorithms and Lower Bounds},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {497--508},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00054},
doi = {10.1109/FOCS.2018.00054},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChiplunkarKKMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChakrabartyK18,
author = {Deeparnab Chakrabarty and
Sanjeev Khanna},
editor = {Raimund Seidel},
title = {Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm
for Matrix Scaling},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {4:1--4:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.4},
doi = {10.4230/OASICS.SOSA.2018.4},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChakrabartyK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AsathullaKLR18,
author = {Mudabir Kabir Asathulla and
Sanjeev Khanna and
Nathaniel Lahn and
Sharath Raghvendra},
editor = {Artur Czumaj},
title = {A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in
Planar Graphs},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {457--476},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.31},
doi = {10.1137/1.9781611975031.31},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/AsathullaKLR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiK18,
author = {Sepehr Assadi and
Sanjeev Khanna},
editor = {Artur Czumaj},
title = {Tight Bounds on the Round Complexity of the Distributed Maximum Coverage
Problem},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2412--2431},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.155},
doi = {10.1137/1.9781611975031.155},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-02790,
author = {Deeparnab Chakrabarty and
Sanjeev Khanna},
title = {Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm
for Matrix Scaling},
journal = {CoRR},
volume = {abs/1801.02790},
year = {2018},
url = {http://arxiv.org/abs/1801.02790},
eprinttype = {arXiv},
eprint = {1801.02790},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-02790.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-02793,
author = {Sepehr Assadi and
Sanjeev Khanna},
title = {Tight Bounds on the Round Complexity of the Distributed Maximum Coverage
Problem},
journal = {CoRR},
volume = {abs/1801.02793},
year = {2018},
url = {http://arxiv.org/abs/1801.02793},
eprinttype = {arXiv},
eprint = {1801.02793},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-02793.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-08886,
author = {Sepehr Assadi and
Yu Chen and
Sanjeev Khanna},
title = {Sublinear Algorithms for ({\(\Delta\)}+ 1) Vertex Coloring},
journal = {CoRR},
volume = {abs/1807.08886},
year = {2018},
url = {http://arxiv.org/abs/1807.08886},
eprinttype = {arXiv},
eprint = {1807.08886},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-08886.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-04807,
author = {Ashish Chiplunkar and
Michael Kapralov and
Sanjeev Khanna and
Aida Mousavifar and
Yuval Peres},
title = {Testing Graph Clusterability: Algorithms and Lower Bounds},
journal = {CoRR},
volume = {abs/1808.04807},
year = {2018},
url = {http://arxiv.org/abs/1808.04807},
eprinttype = {arXiv},
eprint = {1808.04807},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-04807.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-13351,
author = {Arpit Agarwal and
Sepehr Assadi and
Sanjeev Khanna},
title = {Stochastic Submodular Cover with Limited Adaptivity},
journal = {CoRR},
volume = {abs/1810.13351},
year = {2018},
url = {http://arxiv.org/abs/1810.13351},
eprinttype = {arXiv},
eprint = {1810.13351},
timestamp = {Thu, 08 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-13351.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-07780,
author = {Sepehr Assadi and
Michael Kapralov and
Sanjeev Khanna},
title = {A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs
via Edge Sampling},
journal = {CoRR},
volume = {abs/1811.07780},
year = {2018},
url = {http://arxiv.org/abs/1811.07780},
eprinttype = {arXiv},
eprint = {1811.07780},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-07780.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ChrobakFHKLN17,
author = {Marek Chrobak and
Uriel Feige and
Mohammad Taghi Hajiaghayi and
Sanjeev Khanna and
Fei Li and
Seffi Naor},
title = {A greedy approximation algorithm for minimum-gap scheduling},
journal = {J. Sched.},
volume = {20},
number = {3},
pages = {279--292},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0492-y},
doi = {10.1007/S10951-016-0492-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ChrobakFHKLN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/AssadiKLV17,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Rakesh Vohra},
title = {Fast Convergence in the Double Oral Auction},
journal = {{ACM} Trans. Economics and Comput.},
volume = {5},
number = {4},
pages = {20:1--20:18},
year = {2017},
url = {https://doi.org/10.1145/3084358},
doi = {10.1145/3084358},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/teco/AssadiKLV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Agarwal0AK17,
author = {Arpit Agarwal and
Shivani Agarwal and
Sepehr Assadi and
Sanjeev Khanna},
editor = {Satyen Kale and
Ohad Shamir},
title = {Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed
Bandits, and Ranking from Pairwise Comparisons},
booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017,
Amsterdam, The Netherlands, 7-10 July 2017},
series = {Proceedings of Machine Learning Research},
volume = {65},
pages = {39--75},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v65/agarwal17c.html},
timestamp = {Wed, 29 May 2019 08:41:46 +0200},
biburl = {https://dblp.org/rec/conf/colt/Agarwal0AK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pldi/MamourasRAIK17,
author = {Konstantinos Mamouras and
Mukund Raghothaman and
Rajeev Alur and
Zachary G. Ives and
Sanjeev Khanna},
editor = {Albert Cohen and
Martin T. Vechev},
title = {StreamQRE: modular specification and efficient evaluation of quantitative
queries over streaming data},
booktitle = {Proceedings of the 38th {ACM} {SIGPLAN} Conference on Programming
Language Design and Implementation, {PLDI} 2017, Barcelona, Spain,
June 18-23, 2017},
pages = {693--708},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3062341.3062369},
doi = {10.1145/3062341.3062369},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pldi/MamourasRAIK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/AssadiKL17,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
editor = {Constantinos Daskalakis and
Moshe Babaioff and
Herv{\'{e}} Moulin},
title = {The Stochastic Matching Problem: Beating Half with a Non-Adaptive
Algorithm},
booktitle = {Proceedings of the 2017 {ACM} Conference on Economics and Computation,
{EC} '17, Cambridge, MA, USA, June 26-30, 2017},
pages = {99--116},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3033274.3085146},
doi = {10.1145/3033274.3085146},
timestamp = {Mon, 30 Jan 2023 21:01:44 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/AssadiKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KapralovKSV17,
author = {Michael Kapralov and
Sanjeev Khanna and
Madhu Sudan and
Ameya Velingker},
editor = {Philip N. Klein},
title = {{(1} + {\(\Omega\)}(1))-{\(\Alpha\)}pproximation to {MAX-CUT} Requires
Linear Space},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1703--1722},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.112},
doi = {10.1137/1.9781611974782.112},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KapralovKSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiKL17,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
editor = {Philip N. Klein},
title = {On Estimating Maximum Matching Size in Graph Streams},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1723--1742},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.113},
doi = {10.1137/1.9781611974782.113},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AssadiK17,
author = {Sepehr Assadi and
Sanjeev Khanna},
editor = {Christian Scheideler and
Mohammad Taghi Hajiaghayi},
title = {Randomized Composable Coresets for Matching and Vertex Cover},
booktitle = {Proceedings of the 29th {ACM} Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2017, Washington DC, USA, July 24-26, 2017},
pages = {3--12},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087556.3087581},
doi = {10.1145/3087556.3087581},
timestamp = {Tue, 06 Nov 2018 16:59:33 +0100},
biburl = {https://dblp.org/rec/conf/spaa/AssadiK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKL17,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
title = {On Estimating Maximum Matching Size in Graph Streams},
journal = {CoRR},
volume = {abs/1701.04364},
year = {2017},
url = {http://arxiv.org/abs/1701.04364},
eprinttype = {arXiv},
eprint = {1701.04364},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKL17a,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
title = {The Stochastic Matching Problem: Beating Half with a Non-Adaptive
Algorithm},
journal = {CoRR},
volume = {abs/1705.02280},
year = {2017},
url = {http://arxiv.org/abs/1705.02280},
eprinttype = {arXiv},
eprint = {1705.02280},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKL17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiK17,
author = {Sepehr Assadi and
Sanjeev Khanna},
title = {Randomized Composable Coresets for Matching and Vertex Cover},
journal = {CoRR},
volume = {abs/1705.08242},
year = {2017},
url = {http://arxiv.org/abs/1705.08242},
eprinttype = {arXiv},
eprint = {1705.08242},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/af/HemenwayK16,
author = {Brett Hemenway and
Sanjeev Khanna},
title = {Sensitivity and computational complexity in financial networks},
journal = {Algorithmic Finance},
volume = {5},
number = {3-4},
pages = {95--110},
year = {2016},
url = {https://doi.org/10.3233/AF-160166},
doi = {10.3233/AF-160166},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/af/HemenwayK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fgcs/StarlingerBKDL16,
author = {Johannes Starlinger and
Sarah Cohen Boulakia and
Sanjeev Khanna and
Susan B. Davidson and
Ulf Leser},
title = {Effective and efficient similarity search in scientific workflow repositories},
journal = {Future Gener. Comput. Syst.},
volume = {56},
pages = {584--594},
year = {2016},
url = {https://doi.org/10.1016/j.future.2015.06.012},
doi = {10.1016/J.FUTURE.2015.06.012},
timestamp = {Wed, 19 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fgcs/StarlingerBKDL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/AssadiKLT16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Val Tannen},
editor = {Wim Martens and
Thomas Zeume},
title = {Algorithms for Provisioning Queries and Analytics},
booktitle = {19th International Conference on Database Theory, {ICDT} 2016, Bordeaux,
France, March 15-18, 2016},
series = {LIPIcs},
volume = {48},
pages = {18:1--18:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2016.18},
doi = {10.4230/LIPICS.ICDT.2016.18},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icdt/AssadiKLT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/GurneyKL16,
author = {Alexander J. T. Gurney and
Sanjeev Khanna and
Yang Li},
title = {Rapid convergence versus policy expressiveness in interdomain routing},
booktitle = {35th Annual {IEEE} International Conference on Computer Communications,
{INFOCOM} 2016, San Francisco, CA, USA, April 10-14, 2016},
pages = {1--9},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/INFOCOM.2016.7524406},
doi = {10.1109/INFOCOM.2016.7524406},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/GurneyKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/AssadiKL16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
editor = {Vincent Conitzer and
Dirk Bergemann and
Yiling Chen},
title = {The Stochastic Matching Problem with (Very) Few Queries},
booktitle = {Proceedings of the 2016 {ACM} Conference on Economics and Computation,
{EC} '16, Maastricht, The Netherlands, July 24-28, 2016},
pages = {43--60},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2940716.2940769},
doi = {10.1145/2940716.2940769},
timestamp = {Fri, 09 Jul 2021 11:46:27 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/AssadiKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiKLY16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Grigory Yaroslavtsev},
editor = {Robert Krauthgamer},
title = {Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication
Model},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1345--1364},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch93},
doi = {10.1137/1.9781611974331.CH93},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiKLY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiKL16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Tight bounds for single-pass streaming complexity of the set cover
problem},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {698--711},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897576},
doi = {10.1145/2897518.2897576},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/GoyalJKKM16,
author = {Sanjeev Goyal and
Shahin Jabbari and
Michael J. Kearns and
Sanjeev Khanna and
Jamie Morgenstern},
editor = {Yang Cai and
Adrian Vetta},
title = {Strategic Network Formation with Attack and Immunization},
booktitle = {Web and Internet Economics - 12th International Conference, {WINE}
2016, Montreal, Canada, December 11-14, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10123},
pages = {429--443},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-54110-4\_30},
doi = {10.1007/978-3-662-54110-4\_30},
timestamp = {Sat, 09 Apr 2022 12:47:11 +0200},
biburl = {https://dblp.org/rec/conf/wine/GoyalJKKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/16/GreenwaldK16,
author = {Michael B. Greenwald and
Sanjeev Khanna},
editor = {Minos N. Garofalakis and
Johannes Gehrke and
Rajeev Rastogi},
title = {Quantiles and Equi-depth Histograms over Streams},
booktitle = {Data Stream Management - Processing High-Speed Data Streams},
series = {Data-Centric Systems and Applications},
pages = {45--86},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-540-28608-0\_3},
doi = {10.1007/978-3-540-28608-0\_3},
timestamp = {Tue, 16 May 2017 14:01:44 +0200},
biburl = {https://dblp.org/rec/books/sp/16/GreenwaldK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKL16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
title = {Tight Bounds for Single-Pass Streaming Complexity of the Set Cover
Problem},
journal = {CoRR},
volume = {abs/1603.05715},
year = {2016},
url = {http://arxiv.org/abs/1603.05715},
eprinttype = {arXiv},
eprint = {1603.05715},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChakrabartyCKK15,
author = {Deeparnab Chakrabarty and
Chandra Chekuri and
Sanjeev Khanna and
Nitish Korula},
title = {Approximability of Capacitated Network Design},
journal = {Algorithmica},
volume = {72},
number = {2},
pages = {493--514},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9862-4},
doi = {10.1007/S00453-013-9862-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChakrabartyCKK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/BrautbarDK15,
author = {Michael Brautbar and
Moez Draief and
Sanjeev Khanna},
title = {On the Power of Planned Infections in Networks},
journal = {Internet Math.},
volume = {11},
number = {4-5},
pages = {319--332},
year = {2015},
url = {https://doi.org/10.1080/15427951.2014.982312},
doi = {10.1080/15427951.2014.982312},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/BrautbarDK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AssadiKLT15,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Val Tannen},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {Dynamic Sketching for Graph Optimization Problems with Applications
to Cut-Preserving Sketches},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {52--68},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.52},
doi = {10.4230/LIPICS.FSTTCS.2015.52},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/AssadiKLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icra/MantzouratosTKY15,
author = {Yannis Mantzouratos and
Tarik Tosun and
Sanjeev Khanna and
Mark Yim},
title = {On embeddability of modular robot designs},
booktitle = {{IEEE} International Conference on Robotics and Automation, {ICRA}
2015, Seattle, WA, USA, 26-30 May, 2015},
pages = {1911--1918},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ICRA.2015.7139448},
doi = {10.1109/ICRA.2015.7139448},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/icra/MantzouratosTKY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChakrabartyKL15,
author = {Deeparnab Chakrabarty and
Sanjeev Khanna and
Shi Li},
editor = {Piotr Indyk},
title = {On (1, \emph{{\unicode{8714}}})-Restricted Assignment Makespan Minimization},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1087--1101},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.73},
doi = {10.1137/1.9781611973730.73},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChakrabartyKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KapralovKS15,
author = {Michael Kapralov and
Sanjeev Khanna and
Madhu Sudan},
editor = {Piotr Indyk},
title = {Streaming Lower Bounds for Approximating {MAX-CUT}},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1263--1282},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.84},
doi = {10.1137/1.9781611973730.84},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KapralovKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoelKRZ15,
author = {Ashish Goel and
Sanjeev Khanna and
Sharath Raghvendra and
Hongyang Zhang},
editor = {Piotr Indyk},
title = {Connectivity in Random Forests and Credit Networks},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {2037--2048},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.135},
doi = {10.1137/1.9781611973730.135},
timestamp = {Sat, 30 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GoelKRZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/AssadiKLV15,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Rakesh V. Vohra},
editor = {Evangelos Markakis and
Guido Sch{\"{a}}fer},
title = {Fast Convergence in the Double Oral Auction},
booktitle = {Web and Internet Economics - 11th International Conference, {WINE}
2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9470},
pages = {60--73},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48995-6\_5},
doi = {10.1007/978-3-662-48995-6\_5},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/AssadiKLV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLY15,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Grigory Yaroslavtsev},
title = {Tight Bounds for Linear Sketches of Approximate Matchings},
journal = {CoRR},
volume = {abs/1505.01467},
year = {2015},
url = {http://arxiv.org/abs/1505.01467},
eprinttype = {arXiv},
eprint = {1505.01467},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKLY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLV15,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Rakesh Vohra},
title = {Fast Convergence in the Double Oral Auction},
journal = {CoRR},
volume = {abs/1510.00086},
year = {2015},
url = {http://arxiv.org/abs/1510.00086},
eprinttype = {arXiv},
eprint = {1510.00086},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKLV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLT15,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Val Tannen},
title = {Dynamic Sketching for Graph Optimization Problems with Applications
to Cut-Preserving Sketches},
journal = {CoRR},
volume = {abs/1510.03252},
year = {2015},
url = {http://arxiv.org/abs/1510.03252},
eprinttype = {arXiv},
eprint = {1510.03252},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoyalJKKM15,
author = {Sanjeev Goyal and
Shahin Jabbari and
Michael J. Kearns and
Sanjeev Khanna and
Jamie Morgenstern},
title = {Strategic Network Formation with Attack and Immunization},
journal = {CoRR},
volume = {abs/1511.05196},
year = {2015},
url = {http://arxiv.org/abs/1511.05196},
eprinttype = {arXiv},
eprint = {1511.05196},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoyalJKKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLT15a,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Val Tannen},
title = {Algorithms for Provisioning Queries and Analytics},
journal = {CoRR},
volume = {abs/1512.06143},
year = {2015},
url = {http://arxiv.org/abs/1512.06143},
eprinttype = {arXiv},
eprint = {1512.06143},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKLT15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/DavidsonKMR14,
author = {Susan B. Davidson and
Sanjeev Khanna and
Tova Milo and
Sudeepa Roy},
title = {Top-k and Clustering with Noisy Comparisons},
journal = {{ACM} Trans. Database Syst.},
volume = {39},
number = {4},
pages = {35:1--35:39},
year = {2014},
url = {https://doi.org/10.1145/2684066},
doi = {10.1145/2684066},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tods/DavidsonKMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csfw/HsuGHKNPR14,
author = {Justin Hsu and
Marco Gaboardi and
Andreas Haeberlen and
Sanjeev Khanna and
Arjun Narayan and
Benjamin C. Pierce and
Aaron Roth},
title = {Differential Privacy: An Economic Method for Choosing Epsilon},
booktitle = {{IEEE} 27th Computer Security Foundations Symposium, {CSF} 2014, Vienna,
Austria, 19-22 July, 2014},
pages = {398--410},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CSF.2014.35},
doi = {10.1109/CSF.2014.35},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csfw/HsuGHKNPR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eScience/StarlingerBKDL14,
author = {Johannes Starlinger and
Sarah Cohen Boulakia and
Sanjeev Khanna and
Susan B. Davidson and
Ulf Leser},
title = {Layer Decomposition: An Effective Structure-Based Approach for Scientific
Workflow Similarity},
booktitle = {10th {IEEE} International Conference on e-Science, eScience 2014,
Sao Paulo, Brazil, October 20-24, 2014},
pages = {169--176},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/eScience.2014.19},
doi = {10.1109/ESCIENCE.2014.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/eScience/StarlingerBKDL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BhalgatK14,
author = {Anand Bhalgat and
Sanjeev Khanna},
editor = {Jon Lee and
Jens Vygen},
title = {A Utility Equivalence Theorem for Concave Functions},
booktitle = {Integer Programming and Combinatorial Optimization - 17th International
Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8494},
pages = {126--137},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07557-0\_11},
doi = {10.1007/978-3-319-07557-0\_11},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BhalgatK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/Khanna14,
author = {Sanjeev Khanna},
editor = {Adrian{-}Horia Dediu and
Carlos Mart{\'{\i}}n{-}Vide and
Jos{\'{e}} Luis Sierra{-}Rodr{\'{\i}}guez and
Bianca Truthe},
title = {Matchings, Random Walks, and Sampling},
booktitle = {Language and Automata Theory and Applications - 8th International
Conference, {LATA} 2014, Madrid, Spain, March 10-14, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8370},
pages = {32--33},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04921-2\_3},
doi = {10.1007/978-3-319-04921-2\_3},
timestamp = {Sun, 02 Oct 2022 16:11:11 +0200},
biburl = {https://dblp.org/rec/conf/lata/Khanna14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/HefnyKKSG14,
author = {Ahmed Hefny and
Robert E. Kass and
Sanjeev Khanna and
Matthew A. Smith and
Geoffrey J. Gordon},
editor = {Irina Rish and
Georg Langs and
Leila Wehbe and
Guillermo A. Cecchi and
Kai{-}min Kevin Chang and
Brian Murphy},
title = {Fast and Improved {SLEX} Analysis of High-Dimensional Time Series},
booktitle = {Machine Learning and Interpretation in Neuroimaging - 4th International
Workshop, {MLINI} 2014, Held at {NIPS} 2014, Montreal, QC, Canada,
December 13, 2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9444},
pages = {94--103},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-45174-9\_10},
doi = {10.1007/978-3-319-45174-9\_10},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/HefnyKKSG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KapralovKS14,
author = {Michael Kapralov and
Sanjeev Khanna and
Madhu Sudan},
editor = {Chandra Chekuri},
title = {Approximating matching size from random streams},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {734--751},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.55},
doi = {10.1137/1.9781611973402.55},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KapralovKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoelKLT14,
author = {Ashish Goel and
Sanjeev Khanna and
Daniel H. Larkin and
Robert Endre Tarjan},
editor = {Chandra Chekuri},
title = {Disjoint Set Union with Randomized Linking},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1005--1017},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.75},
doi = {10.1137/1.9781611973402.75},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GoelKLT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhannaL14,
author = {Sanjeev Khanna and
Brendan Lucier},
editor = {Chandra Chekuri},
title = {Influence Maximization in Undirected Networks},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1482--1496},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.109},
doi = {10.1137/1.9781611973402.109},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KhannaL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HsuGHKNPR14,
author = {Justin Hsu and
Marco Gaboardi and
Andreas Haeberlen and
Sanjeev Khanna and
Arjun Narayan and
Benjamin C. Pierce and
Aaron Roth},
title = {Differential Privacy: An Economic Method for Choosing Epsilon},
journal = {CoRR},
volume = {abs/1402.3329},
year = {2014},
url = {http://arxiv.org/abs/1402.3329},
eprinttype = {arXiv},
eprint = {1402.3329},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HsuGHKNPR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KapralovKS14,
author = {Michael Kapralov and
Sanjeev Khanna and
Madhu Sudan},
title = {Streaming Lower Bounds for Approximating {MAX-CUT}},
journal = {CoRR},
volume = {abs/1409.2138},
year = {2014},
url = {http://arxiv.org/abs/1409.2138},
eprinttype = {arXiv},
eprint = {1409.2138},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KapralovKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChakrabartyKL14,
author = {Deeparnab Chakrabarty and
Sanjeev Khanna and
Shi Li},
title = {On {\textdollar}(1, {\(\epsilon\)}){\textdollar}-Restricted Assignment
Makespan Minimization},
journal = {CoRR},
volume = {abs/1410.7506},
year = {2014},
url = {http://arxiv.org/abs/1410.7506},
eprinttype = {arXiv},
eprint = {1410.7506},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChakrabartyKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoelKK13,
author = {Ashish Goel and
Michael Kapralov and
Sanjeev Khanna},
title = {Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {3},
pages = {1392--1404},
year = {2013},
url = {https://doi.org/10.1137/100812513},
doi = {10.1137/100812513},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoelKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriKS13,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
title = {The All-or-Nothing Multicommodity Flow Problem},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {4},
pages = {1467--1493},
year = {2013},
url = {https://doi.org/10.1137/100796820},
doi = {10.1137/100796820},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/00010K13,
author = {Tanmoy Chakraborty and
Zhiyi Huang and
Sanjeev Khanna},
title = {Dynamic and Nonuniform Pricing Strategies for Revenue Maximization},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {6},
pages = {2424--2451},
year = {2013},
url = {https://doi.org/10.1137/100787799},
doi = {10.1137/100787799},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/00010K13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/DavidsonKM13,
author = {Susan B. Davidson and
Sanjeev Khanna and
Tova Milo},
editor = {Val Tannen and
Limsoon Wong and
Leonid Libkin and
Wenfei Fan and
Wang{-}Chiew Tan and
Michael P. Fourman},
title = {To Show or Not to Show in Workflow Provenance},
booktitle = {In Search of Elegance in the Theory and Practice of Computation -
Essays Dedicated to Peter Buneman},
series = {Lecture Notes in Computer Science},
volume = {8000},
pages = {217--226},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41660-6\_10},
doi = {10.1007/978-3-642-41660-6\_10},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/DavidsonKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChrobakFHKLN13,
author = {Marek Chrobak and
Uriel Feige and
Mohammad Taghi Hajiaghayi and
Sanjeev Khanna and
Fei Li and
Seffi Naor},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {A Greedy Approximation Algorithm for Minimum-Gap Scheduling},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {97--109},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_9},
doi = {10.1007/978-3-642-38233-8\_9},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChrobakFHKLN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/DavidsonKMR13,
author = {Susan B. Davidson and
Sanjeev Khanna and
Tova Milo and
Sudeepa Roy},
editor = {Wang{-}Chiew Tan and
Giovanna Guerrini and
Barbara Catania and
Anastasios Gounaris},
title = {Using the crowd for top-k and group-by queries},
booktitle = {Joint 2013 {EDBT/ICDT} Conferences, {ICDT} '13 Proceedings, Genoa,
Italy, March 18-22, 2013},
pages = {225--236},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2448496.2448524},
doi = {10.1145/2448496.2448524},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdt/DavidsonKMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waw/BrautbarDK13,
author = {Michael Brautbar and
Moez Draief and
Sanjeev Khanna},
editor = {Anthony Bonato and
Michael Mitzenmacher and
Pawel Pralat},
title = {On the Power of Adversarial Infections in Networks},
booktitle = {Algorithms and Models for the Web Graph - 10th International Workshop,
{WAW} 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8305},
pages = {44--55},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03536-9\_4},
doi = {10.1007/978-3-319-03536-9\_4},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/waw/BrautbarDK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2013,
editor = {Sanjeev Khanna},
title = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105},
doi = {10.1137/1.9781611973105},
isbn = {978-1-61197-251-1},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChuzhoyK12,
author = {Julia Chuzhoy and
Sanjeev Khanna},
title = {An O(k\({}^{\mbox{3}}\)log n)-Approximation Algorithm for Vertex-Connectivity
Survivable Network Design},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {401--413},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a018},
doi = {10.4086/TOC.2012.V008A018},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChuzhoyK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/KhannaVFKG12,
author = {Sanjeev Khanna and
Santosh S. Venkatesh and
Omid Fatemieh and
Fariba Khan and
Carl A. Gunter},
title = {Adaptive Selective Verification: An Efficient Adaptive Countermeasure
to Thwart DoS Attacks},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {20},
number = {3},
pages = {715--728},
year = {2012},
url = {https://doi.org/10.1109/TNET.2011.2171057},
doi = {10.1109/TNET.2011.2171057},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/KhannaVFKG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChalermsookCKK12,
author = {Parinya Chalermsook and
Julia Chuzhoy and
Sampath Kannan and
Sanjeev Khanna},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Improved Hardness Results for Profit Maximization Pricing Problems
with Unlimited Supply},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {73--84},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_7},
doi = {10.1007/978-3-642-32512-0\_7},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChalermsookCKK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HsuKR12,
author = {Justin Hsu and
Sanjeev Khanna and
Aaron Roth},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Distributed Private Heavy Hitters},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {461--472},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_39},
doi = {10.1007/978-3-642-31594-7\_39},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HsuKR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoelKK12,
author = {Ashish Goel and
Michael Kapralov and
Sanjeev Khanna},
editor = {Yuval Rabani},
title = {On the communication and streaming complexity of maximum bipartite
matching},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {468--485},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.41},
doi = {10.1137/1.9781611973099.41},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/GoelKK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BhalgatCK12,
author = {Anand Bhalgat and
Tanmoy Chakraborty and
Sanjeev Khanna},
editor = {Paul W. Goldberg},
title = {Mechanism Design for a Risk Averse Seller},
booktitle = {Internet and Network Economics - 8th International Workshop, {WINE}
2012, Liverpool, UK, December 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7695},
pages = {198--211},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35311-6\_15},
doi = {10.1007/978-3-642-35311-6\_15},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/wine/BhalgatCK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BorgsBCKL12,
author = {Christian Borgs and
Michael Brautbar and
Jennifer T. Chayes and
Sanjeev Khanna and
Brendan Lucier},
editor = {Paul W. Goldberg},
title = {The Power of Local Information in Social Networks},
booktitle = {Internet and Network Economics - 8th International Workshop, {WINE}
2012, Liverpool, UK, December 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7695},
pages = {406--419},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35311-6\_30},
doi = {10.1007/978-3-642-35311-6\_30},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/BorgsBCKL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-4910,
author = {Justin Hsu and
Sanjeev Khanna and
Aaron Roth},
title = {Distributed Private Heavy Hitters},
journal = {CoRR},
volume = {abs/1202.4910},
year = {2012},
url = {http://arxiv.org/abs/1202.4910},
eprinttype = {arXiv},
eprint = {1202.4910},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-4910.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-6033,
author = {Christian Borgs and
Michael Brautbar and
Jennifer T. Chayes and
Sanjeev Khanna and
Brendan Lucier},
title = {The Power of Local Information in Social Networks},
journal = {CoRR},
volume = {abs/1202.6033},
year = {2012},
url = {http://arxiv.org/abs/1202.6033},
eprinttype = {arXiv},
eprint = {1202.6033},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-6033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/KhannaRT11,
author = {Sanjeev Khanna and
Sudeepa Roy and
Val Tannen},
title = {Queries with Difference on Probabilistic Databases},
journal = {Proc. {VLDB} Endow.},
volume = {4},
number = {11},
pages = {1051--1062},
year = {2011},
url = {http://www.vldb.org/pvldb/vol4/p1051-khanna.pdf},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/KhannaRT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhalgatCK11,
author = {Anand Bhalgat and
Deeparnab Chakrabarty and
Sanjeev Khanna},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {Optimal Lower Bounds for Universal and Differentially Private Steiner
Trees and TSPs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {75--86},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_7},
doi = {10.1007/978-3-642-22935-0\_7},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BhalgatCK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BhalgatCK11a,
author = {Anand Bhalgat and
Deeparnab Chakrabarty and
Sanjeev Khanna},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {Social Welfare in One-Sided Matching Markets without Money},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {87--98},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_8},
doi = {10.1007/978-3-642-22935-0\_8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BhalgatCK11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cidr/DavidsonKTRCMS11,
author = {Susan B. Davidson and
Sanjeev Khanna and
Val Tannen and
Sudeepa Roy and
Yi Chen and
Tova Milo and
Julia Stoyanovich},
title = {Enabling Privacy in Provenance-Aware Workflow Systems},
booktitle = {Fifth Biennial Conference on Innovative Data Systems Research, {CIDR}
2011, Asilomar, CA, USA, January 9-12, 2011, Online Proceedings},
pages = {215--218},
publisher = {www.cidrdb.org},
year = {2011},
url = {http://cidrdb.org/cidr2011/Papers/CIDR11\_Paper30.pdf},
timestamp = {Mon, 18 Jul 2022 17:13:00 +0200},
biburl = {https://dblp.org/rec/conf/cidr/DavidsonKTRCMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HuangKK11,
author = {Zhiyi Huang and
Sampath Kannan and
Sanjeev Khanna},
editor = {Rafail Ostrovsky},
title = {Algorithms for the Generalized Sorting Problem},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {738--747},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.54},
doi = {10.1109/FOCS.2011.54},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HuangKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KhannaS11,
author = {Sanjeev Khanna and
Madhu Sudan},
editor = {Rafail Ostrovsky},
title = {Delays and the Capacity of Continuous-Time Channels},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {758--767},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.60},
doi = {10.1109/FOCS.2011.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KhannaS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/DavidsonKRSTC11,
author = {Susan B. Davidson and
Sanjeev Khanna and
Sudeepa Roy and
Julia Stoyanovich and
Val Tannen and
Yi Chen},
editor = {Tova Milo},
title = {On provenance and privacy},
booktitle = {Database Theory - {ICDT} 2011, 14th International Conference, Uppsala,
Sweden, March 21-24, 2011, Proceedings},
pages = {3--10},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1938551.1938554},
doi = {10.1145/1938551.1938554},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdt/DavidsonKRSTC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/JubaKKS11,
author = {Brendan Juba and
Adam Tauman Kalai and
Sanjeev Khanna and
Madhu Sudan},
editor = {Bernard Chazelle},
title = {Compression without a common prior: an information-theoretic justification
for ambiguity in language},
booktitle = {Innovations in Computer Science - {ICS} 2011, Tsinghua University,
Beijing, China, January 7-9, 2011. Proceedings},
pages = {79--86},
publisher = {Tsinghua University Press},
year = {2011},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/23.html},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/JubaKKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ChakrabartyCKK11,
author = {Deeparnab Chakrabarty and
Chandra Chekuri and
Sanjeev Khanna and
Nitish Korula},
editor = {Oktay G{\"{u}}nl{\"{u}}k and
Gerhard J. Woeginger},
title = {Approximability of Capacitated Network Design},
booktitle = {Integer Programming and Combinatoral Optimization - 15th International
Conference, {IPCO} 2011, New York, NY, USA, June 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6655},
pages = {78--91},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20807-2\_7},
doi = {10.1007/978-3-642-20807-2\_7},
timestamp = {Tue, 29 Dec 2020 18:40:14 +0100},
biburl = {https://dblp.org/rec/conf/ipco/ChakrabartyCKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/DavidsonKMPR11,
author = {Susan B. Davidson and
Sanjeev Khanna and
Tova Milo and
Debmalya Panigrahi and
Sudeepa Roy},
editor = {Maurizio Lenzerini and
Thomas Schwentick},
title = {Provenance views for module privacy},
booktitle = {Proceedings of the 30th {ACM} {SIGMOD-SIGACT-SIGART} Symposium on
Principles of Database Systems, {PODS} 2011, June 12-16, 2011, Athens,
Greece},
pages = {175--186},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1989284.1989305},
doi = {10.1145/1989284.1989305},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/DavidsonKMPR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhalgatGK11,
author = {Anand Bhalgat and
Ashish Goel and
Sanjeev Khanna},
editor = {Dana Randall},
title = {Improved Approximation Results for Stochastic Knapsack Problems},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1647--1665},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.127},
doi = {10.1137/1.9781611973082.127},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/BhalgatGK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2964,
author = {Anand Bhalgat and
Deeparnab Chakrabarty and
Sanjeev Khanna},
title = {Social Welfare in One-sided Matching Markets without Money},
journal = {CoRR},
volume = {abs/1104.2964},
year = {2011},
url = {http://arxiv.org/abs/1104.2964},
eprinttype = {arXiv},
eprint = {1104.2964},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2964.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-3425,
author = {Sanjeev Khanna and
Madhu Sudan},
title = {Delays and the Capacity of Continuous-time Channels},
journal = {CoRR},
volume = {abs/1105.3425},
year = {2011},
url = {http://arxiv.org/abs/1105.3425},
eprinttype = {arXiv},
eprint = {1105.3425},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-3425.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-4722,
author = {Anand Bhalgat and
Tanmoy Chakraborty and
Sanjeev Khanna},
title = {Mechanism Design with Risk Aversion},
journal = {CoRR},
volume = {abs/1107.4722},
year = {2011},
url = {http://arxiv.org/abs/1107.4722},
eprinttype = {arXiv},
eprint = {1107.4722},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-4722.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AndrewsCGKTZ10,
author = {Matthew Andrews and
Julia Chuzhoy and
Venkatesan Guruswami and
Sanjeev Khanna and
Kunal Talwar and
Lisa Zhang},
title = {Inapproximability of Edge-Disjoint Paths and low congestion routing
on undirected graphs},
journal = {Comb.},
volume = {30},
number = {5},
pages = {485--520},
year = {2010},
url = {https://doi.org/10.1007/s00493-010-2455-9},
doi = {10.1007/S00493-010-2455-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AndrewsCGKTZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nc/AngelovKV10,
author = {Stanislav Angelov and
Sanjeev Khanna and
Mirk{\'{o}} Visontai},
title = {Robust self-assembly of graphs},
journal = {Nat. Comput.},
volume = {9},
number = {1},
pages = {111--133},
year = {2010},
url = {https://doi.org/10.1007/s11047-009-9149-5},
doi = {10.1007/S11047-009-9149-5},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nc/AngelovKV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GoelKK10,
author = {Ashish Goel and
Michael Kapralov and
Sanjeev Khanna},
title = {Perfect matchings via uniform sampling in regular bipartite graphs},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {2},
pages = {27:1--27:13},
year = {2010},
url = {https://doi.org/10.1145/1721837.1721843},
doi = {10.1145/1721837.1721843},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GoelKK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bqgt/00010K10,
author = {Tanmoy Chakraborty and
Zhiyi Huang and
Sanjeev Khanna},
editor = {Moshe Dror and
Greys Sosic},
title = {Dynamic and non-uniform pricing strategies for revenue maximization},
booktitle = {Proceedings of the Behavioral and Quantitative Game Theory - Conference
on Future Directions, {BQGT} '10, Newport Beach, California, USA,
May 14-16, 2010},
pages = {20:1},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1807406.1807426},
doi = {10.1145/1807406.1807426},
timestamp = {Tue, 06 Nov 2018 16:57:10 +0100},
biburl = {https://dblp.org/rec/conf/bqgt/00010K10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/BhalgatCK10,
author = {Anand Bhalgat and
Tanmoy Chakraborty and
Sanjeev Khanna},
editor = {David C. Parkes and
Chrysanthos Dellarocas and
Moshe Tennenholtz},
title = {Approximating pure nash equilibrium in cut, party affiliation, and
satisfiability games},
booktitle = {Proceedings 11th {ACM} Conference on Electronic Commerce (EC-2010),
Cambridge, Massachusetts, USA, June 7-11, 2010},
pages = {73--82},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1807342.1807353},
doi = {10.1145/1807342.1807353},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/BhalgatCK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmod/BaoDKR10,
author = {Zhuowei Bao and
Susan B. Davidson and
Sanjeev Khanna and
Sudeepa Roy},
editor = {Ahmed K. Elmagarmid and
Divyakant Agrawal},
title = {An optimal labeling scheme for workflow provenance using skeleton
labels},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management
of Data, {SIGMOD} 2010, Indianapolis, Indiana, USA, June 6-10, 2010},
pages = {711--722},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1807167.1807244},
doi = {10.1145/1807167.1807244},
timestamp = {Thu, 11 Mar 2021 15:20:15 +0100},
biburl = {https://dblp.org/rec/conf/sigmod/BaoDKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoelKK10,
author = {Ashish Goel and
Michael Kapralov and
Sanjeev Khanna},
editor = {Leonard J. Schulman},
title = {Perfect matchings in o(\emph{n} log \emph{n}) time in regular bipartite
graphs},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {39--46},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806697},
doi = {10.1145/1806689.1806697},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoelKK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BriestCKLN10,
author = {Patrick Briest and
Parinya Chalermsook and
Sanjeev Khanna and
Bundit Laekhanukit and
Danupon Nanongkai},
editor = {Amin Saberi},
title = {Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing},
booktitle = {Internet and Network Economics - 6th International Workshop, {WINE}
2010, Stanford, CA, USA, December 13-17, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6484},
pages = {444--454},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17572-5\_37},
doi = {10.1007/978-3-642-17572-5\_37},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/BriestCKLN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-4915,
author = {Ashish Goel and
Michael Kapralov and
Sanjeev Khanna},
title = {Graph Sparsification via Refinement Sampling},
journal = {CoRR},
volume = {abs/1004.4915},
year = {2010},
url = {http://arxiv.org/abs/1004.4915},
eprinttype = {arXiv},
eprint = {1004.4915},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-4915.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1005-5543,
author = {Susan B. Davidson and
Sanjeev Khanna and
Debmalya Panigrahi and
Sudeepa Roy},
title = {Preserving Module Privacy in Workflow Provenance},
journal = {CoRR},
volume = {abs/1005.5543},
year = {2010},
url = {http://arxiv.org/abs/1005.5543},
eprinttype = {arXiv},
eprint = {1005.5543},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1005-5543.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-5734,
author = {Deeparnab Chakrabarty and
Chandra Chekuri and
Sanjeev Khanna and
Nitish Korula},
title = {Approximability of Capacitated Network Design},
journal = {CoRR},
volume = {abs/1009.5734},
year = {2010},
url = {http://arxiv.org/abs/1009.5734},
eprinttype = {arXiv},
eprint = {1009.5734},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-5734.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-3770,
author = {Anand Bhalgat and
Deeparnab Chakrabarty and
Sanjeev Khanna},
title = {Optimal Lower Bounds for Universal and Differentially Private Steiner
Tree and {TSP}},
journal = {CoRR},
volume = {abs/1011.3770},
year = {2010},
url = {http://arxiv.org/abs/1011.3770},
eprinttype = {arXiv},
eprint = {1011.3770},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-3770.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChekuriKS09,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
title = {A Note on Multiflows and Treewidth},
journal = {Algorithmica},
volume = {54},
number = {3},
pages = {400--412},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9129-z},
doi = {10.1007/S00453-007-9129-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChekuriKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AngelovKK09,
author = {Stanislav Angelov and
Sanjeev Khanna and
Keshav Kunal},
title = {The Network as a Storage Device: Dynamic Routing with Bounded Buffers},
journal = {Algorithmica},
volume = {55},
number = {1},
pages = {71--94},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9143-1},
doi = {10.1007/S00453-007-9143-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AngelovKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChuzhoyK09,
author = {Julia Chuzhoy and
Sanjeev Khanna},
title = {Polynomial flow-cut gaps and hardness of directed cut problems},
journal = {J. {ACM}},
volume = {56},
number = {2},
pages = {6:1--6:28},
year = {2009},
url = {https://doi.org/10.1145/1502793.1502795},
doi = {10.1145/1502793.1502795},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChuzhoyK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriKS09,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
title = {Edge-Disjoint Paths in Planar Graphs with Constant Congestion},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {1},
pages = {281--301},
year = {2009},
url = {https://doi.org/10.1137/060674442},
doi = {10.1137/060674442},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GolubchikKKTZ09,
author = {Leana Golubchik and
Sanjeev Khanna and
Samir Khuller and
Ramakrishna Thurimella and
An Zhu},
title = {Approximation algorithms for data placement on parallel disks},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {4},
pages = {34:1--34:26},
year = {2009},
url = {https://doi.org/10.1145/1597036.1597037},
doi = {10.1145/1597036.1597037},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GolubchikKKTZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabartyCK09,
author = {Deeparnab Chakrabarty and
Julia Chuzhoy and
Sanjeev Khanna},
title = {On Allocating Goods to Maximize Fairness},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {107--116},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.51},
doi = {10.1109/FOCS.2009.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChakrabartyCK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuzhoyK09,
author = {Julia Chuzhoy and
Sanjeev Khanna},
title = {An O(k{\^{}}3 log n)-Approximation Algorithm for Vertex-Connectivity
Survivable Network Design},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {437--441},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.38},
doi = {10.1109/FOCS.2009.38},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChuzhoyK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabortyHK09,
author = {Tanmoy Chakraborty and
Zhiyi Huang and
Sanjeev Khanna},
title = {Dynamic and Non-uniform Pricing Strategies for Revenue Maximization},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {495--504},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.43},
doi = {10.1109/FOCS.2009.43},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChakrabortyHK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/BaoBDEK09,
author = {Zhuowei Bao and
Sarah Cohen Boulakia and
Susan B. Davidson and
Anat Eyal and
Sanjeev Khanna},
editor = {Yannis E. Ioannidis and
Dik Lun Lee and
Raymond T. Ng},
title = {Differencing Provenance in Scientific Workflows},
booktitle = {Proceedings of the 25th International Conference on Data Engineering,
{ICDE} 2009, March 29 2009 - April 2 2009, Shanghai, China},
pages = {808--819},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/ICDE.2009.103},
doi = {10.1109/ICDE.2009.103},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/BaoBDEK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/BitonDKR09,
author = {Olivier Biton and
Susan B. Davidson and
Sanjeev Khanna and
Sudeepa Roy},
editor = {Ronald Fagin},
title = {Optimizing user views for workflows},
booktitle = {Database Theory - {ICDT} 2009, 12th International Conference, St.
Petersburg, Russia, March 23-25, 2009, Proceedings},
series = {{ACM} International Conference Proceeding Series},
volume = {361},
pages = {310--323},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1514894.1514931},
doi = {10.1145/1514894.1514931},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdt/BitonDKR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/ChakrabortyK09,
author = {Tanmoy Chakraborty and
Sanjeev Khanna},
editor = {Marios Mavronicolas and
Vicky G. Papadopoulou},
title = {Nash Dynamics in Constant Player and Bounded Jump Congestion Games},
booktitle = {Algorithmic Game Theory, Second International Symposium, {SAGT} 2009,
Paphos, Cyprus, October 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5814},
pages = {196--207},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04645-2\_18},
doi = {10.1007/978-3-642-04645-2\_18},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/ChakrabortyK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sca/ZhaoNKS09,
author = {Liming Zhao and
Aline Normoyle and
Sanjeev Khanna and
Alla Safonova},
editor = {Dieter W. Fellner and
Stephen N. Spencer},
title = {Automatic construction of a minimum size motion graph},
booktitle = {Proceedings of the 2009 {ACM} SIGGRAPH/Eurographics Symposium on Computer
Animation, {SCA} 2009, New Orleans, Louisiana, USA, August 1-2, 2009},
pages = {27--35},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1599470.1599474},
doi = {10.1145/1599470.1599474},
timestamp = {Tue, 06 Nov 2018 11:06:53 +0100},
biburl = {https://dblp.org/rec/conf/sca/ZhaoNKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/ChakrabortyKK09,
author = {Tanmoy Chakraborty and
Michael J. Kearns and
Sanjeev Khanna},
editor = {John Chuang and
Lance Fortnow and
Pearl Pu},
title = {Network bargaining: algorithms and structural results},
booktitle = {Proceedings 10th {ACM} Conference on Electronic Commerce (EC-2009),
Stanford, California, USA, July 6--10, 2009},
pages = {159--168},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1566374.1566398},
doi = {10.1145/1566374.1566398},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/ChakrabortyKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoelKK09,
author = {Ashish Goel and
Michael Kapralov and
Sanjeev Khanna},
editor = {Claire Mathieu},
title = {Perfect matchings via uniform sampling in regular bipartite graphs},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {11--17},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.2},
doi = {10.1137/1.9781611973068.2},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GoelKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoelKN09,
author = {Ashish Goel and
Sanjeev Khanna and
Brad Null},
editor = {Claire Mathieu},
title = {The ratio index for budgeted learning, with applications},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {18--27},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.3},
doi = {10.1137/1.9781611973068.3},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GoelKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BhalgatCK09,
author = {Anand Bhalgat and
Tanmoy Chakraborty and
Sanjeev Khanna},
editor = {Stefano Leonardi},
title = {Nash Dynamics in Congestion Games with Similar Resources},
booktitle = {Internet and Network Economics, 5th International Workshop, {WINE}
2009, Rome, Italy, December 14-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5929},
pages = {362--373},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10841-9\_33},
doi = {10.1007/978-3-642-10841-9\_33},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/wine/BhalgatCK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-0205,
author = {Deeparnab Chakrabarty and
Julia Chuzhoy and
Sanjeev Khanna},
title = {On Allocating Goods to Maximize Fairness},
journal = {CoRR},
volume = {abs/0901.0205},
year = {2009},
url = {http://arxiv.org/abs/0901.0205},
eprinttype = {arXiv},
eprint = {0901.0205},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-0205.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-1617,
author = {Ashish Goel and
Sanjeev Khanna},
title = {Perfect Matchings in {\~{O}}(n\({}^{\mbox{1.5}}\)) Time in Regular
Bipartite Graphs},
journal = {CoRR},
volume = {abs/0902.1617},
year = {2009},
url = {http://arxiv.org/abs/0902.1617},
eprinttype = {arXiv},
eprint = {0902.1617},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-1617.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0905-3191,
author = {Tanmoy Chakraborty and
Zhiyi Huang and
Sanjeev Khanna},
title = {Dynamic and Non-Uniform Pricing Strategies for Revenue Maximization},
journal = {CoRR},
volume = {abs/0905.3191},
year = {2009},
url = {http://arxiv.org/abs/0905.3191},
eprinttype = {arXiv},
eprint = {0905.3191},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0905-3191.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-3346,
author = {Ashish Goel and
Michael Kapralov and
Sanjeev Khanna},
title = {Perfect Matchings in O(n {\textbackslash}log n) Time in Regular Bipartite
Graphs},
journal = {CoRR},
volume = {abs/0909.3346},
year = {2009},
url = {http://arxiv.org/abs/0909.3346},
eprinttype = {arXiv},
eprint = {0909.3346},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-3346.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-0110,
author = {Patrick Briest and
Sanjeev Khanna},
title = {Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing},
journal = {CoRR},
volume = {abs/0910.0110},
year = {2009},
url = {http://arxiv.org/abs/0910.0110},
eprinttype = {arXiv},
eprint = {0910.0110},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-0110.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nc/AngelovKV08,
author = {Stanislav Angelov and
Sanjeev Khanna and
Mirk{\'{o}} Visontai},
title = {On the complexity of graph self-assembly in accretive systems},
journal = {Nat. Comput.},
volume = {7},
number = {2},
pages = {183--201},
year = {2008},
url = {https://doi.org/10.1007/s11047-007-9048-6},
doi = {10.1007/S11047-007-9048-6},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nc/AngelovKV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dna/AngelovKV08,
author = {Stanislav Angelov and
Sanjeev Khanna and
Mirk{\'{o}} Visontai},
editor = {Ashish Goel and
Friedrich C. Simmel and
Petr Sos{\'{\i}}k},
title = {Robust Self-assembly of Graphs},
booktitle = {{DNA} Computing, 14th International Meeting on {DNA} Computing, {DNA}
14, Prague, Czech Republic, June 2-9, 2008. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5347},
pages = {127--143},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-03076-5\_11},
doi = {10.1007/978-3-642-03076-5\_11},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dna/AngelovKV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuzhoyK08,
author = {Julia Chuzhoy and
Sanjeev Khanna},
title = {Algorithms for Single-Source Vertex Connectivity},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {105--114},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.63},
doi = {10.1109/FOCS.2008.63},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChuzhoyK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KannanKR08,
author = {Sampath Kannan and
Sanjeev Khanna and
Sudeepa Roy},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {{STCON} in Directed Unique-Path Graphs},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
Bangalore, India},
series = {LIPIcs},
volume = {2},
pages = {256--267},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1758},
doi = {10.4230/LIPICS.FSTTCS.2008.1758},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/KannanKR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriK08,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Algorithms for 2-Route Cut Problems},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {472--484},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_39},
doi = {10.1007/978-3-540-70575-8\_39},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/KhannaVFKG08,
author = {Sanjeev Khanna and
Santosh S. Venkatesh and
Omid Fatemieh and
Fariba Khan and
Carl A. Gunter},
title = {Adaptive SelectiveVerification},
booktitle = {{INFOCOM} 2008. 27th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
13-18 April 2008, Phoenix, AZ, {USA}},
pages = {529--537},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/INFOCOM.2008.101},
doi = {10.1109/INFOCOM.2008.101},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/KhannaVFKG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipsn/GoelK08,
author = {Ashish Goel and
Sanjeev Khanna},
title = {On the Network Coding Advantage for Wireless Multicast in Euclidean
Space},
booktitle = {Proceedings of the 7th International Conference on Information Processing
in Sensor Networks, {IPSN} 2008, St. Louis, Missouri, USA, April 22-24,
2008},
pages = {64--69},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/IPSN.2008.29},
doi = {10.1109/IPSN.2008.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipsn/GoelK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChakrabortyCK08,
author = {Tanmoy Chakraborty and
Julia Chuzhoy and
Sanjeev Khanna},
editor = {Cynthia Dwork},
title = {Network design for vertex connectivity},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {167--176},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374403},
doi = {10.1145/1374376.1374403},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChakrabortyCK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-2457,
author = {Ashish Goel and
Michael Kapralov and
Sanjeev Khanna},
title = {Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs},
journal = {CoRR},
volume = {abs/0811.2457},
year = {2008},
url = {http://arxiv.org/abs/0811.2457},
eprinttype = {arXiv},
eprint = {0811.2457},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-2457.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-4442,
author = {Julia Chuzhoy and
Sanjeev Khanna},
title = {An O(k\({}^{\mbox{3}}\)log n)-Approximation Algorithm for Vertex-Connectivity
Survivable Network Design},
journal = {CoRR},
volume = {abs/0812.4442},
year = {2008},
url = {http://arxiv.org/abs/0812.4442},
eprinttype = {arXiv},
eprint = {0812.4442},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-4442.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/AngelovHKKK07,
author = {Stanislav Angelov and
Boulos Harb and
Sampath Kannan and
Sanjeev Khanna and
Junhyong Kim},
title = {Efficient Enumeration of Phylogenetically Informative Substrings},
journal = {J. Comput. Biol.},
volume = {14},
number = {6},
pages = {701--723},
year = {2007},
url = {https://doi.org/10.1089/cmb.2007.R011},
doi = {10.1089/CMB.2007.R011},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/AngelovHKKK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChekuriK07,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {Edge-disjoint paths revisited},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {4},
pages = {46},
year = {2007},
url = {https://doi.org/10.1145/1290672.1290683},
doi = {10.1145/1290672.1290683},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChekuriK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KhannaKP07,
author = {Sanjeev Khanna and
Keshav Kunal and
Benjamin C. Pierce},
editor = {Vikraman Arvind and
Sanjiva Prasad},
title = {A Formal Investigation of},
booktitle = {{FSTTCS} 2007: Foundations of Software Technology and Theoretical
Computer Science, 27th International Conference, New Delhi, India,
December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4855},
pages = {485--496},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77050-3\_40},
doi = {10.1007/978-3-540-77050-3\_40},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KhannaKP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyGKT07,
author = {Julia Chuzhoy and
Venkatesan Guruswami and
Sanjeev Khanna and
Kunal Talwar},
editor = {David S. Johnson and
Uriel Feige},
title = {Hardness of routing with congestion in directed graphs},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {165--178},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250816},
doi = {10.1145/1250790.1250816},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyGKT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyK07,
author = {Julia Chuzhoy and
Sanjeev Khanna},
editor = {David S. Johnson and
Uriel Feige},
title = {Polynomial flow-cut gaps and hardness of directed cut problems},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {179--188},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250817},
doi = {10.1145/1250790.1250817},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AndrewsCGKTZ07,
author = {Matthew Andrews and
Julia Chuzhoy and
Venkatesan Guruswami and
Sanjeev Khanna and
Kunal Talwar and
Lisa Zhang},
title = {Inapproximability of edge-disjoint paths and low congestion routing
on undirected graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-113}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-113/index.html},
eprinttype = {ECCC},
eprint = {TR07-113},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AndrewsCGKTZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/IslerKK06,
author = {Volkan Isler and
Sampath Kannan and
Sanjeev Khanna},
title = {Randomized Pursuit-Evasion with Local Visibility},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {1},
pages = {26--41},
year = {2006},
url = {https://doi.org/10.1137/S0895480104442169},
doi = {10.1137/S0895480104442169},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/IslerKK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChekuriKS06,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
title = {An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths
and Unsplittable Flow},
journal = {Theory Comput.},
volume = {2},
number = {7},
pages = {137--146},
year = {2006},
url = {https://doi.org/10.4086/toc.2006.v002a007},
doi = {10.4086/TOC.2006.V002A007},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChekuriKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dna/AngelovKV06,
author = {Stanislav Angelov and
Sanjeev Khanna and
Mirk{\'{o}} Visontai},
editor = {Chengde Mao and
Takashi Yokomori},
title = {On the Complexity of Graph Self-assembly in Accretive Systems},
booktitle = {{DNA} Computing, 12th International Meeting on {DNA} Computing, DNA12,
Seoul, Korea, June 5-9, 2006, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4287},
pages = {95--110},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11925903\_8},
doi = {10.1007/11925903\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dna/AngelovKV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/AngelovHKKK06,
author = {Stanislav Angelov and
Boulos Harb and
Sampath Kannan and
Sanjeev Khanna and
Junhyong Kim},
editor = {Alberto Apostolico and
Concettina Guerra and
Sorin Istrail and
Pavel A. Pevzner and
Michael S. Waterman},
title = {Efficient Enumeration of Phylogenetically Informative Substrings},
booktitle = {Research in Computational Molecular Biology, 10th Annual International
Conference, {RECOMB} 2006, Venice, Italy, April 2-5, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3909},
pages = {248--264},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11732990\_22},
doi = {10.1007/11732990\_22},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/AngelovHKKK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyK06,
author = {Julia Chuzhoy and
Sanjeev Khanna},
editor = {Jon M. Kleinberg},
title = {Hardness of cut problems in directed graphs},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {527--536},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132593},
doi = {10.1145/1132516.1132593},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriKS06,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
editor = {Jon M. Kleinberg},
title = {Edge-disjoint paths in Planar graphs with constant congestion},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {757--766},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132621},
doi = {10.1145/1132516.1132621},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/GreenwaldKKPS06,
author = {Michael B. Greenwald and
Sanjeev Khanna and
Keshav Kunal and
Benjamin C. Pierce and
Alan Schmitt},
editor = {Shlomi Dolev},
title = {Agreeing to Agree: Conflict Resolution for Optimistically Replicated
Data},
booktitle = {Distributed Computing, 20th International Symposium, {DISC} 2006,
Stockholm, Sweden, September 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4167},
pages = {269--283},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11864219\_19},
doi = {10.1007/11864219\_19},
timestamp = {Sat, 19 Oct 2019 20:32:37 +0200},
biburl = {https://dblp.org/rec/conf/wdag/GreenwaldKKPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChuzhoyK06,
author = {Julia Chuzhoy and
Sanjeev Khanna},
title = {Hardness of Directed Routing with Congestion},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-109}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-109/index.html},
eprinttype = {ECCC},
eprint = {TR06-109},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChuzhoyK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cviu/IslerKST05,
author = {Volkan Isler and
Sanjeev Khanna and
John R. Spletzer and
Camillo J. Taylor},
title = {Target tracking with distributed sensors: The focus of attention problem},
journal = {Comput. Vis. Image Underst.},
volume = {100},
number = {1-2},
pages = {225--247},
year = {2005},
url = {https://doi.org/10.1016/j.cviu.2004.10.008},
doi = {10.1016/J.CVIU.2004.10.008},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cviu/IslerKST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChuzhoyGHKKKN05,
author = {Julia Chuzhoy and
Sudipto Guha and
Eran Halperin and
Sanjeev Khanna and
Guy Kortsarz and
Robert Krauthgamer and
Joseph Naor},
title = {Asymmetric \emph{k}-center is log\({}^{\mbox{*}}\) \emph{n}-hard to
approximate},
journal = {J. {ACM}},
volume = {52},
number = {4},
pages = {538--551},
year = {2005},
url = {https://doi.org/10.1145/1082036.1082038},
doi = {10.1145/1082036.1082038},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChuzhoyGHKKKN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriK05,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {3},
pages = {713--728},
year = {2005},
url = {https://doi.org/10.1137/S0097539700382820},
doi = {10.1137/S0097539700382820},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/trob/IslerKK05,
author = {Volkan Isler and
Sampath Kannan and
Sanjeev Khanna},
title = {Randomized pursuit-evasion in a polygonal environment},
journal = {{IEEE} Trans. Robotics},
volume = {21},
number = {5},
pages = {875--884},
year = {2005},
url = {https://doi.org/10.1109/TRO.2005.851373},
doi = {10.1109/TRO.2005.851373},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/trob/IslerKK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AngelovKK05,
author = {Stanislav Angelov and
Sanjeev Khanna and
Keshav Kunal},
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {The Network as a Storage Device: Dynamic Routing with Bounded Buffers},
booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms
and Techniques, 8th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
August 22-24, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3624},
pages = {1--13},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462\_1},
doi = {10.1007/11538462\_1},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AngelovKK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndrewsCZ05,
author = {Matthew Andrews and
Julia Chuzhoy and
Sanjeev Khanna and
Lisa Zhang},
title = {Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion},
booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
pages = {226--244},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SFCS.2005.41},
doi = {10.1109/SFCS.2005.41},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndrewsCZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BansalCKN05,
author = {Nikhil Bansal and
Moses Charikar and
Sanjeev Khanna and
Joseph Naor},
title = {Approximating the average response time in broadcast scheduling},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {215--221},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070463},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BansalCKN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriKS05,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Multicommodity flow, well-linked terminals, and routing problems},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {183--192},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060618},
doi = {10.1145/1060590.1060618},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KhannaS04,
author = {Sanjeev Khanna and
Aravind Srinivasan},
title = {Special issue: 35th Annual {ACM} Symposium on Theory of Computing},
journal = {J. Comput. Syst. Sci.},
volume = {69},
number = {3},
pages = {305},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2004.06.004},
doi = {10.1016/J.JCSS.2004.06.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KhannaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriK04,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {On Multidimensional Packing Problems},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {4},
pages = {837--851},
year = {2004},
url = {https://doi.org/10.1137/S0097539799356265},
doi = {10.1137/S0097539799356265},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuruswamiK04,
author = {Venkatesan Guruswami and
Sanjeev Khanna},
title = {On the Hardness of 4-Coloring a 3-Colorable Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {18},
number = {1},
pages = {30--40},
year = {2004},
url = {https://doi.org/10.1137/S0895480100376794},
doi = {10.1137/S0895480100376794},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuruswamiK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChekuriKNZ04,
author = {Chandra Chekuri and
Sanjeev Khanna and
Joseph Naor and
Leonid Zosin},
title = {A Linear Programming Formulation and Approximation Algorithms for
the Metric Labeling Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {18},
number = {3},
pages = {608--625},
year = {2004},
url = {https://doi.org/10.1137/S0895480101396937},
doi = {10.1137/S0895480101396937},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChekuriKNZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/BunemanKTT04,
author = {Peter Buneman and
Sanjeev Khanna and
Keishi Tajima and
Wang Chiew Tan},
title = {Archiving scientific data},
journal = {{ACM} Trans. Database Syst.},
volume = {29},
pages = {2--42},
year = {2004},
url = {https://doi.org/10.1145/974750.974752},
doi = {10.1145/974750.974752},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tods/BunemanKTT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriKS04,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
title = {Edge-Disjoint Paths in Planar Graphs},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {71--80},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.27},
doi = {10.1109/FOCS.2004.27},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuzhoyGKN04,
author = {Julia Chuzhoy and
Sudipto Guha and
Sanjeev Khanna and
Joseph Naor},
title = {Machine Minimization for Scheduling Jobs with Interval Constraints},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {81--90},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.38},
doi = {10.1109/FOCS.2004.38},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChuzhoyGKN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BjorklundHK04,
author = {Andreas Bj{\"{o}}rklund and
Thore Husfeldt and
Sanjeev Khanna},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {Approximating Longest Directed Paths and Cycles},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {222--233},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_21},
doi = {10.1007/978-3-540-27836-8\_21},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BjorklundHK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ndss/GunterKTV04,
author = {Carl A. Gunter and
Sanjeev Khanna and
Kaijun Tan and
Santosh S. Venkatesh},
title = {DoS Protection for Reliably Authenticated Broadcast},
booktitle = {Proceedings of the Network and Distributed System Security Symposium,
{NDSS} 2004, San Diego, California, {USA}},
publisher = {The Internet Society},
year = {2004},
url = {https://www.ndss-symposium.org/ndss2004/dos-protection-reliably-authenticated-broadcast/},
timestamp = {Mon, 01 Feb 2021 08:42:17 +0100},
biburl = {https://dblp.org/rec/conf/ndss/GunterKTV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/GreenwaldK04,
author = {Michael Greenwald and
Sanjeev Khanna},
editor = {Catriel Beeri and
Alin Deutsch},
title = {Power-Conserving Computation of Order-Statistics over Sensor Networks},
booktitle = {Proceedings of the Twenty-third {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, June 14-16, 2004, Paris, France},
pages = {275--285},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1055558.1055597},
doi = {10.1145/1055558.1055597},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/GreenwaldK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BatuKKM04,
author = {Tugkan Batu and
Sampath Kannan and
Sanjeev Khanna and
Andrew McGregor},
editor = {J. Ian Munro},
title = {Reconstructing strings from random traces},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {910--918},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982929},
timestamp = {Mon, 26 Sep 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BatuKKM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/IslerKK04,
author = {Volkan Isler and
Sampath Kannan and
Sanjeev Khanna},
editor = {J. Ian Munro},
title = {Randomized pursuit-evasion with limited visibility},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {1060--1069},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982950},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/IslerKK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyGHKKN04,
author = {Julia Chuzhoy and
Sudipto Guha and
Eran Halperin and
Sanjeev Khanna and
Guy Kortsarz and
Joseph Naor},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Asymmetric k-center is log\({}^{\mbox{*}}\) \emph{n}-hard to approximate},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {21--27},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007363},
doi = {10.1145/1007352.1007363},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyGHKKN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriKS04,
author = {Chandra Chekuri and
Sanjeev Khanna and
F. Bruce Shepherd},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {The all-or-nothing multicommodity flow problem},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {156--165},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007383},
doi = {10.1145/1007352.1007383},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriGKK04,
author = {Chandra Chekuri and
Ashish Goel and
Sanjeev Khanna and
Amit Kumar},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Multi-processor scheduling to minimize flow time with epsilon resource
augmentation},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {363--372},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007411},
doi = {10.1145/1007352.1007411},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriGKK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/AngelovKLP04,
author = {Stanislav Angelov and
Sanjeev Khanna and
Li Li and
Fernando Pereira},
editor = {Inge Jonassen and
Junhyong Kim},
title = {{ATDD:} An Algorithmic Tool for Domain Discovery in Protein Sequences},
booktitle = {Algorithms in Bioinformatics, 4th International Workshop, {WABI} 2004,
Bergen, Norway, September 17-21, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3240},
pages = {206--217},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30219-3\_18},
doi = {10.1007/978-3-540-30219-3\_18},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/AngelovKLP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/AngelovHKKKW04,
author = {Stanislav Angelov and
Boulos Harb and
Sampath Kannan and
Sanjeev Khanna and
Junhyong Kim and
Li{-}San Wang},
editor = {Inge Jonassen and
Junhyong Kim},
title = {Genome Identification and Classification by Short Oligo Arrays},
booktitle = {Algorithms in Bioinformatics, 4th International Workshop, {WABI} 2004,
Bergen, Norway, September 17-21, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3240},
pages = {400--411},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30219-3\_34},
doi = {10.1007/978-3-540-30219-3\_34},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/AngelovHKKKW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wafr/IslerKK04,
author = {Volkan Isler and
Sampath Kannan and
Sanjeev Khanna},
editor = {Michael A. Erdmann and
Mark H. Overmars and
David Hsu and
A. Frank van der Stappen},
title = {Locating and Capturing an Evader in a Polygonal Environment},
booktitle = {Algorithmic Foundations of Robotics VI, Selected Contributions of
the Sixth International Workshop on the Algorithmic Foundations of
Robotics, {WAFR} 2004, July 11-13, 2004, Zeist, the Netherlands},
series = {Springer Tracts in Advanced Robotics},
volume = {17},
pages = {251--266},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/10991541\_18},
doi = {10.1007/10991541\_18},
timestamp = {Fri, 19 May 2017 01:26:04 +0200},
biburl = {https://dblp.org/rec/conf/wafr/IslerKK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2004,
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'{e}} D. P. Rolim and
Dana Ron},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {3122},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/b99805},
doi = {10.1007/B99805},
isbn = {3-540-22894-2},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/ChekuriK04,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {Joseph Y.{-}T. Leung},
title = {Approximation Algorithms for Minimizing AverageWeighted Completion
Time},
booktitle = {Handbook of Scheduling - Algorithms, Models, and Performance Analysis},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {http://www.crcnetbase.com/doi/abs/10.1201/9780203489802.ch11},
doi = {10.1201/9780203489802.CH11},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/ChekuriK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AdlerKR03,
author = {Micah Adler and
Sanjeev Khanna and
Rajmohan Rajaraman and
Adi Ros{\'{e}}n},
title = {Time-Constrained Scheduling of Weighted Packets on Trees and Meshes},
journal = {Algorithmica},
volume = {36},
number = {2},
pages = {123--152},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1019-9},
doi = {10.1007/S00453-002-1019-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AdlerKR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GuruswamiKRSY03,
author = {Venkatesan Guruswami and
Sanjeev Khanna and
Rajmohan Rajaraman and
F. Bruce Shepherd and
Mihalis Yannakakis},
title = {Near-optimal hardness results and approximation algorithms for edge-disjoint
paths and related problems},
journal = {J. Comput. Syst. Sci.},
volume = {67},
number = {3},
pages = {473--496},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00066-7},
doi = {10.1016/S0022-0000(03)00066-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GuruswamiKRSY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iros/IslerSKT03,
author = {Volkan Isler and
John R. Spletzer and
Sanjeev Khanna and
Camillo J. Taylor},
title = {Target tracking with distributed sensors: the focus of attention problem},
booktitle = {2003 {IEEE/RSJ} International Conference on Intelligent Robots and
Systems, Las Vegas, Nevada, USA, October 27 - November 1, 2003},
pages = {792--798},
publisher = {{IEEE}},
year = {2003},
url = {https://doi.org/10.1109/IROS.2003.1250726},
doi = {10.1109/IROS.2003.1250726},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/iros/IslerSKT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KannanK03,
author = {Sampath Kannan and
Sanjeev Khanna},
title = {Selection with monotone comparison cost},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {10--17},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644111},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/KannanK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriK03,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {Edge disjoint paths revisited},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {628--637},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644212},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-032,
author = {Andreas Bj{\"{o}}rklund and
Thore Husfeldt and
Sanjeev Khanna},
title = {Approximating Longest Directed Path},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-032}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-032/index.html},
eprinttype = {ECCC},
eprint = {TR03-032},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-038,
author = {Julia Chuzhoy and
Sudipto Guha and
Sanjeev Khanna and
Joseph Naor},
title = {Asymmetric k-center is log\({}^{\mbox{*}}\)n-hard to Approximate},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-038}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-038/index.html},
eprinttype = {ECCC},
eprint = {TR03-038},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-038.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Khanna02,
author = {Sanjeev Khanna},
title = {Guest Editor's Foreword},
journal = {J. Comput. Syst. Sci.},
volume = {64},
number = {4},
pages = {749},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1825},
doi = {10.1006/JCSS.2002.1825},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Khanna02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KhannaNR02,
author = {Sanjeev Khanna and
Joseph Naor and
Danny Raz},
editor = {Peter Widmayer and
Francisco Triguero Ruiz and
Rafael Morales Bueno and
Matthew Hennessy and
Stephan J. Eidenbenz and
Ricardo Conejo},
title = {Control Message Aggregation in Group Communication Protocols},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {135--146},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45465-9\_13},
doi = {10.1007/3-540-45465-9\_13},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KhannaNR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/BunemanKT02,
author = {Peter Buneman and
Sanjeev Khanna and
Wang Chiew Tan},
editor = {Lucian Popa and
Serge Abiteboul and
Phokion G. Kolaitis},
title = {On Propagation of Deletions and Annotations Through Views},
booktitle = {Proceedings of the Twenty-first {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, June 3-5, Madison, Wisconsin, {USA}},
pages = {150--158},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/543613.543633},
doi = {10.1145/543613.543633},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/BunemanKT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmod/BunemanKTT02,
author = {Peter Buneman and
Sanjeev Khanna and
Keishi Tajima and
Wang Chiew Tan},
editor = {Michael J. Franklin and
Bongki Moon and
Anastassia Ailamaki},
title = {Archiving scientific data},
booktitle = {Proceedings of the 2002 {ACM} {SIGMOD} International Conference on
Management of Data, Madison, Wisconsin, USA, June 3-6, 2002},
pages = {1--12},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/564691.564693},
doi = {10.1145/564691.564693},
timestamp = {Thu, 11 Mar 2021 15:20:15 +0100},
biburl = {https://dblp.org/rec/conf/sigmod/BunemanKTT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriK02,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {John H. Reif},
title = {Approximation schemes for preemptive weighted flow time},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {297--305},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509954},
doi = {10.1145/509907.509954},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0004131,
author = {Nadia Creignou and
Sanjeev Khanna and
Madhu Sudan},
title = {Complexity classifications of Boolean constraint satisfaction problems},
series = {{SIAM} monographs on discrete mathematics and applications},
volume = {7},
publisher = {{SIAM}},
year = {2001},
isbn = {978-0-89871-479-1},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0004131.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChekuriK01,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {A {PTAS} for Minimizing Weighted Completion Time on Uniformly Related
Machines},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {848--861},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_69},
doi = {10.1007/3-540-48224-5\_69},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChekuriK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/BunemanKT01,
author = {Peter Buneman and
Sanjeev Khanna and
Wang Chiew Tan},
editor = {Jan Van den Bussche and
Victor Vianu},
title = {Why and Where: {A} Characterization of Data Provenance},
booktitle = {Database Theory - {ICDT} 2001, 8th International Conference, London,
UK, January 4-6, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1973},
pages = {316--330},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44503-X\_20},
doi = {10.1007/3-540-44503-X\_20},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/icdt/BunemanKT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/KhannaT01,
author = {Sanjeev Khanna and
Wang Chiew Tan},
editor = {Peter Buneman},
title = {On Computing Functions with Uncertainty},
booktitle = {Proceedings of the Twentieth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, May 21-23, 2001, Santa Barbara,
California, {USA}},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/375551.375577},
doi = {10.1145/375551.375577},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/KhannaT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rtss/AdamouKLSZ01,
author = {Maria Adamou and
Sanjeev Khanna and
Insup Lee and
Insik Shin and
Shiyu Zhou},
title = {Fair Real-Time Traffic Scheduling over a Wireless {LA}},
booktitle = {Proceedings of the 22nd {IEEE} Real-Time Systems Symposium {(RTSS}
2001), London, UK, 2-6 December 2001},
pages = {279--288},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/REAL.2001.990624},
doi = {10.1109/REAL.2001.990624},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/rtss/AdamouKLSZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmod/GreenwaldK01,
author = {Michael Greenwald and
Sanjeev Khanna},
editor = {Sharad Mehrotra and
Timos K. Sellis},
title = {Space-Efficient Online Computation of Quantile Summaries},
booktitle = {Proceedings of the 2001 {ACM} {SIGMOD} international conference on
Management of data, Santa Barbara, CA, USA, May 21-24, 2001},
pages = {58--66},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/375663.375670},
doi = {10.1145/375663.375670},
timestamp = {Fri, 12 Mar 2021 14:14:34 +0100},
biburl = {https://dblp.org/rec/conf/sigmod/GreenwaldK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriKNZ01,
author = {Chandra Chekuri and
Sanjeev Khanna and
Joseph Naor and
Leonid Zosin},
editor = {S. Rao Kosaraju},
title = {Approximation algorithms for the metric labeling problem via a new
linear programming formulation},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {109--118},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365426},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriKNZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriKN01,
author = {Chandra Chekuri and
Sanjeev Khanna and
Joseph Naor},
editor = {S. Rao Kosaraju},
title = {A deterministic algorithm for the cost-distance problem},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {232--233},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365452},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriKN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriKZ01,
author = {Chandra Chekuri and
Sanjeev Khanna and
An Zhu},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Algorithms for minimizing weighted flow time},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {84--93},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380778},
doi = {10.1145/380752.380778},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriKZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-065,
author = {Chandra Chekuri and
Sanjeev Khanna},
title = {Approximation Schemes for Preemptive Weighted Flow Time},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-065}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-065/index.html},
eprinttype = {ECCC},
eprint = {TR01-065},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KhannaLS00,
author = {Sanjeev Khanna and
Nathan Linial and
Shmuel Safra},
title = {On the Hardness of Approximating the Chromatic Number},
journal = {Comb.},
volume = {20},
number = {3},
pages = {393--415},
year = {2000},
url = {https://doi.org/10.1007/s004930070013},
doi = {10.1007/S004930070013},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KhannaLS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KhannaZ00,
author = {Sanjeev Khanna and
Shiyu Zhou},
title = {On Indexed Data Broadcast},
journal = {J. Comput. Syst. Sci.},
volume = {60},
number = {3},
pages = {575--591},
year = {2000},
url = {https://doi.org/10.1006/jcss.1999.1688},
doi = {10.1006/JCSS.1999.1688},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KhannaZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhannaL00,
author = {Sanjeev Khanna and
Vincenzo Liberatore},
title = {On Broadcast Disk Paging},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {5},
pages = {1683--1702},
year = {2000},
url = {https://doi.org/10.1137/S0097539798341399},
doi = {10.1137/S0097539798341399},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KhannaL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhannaSTW00,
author = {Sanjeev Khanna and
Madhu Sudan and
Luca Trevisan and
David P. Williamson},
title = {The Approximability of Constraint Satisfaction Problems},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {6},
pages = {1863--1920},
year = {2000},
url = {https://doi.org/10.1137/S0097539799349948},
doi = {10.1137/S0097539799349948},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KhannaSTW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiK00,
author = {Venkatesan Guruswami and
Sanjeev Khanna},
title = {On the Hardness of 4-Coloring a 3-Colorable Graph},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {188--197},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856749},
doi = {10.1109/CCC.2000.856749},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BunemanKT00,
author = {Peter Buneman and
Sanjeev Khanna and
Wang Chiew Tan},
editor = {Sanjiv Kapoor and
Sanjiva Prasad},
title = {Data Provenance: Some Basic Issues},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
20th Conference, {FST} {TCS} 2000 New Delhi, India, December 13-15,
2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1974},
pages = {87--93},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44450-5\_6},
doi = {10.1007/3-540-44450-5\_6},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BunemanKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriK00,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {David B. Shmoys},
title = {A {PTAS} for the multiple knapsack problem},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {213--222},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338254},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GolubchikKKTZ00,
author = {Leana Golubchik and
Sanjeev Khanna and
Samir Khuller and
Ramakrishna Thurimella and
An Zhu},
editor = {David B. Shmoys},
title = {Approximation algorithms for data placement on parallel disks},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {223--232},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338255},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GolubchikKKTZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhannaZ00,
author = {Sanjeev Khanna and
Francis Zane},
editor = {David B. Shmoys},
title = {Watermarking maps: hiding information in structured data},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {596--605},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338612},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KhannaZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhannaNS00,
author = {Sanjeev Khanna and
Joseph Naor and
F. Bruce Shepherd},
editor = {David B. Shmoys},
title = {Directed network design with orientation constraints},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {663--671},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338620},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KhannaNS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-073,
author = {Venkatesan Guruswami and
Sanjeev Khanna},
title = {On the Hardness of 4-coloring a 3-colorable Graph},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-073}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-073/index.html},
eprinttype = {ECCC},
eprint = {TR00-073},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AggarwalCKMS99,
author = {Alok Aggarwal and
Don Coppersmith and
Sanjeev Khanna and
Rajeev Motwani and
Baruch Schieber},
title = {The Angular-Metric Traveling Salesman Problem},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {697--711},
year = {1999},
url = {https://doi.org/10.1137/S0097539796312721},
doi = {10.1137/S0097539796312721},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AggarwalCKMS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AfratiBCKKKMQSSS99,
author = {Foto N. Afrati and
Evripidis Bampis and
Chandra Chekuri and
David R. Karger and
Claire Kenyon and
Sanjeev Khanna and
Ioannis Milis and
Maurice Queyranne and
Martin Skutella and
Clifford Stein and
Maxim Sviridenko},
title = {Approximation Schemes for Minimizing Average Weighted Completion Time
with Release Dates},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {32--44},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814574},
doi = {10.1109/SFFCS.1999.814574},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AfratiBCKKKMQSSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DodisK99,
author = {Yevgeniy Dodis and
Sanjeev Khanna},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {Space Time Tradeoffs for Graph Properties},
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1644},
pages = {291--300},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_26},
doi = {10.1007/3-540-48523-6\_26},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DodisK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/AndrewsKK99,
author = {Matthew Andrews and
Sanjeev Khanna and
Krishnan Kumaran},
title = {Integrated Scheduling of Unicast and Multicast Traffic in an Input-Queued
Switch},
booktitle = {Proceedings {IEEE} {INFOCOM} '99, The Conference on Computer Communications,
Eighteenth Annual Joint Conference of the {IEEE} Computer and Communications
Societies, The Future Is Now, New York, NY, USA, March 21-25, 1999},
pages = {1144--1151},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/INFCOM.1999.751670},
doi = {10.1109/INFCOM.1999.751670},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/AndrewsKK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlbersAK99,
author = {Susanne Albers and
Sanjeev Arora and
Sanjeev Khanna},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Page Replacement for General Caching Problems},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {31--40},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314528},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlbersAK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriK99,
author = {Chandra Chekuri and
Sanjeev Khanna},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {On Multi-Dimensional Packing Problems},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {185--194},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314555},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DodisGK99,
author = {Yevgeniy Dodis and
Venkatesan Guruswami and
Sanjeev Khanna},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {The 2-Catalog Segmentation Problem},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {897--898},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.315075},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DodisGK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AdlerKRR99,
author = {Micah Adler and
Sanjeev Khanna and
Rajmohan Rajaraman and
Adi Ros{\'{e}}n},
editor = {Gary L. Miller and
Vijaya Ramachandran},
title = {Time-Constrained Scheduling of Weighted Packets on Trees and Meshes},
booktitle = {Proceedings of the Eleventh Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '99, Saint-Malo, France, June 27-30, 1999},
pages = {1--12},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/305619.305620},
doi = {10.1145/305619.305620},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/AdlerKRR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiKRSY99,
author = {Venkatesan Guruswami and
Sanjeev Khanna and
Rajmohan Rajaraman and
F. Bruce Shepherd and
Mihalis Yannakakis},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint
Paths and Related Problems},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {19--28},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301262},
doi = {10.1145/301250.301262},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiKRSY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DodisK99,
author = {Yevgeniy Dodis and
Sanjeev Khanna},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Design Networks with Bounded Pairwise Distance},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {750--759},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301447},
doi = {10.1145/301250.301447},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DodisK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhannaMW98,
author = {Sanjeev Khanna and
Rajeev Motwani and
Randall H. Wilson},
title = {On Certificates and Lookahead in Dynamic Graph Problems},
journal = {Algorithmica},
volume = {21},
number = {4},
pages = {377--394},
year = {1998},
url = {https://doi.org/10.1007/PL00009220},
doi = {10.1007/PL00009220},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KhannaMW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KhannaMSV98,
author = {Sanjeev Khanna and
Rajeev Motwani and
Madhu Sudan and
Umesh V. Vazirani},
title = {On Syntactic versus Computational Views of Approximability},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {1},
pages = {164--191},
year = {1998},
url = {https://doi.org/10.1137/S0097539795286612},
doi = {10.1137/S0097539795286612},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KhannaMSV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/KumaranK98,
author = {Krishnan Kumaran and
Sanjeev Khanna},
title = {On Wireless Spectrum Estimation and Generalized Graph Coloring},
booktitle = {Proceedings {IEEE} {INFOCOM} '98, The Conference on Computer Communications,
Seventeenth Annual Joint Conference of the {IEEE} Computer and Communications
Societies, Gateway to the 21st Century, San Francisco, CA, USA, March
29 - April 2, 1998},
pages = {1273--1283},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/INFCOM.1998.662942},
doi = {10.1109/INFCOM.1998.662942},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/KumaranK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhannaMP98,
author = {Sanjeev Khanna and
S. Muthukrishnan and
Mike Paterson},
editor = {Howard J. Karloff},
title = {On Approximating Rectangle Tiling and Packing},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {384--393},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314768},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KhannaMP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KhannaZ98,
author = {Sanjeev Khanna and
Shiyu Zhou},
editor = {Jeffrey Scott Vitter},
title = {On Indexed Data Broadcast},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {463--472},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276859},
doi = {10.1145/276698.276859},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KhannaZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KhannaL98,
author = {Sanjeev Khanna and
Vincenzo Liberatore},
editor = {Jeffrey Scott Vitter},
title = {On Broadcast Disk Paging},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {634--643},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276879},
doi = {10.1145/276698.276879},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KhannaL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bell/Khanna97,
author = {Sanjeev Khanna},
title = {A polynomial time approximation scheme for the {SONET} ring loading
problem},
journal = {Bell Labs Tech. J.},
volume = {2},
number = {2},
pages = {36--41},
year = {1997},
url = {https://doi.org/10.1002/bltj.2047},
doi = {10.1002/BLTJ.2047},
timestamp = {Thu, 27 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bell/Khanna97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/KannKLP97,
author = {Viggo Kann and
Sanjeev Khanna and
Jens Lagergren and
Alessandro Panconesi},
title = {On the Hardness of Approximating Max k-Cut and its Dual},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {1997},
year = {1997},
url = {http://cjtcs.cs.uchicago.edu/articles/1997/2/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/KannKLP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/KhannaF97,
author = {Sanjeev Khanna and
W. Kent Fuchs},
title = {A Graph Partitioning Approach to Sequential Diagnosis},
journal = {{IEEE} Trans. Computers},
volume = {46},
number = {1},
pages = {39--47},
year = {1997},
url = {https://doi.org/10.1109/12.559801},
doi = {10.1109/12.559801},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/KhannaF97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KhannaST97,
author = {Sanjeev Khanna and
Madhu Sudan and
Luca Trevisan},
title = {Constraint Satisfaction: The Approximability of Minimization Problems},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {282--296},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612323},
doi = {10.1109/CCC.1997.612323},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KhannaST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KhannaMS97,
author = {Sanjeev Khanna and
S. Muthukrishnan and
Steven Skiena},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Efficient Array Partitioning},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {616--626},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_216},
doi = {10.1007/3-540-63165-8\_216},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KhannaMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AggarwalCKMS97,
author = {Alok Aggarwal and
Don Coppersmith and
Sanjeev Khanna and
Rajeev Motwani and
Baruch Schieber},
editor = {Michael E. Saks},
title = {The Angular-Metric Traveling Salesman Problem},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {221--229},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314259},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AggarwalCKMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KhannaSW97,
author = {Sanjeev Khanna and
Madhu Sudan and
David P. Williamson},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {A Complete Classification of the Approximability of Maximization Problems
Derived from Boolean Constraint Satisfaction},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {11--20},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258538},
doi = {10.1145/258533.258538},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KhannaSW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Khanna96,
author = {Sanjeev Khanna},
title = {A structural view of approximation},
school = {Stanford University, {USA}},
year = {1996},
url = {https://searchworks.stanford.edu/view/3408563},
timestamp = {Wed, 31 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Khanna96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/KannKLP96,
author = {Viggo Kann and
Sanjeev Khanna and
Jens Lagergren and
Alessandro Panconesi},
title = {On the Hardness of Approximating Max k-Cut and Its Dual},
booktitle = {Fourth Israel Symposium on Theory of Computing and Systems, {ISTCS}
1996, Jerusalem, Israel, June 10-12, 1996, Proceedings},
pages = {61--67},
publisher = {{IEEE} Computer Society},
year = {1996},
timestamp = {Tue, 31 May 2016 15:27:26 +0200},
biburl = {https://dblp.org/rec/conf/istcs/KannKLP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KhannaMW96,
author = {Sanjeev Khanna and
Rajeev Motwani and
Randall H. Wilson},
editor = {{\'{E}}va Tardos},
title = {On Certificates and Lookahead in Dynamic Graph Problems},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {222--231},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.314067},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KhannaMW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KhannaM96,
author = {Sanjeev Khanna and
Rajeev Motwani},
editor = {Gary L. Miller},
title = {Towards a Syntactic Characterization of {PTAS}},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
pages = {329--337},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237814.237979},
doi = {10.1145/237814.237979},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KhannaM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-028,
author = {Sanjeev Khanna and
Madhu Sudan},
title = {The Optimization Complexity of Constraint Satisfaction Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-028}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-028/index.html},
eprinttype = {ECCC},
eprint = {TR96-028},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-028.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-062,
author = {Sanjeev Khanna and
Madhu Sudan and
David P. Williamson},
title = {A Complete Characterization of the Approximability of Maximization
Problems Derived from Boolean Constraint Satisfaction},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-062}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-062/index.html},
eprinttype = {ECCC},
eprint = {TR96-062},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-062.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-064,
author = {Sanjeev Khanna and
Madhu Sudan and
Luca Trevisan},
title = {Constraint satisfaction: The approximability of minimization problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-064}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-064/index.html},
eprinttype = {ECCC},
eprint = {TR96-064},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-064.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/KhannaF95,
author = {Sanjeev Khanna and
W. Kent Fuchs},
title = {A Linear Time Algorithm for Sequential Diagnosis in Hypercubes},
journal = {J. Parallel Distributed Comput.},
volume = {26},
number = {1},
pages = {48--53},
year = {1995},
url = {https://doi.org/10.1006/jpdc.1995.1046},
doi = {10.1006/JPDC.1995.1046},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/KhannaF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-023,
author = {Sanjeev Khanna and
Rajeev Motwani and
Madhu Sudan and
Umesh V. Vazirani},
title = {On Syntactic versus Computational Views of Approximability},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-023}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-023/index.html},
eprinttype = {ECCC},
eprint = {TR95-023},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KhannaMSV94,
author = {Sanjeev Khanna and
Rajeev Motwani and
Madhu Sudan and
Umesh V. Vazirani},
title = {On Syntactic versus Computational Views of Approximability},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, 20-22 November 1994},
pages = {819--830},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365712},
doi = {10.1109/SFCS.1994.365712},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KhannaMSV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/KhannaLS93,
author = {Sanjeev Khanna and
Nathan Linial and
Shmuel Safra},
title = {On the Hardness of Approximating the Chromatic Number},
booktitle = {Second Israel Symposium on Theory of Computing Systems, {ISTCS} 1993,
Natanya, Israel, June 7-9, 1993, Proceedings},
pages = {250--260},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/ISTCS.1993.253464},
doi = {10.1109/ISTCS.1993.253464},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/istcs/KhannaLS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hpn/MalyKMOYFM92,
author = {Kurt Maly and
Sanjeev Khanna and
Ravi Mukkamala and
C. Michael Overstreet and
Ramesh Yerraballi and
Edwin C. Foudriat and
B. Madan},
editor = {Andr{\'{e}} A. S. Danthine and
Otto Spaniol},
title = {Parallel {TCP/IP} for Multiprocessor Workstations},
booktitle = {High Performance Networking IV, Proceedings of the {IFIP} {TC6/WG6.4}
Fourth International Conference on High Performance Networking, Li{\`{e}}ge,
Belgium, 14-18 December, 1992},
series = {{IFIP} Transactions},
volume = {{C-14}},
pages = {103--118},
publisher = {North-Holland},
year = {1992},
timestamp = {Fri, 30 Aug 2002 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/hpn/MalyKMOYFM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icci/MalyPOMK92,
author = {Kurt Maly and
Frank Paterra and
C. Michael Overstreet and
Ravi Mukkamala and
Sanjeev Khanna},
editor = {Waldemar W. Koczkodaj and
Peter E. Lauer and
Anestis A. Toptsis},
title = {Concurrent Use of Parallel Communication to Enable Remote Visualization},
booktitle = {Computing and Information - ICCI'92, Fourth International Conference
on Computing and Information, Toronto, Ontario, Canada, May 28-30,
1992, Proceedings},
pages = {449--452},
publisher = {{IEEE} Computer Society},
year = {1992},
timestamp = {Thu, 21 Sep 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icci/MalyPOMK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/MalyKOMZS92,
author = {Kurt Maly and
Sanjeev Khanna and
C. Michael Overstreet and
Ravi Mukkamala and
Mohammad Zubair and
Y. S. Sekhar},
editor = {Jan van Leeuwen},
title = {Multiprocessor Architectures for High Speed Networks: {A} Performance
Study},
booktitle = {Algorithms, Software, Architecture - Information Processing '92, Volume
1, Proceedings of the {IFIP} 12th World Computer Congress, Madrid,
Spain, 7-11 September 1992},
series = {{IFIP} Transactions},
volume = {{A-12}},
pages = {645--651},
publisher = {North-Holland},
year = {1992},
timestamp = {Wed, 14 Aug 2002 08:51:19 +0200},
biburl = {https://dblp.org/rec/conf/ifip/MalyKOMZS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ccr/FoudriatMOKP91,
author = {Edwin C. Foudriat and
Kurt Maly and
C. Michael Overstreet and
Sanjeev Khanna and
Frank Paterra},
title = {A carrier sensed multiple access protocol high data rate ring networks},
journal = {Comput. Commun. Rev.},
volume = {21},
number = {2},
pages = {59--70},
year = {1991},
url = {https://doi.org/10.1145/122419.122423},
doi = {10.1145/122419.122423},
timestamp = {Sun, 06 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ccr/FoudriatMOKP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/Khanna91,
author = {Sanjeev Khanna},
title = {Logic Programming for Software Verification and Testing},
journal = {Comput. J.},
volume = {34},
number = {4},
pages = {350--357},
year = {1991},
url = {https://doi.org/10.1093/comjnl/34.4.350},
doi = {10.1093/COMJNL/34.4.350},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/Khanna91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icci/Khanna90,
author = {Sanjeev Khanna},
editor = {Selim G. Akl and
Frantisek Fiala and
Waldemar W. Koczkodaj},
title = {Logic Programming for Software Testing},
booktitle = {Advances in Computing and Information - ICCI'90, International Conference
on Computing and Information, Niagara Falls, Canada, May 23-26, 1990,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {468},
pages = {225--234},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-53504-7\_79},
doi = {10.1007/3-540-53504-7\_79},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/icci/Khanna90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-08 20:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
