Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sushant Sachdeva
@inproceedings{DBLP:conf/innovations/BhattacharjeeDM24,
author = {Rajarshi Bhattacharjee and
Gregory Dexter and
Cameron Musco and
Archan Ray and
Sushant Sachdeva and
David P. Woodruff},
editor = {Venkatesan Guruswami},
title = {Universal Matrix Sparsifiers and Fast Deterministic Algorithms for
Linear Algebra},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {13:1--13:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.13},
doi = {10.4230/LIPICS.ITCS.2024.13},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BhattacharjeeDM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GoranciHRSS24,
author = {Gramoz Goranci and
Monika Henzinger and
Harald R{\"{a}}cke and
Sushant Sachdeva and
A. R. Sricharan},
editor = {Venkatesan Guruswami},
title = {Electrical Flows for Polylogarithmic Competitive Oblivious Routing},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {55:1--55:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.55},
doi = {10.4230/LIPICS.ITCS.2024.55},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GoranciHRSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrandCKLPGSS24,
author = {Jan van den Brand and
Li Chen and
Rasmus Kyng and
Yang P. Liu and
Richard Peng and
Maximilian Probst Gutenberg and
Sushant Sachdeva and
Aaron Sidford},
editor = {David P. Woodruff},
title = {Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial
Update Time},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {2980--2998},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.106},
doi = {10.1137/1.9781611977912.106},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BrandCKLPGSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DongGLSY24,
author = {Sally Dong and
Gramoz Goranci and
Lawrence Li and
Sushant Sachdeva and
Guanghao Ye},
editor = {David P. Woodruff},
title = {Fast Algorithms for Separable Linear Programs},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {3558--3604},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.127},
doi = {10.1137/1.9781611977912.127},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DongGLSY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/ChenKLPGS23,
author = {Li Chen and
Rasmus Kyng and
Yang P. Liu and
Richard Peng and
Maximilian Probst Gutenberg and
Sushant Sachdeva},
title = {Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow},
journal = {Commun. {ACM}},
volume = {66},
number = {12},
pages = {85--92},
year = {2023},
url = {https://doi.org/10.1145/3610940},
doi = {10.1145/3610940},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/ChenKLPGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChuGPSSW23,
author = {Timothy Chu and
Yu Gao and
Richard Peng and
Sushant Sachdeva and
Saurabh Sawlani and
Junxing Wang},
title = {Graph Sparsification, Spectral Sketches, and Faster Resistance Computation
via Short Cycle Decompositions},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {6},
pages = {S18--85},
year = {2023},
url = {https://doi.org/10.1137/19m1247632},
doi = {10.1137/19M1247632},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChuGPSSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Brand0PKLGSS23,
author = {Jan van den Brand and
Li Chen and
Richard Peng and
Rasmus Kyng and
Yang P. Liu and
Maximilian Probst Gutenberg and
Sushant Sachdeva and
Aaron Sidford},
title = {A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {503--514},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00037},
doi = {10.1109/FOCS57990.2023.00037},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Brand0PKLGSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LiS23,
author = {Lawrence Li and
Sushant Sachdeva},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {A New Approach to Estimating Effective Resistances and Counting Spanning
Trees in Expander Graphs},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {2728--2745},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch102},
doi = {10.1137/1.9781611977554.CH102},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/LiS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/ChenKGS23,
author = {Li Chen and
Rasmus Kyng and
Maximilian Probst Gutenberg and
Sushant Sachdeva},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A Simple Framework for Finding Balanced Sparse Cuts via {APSP}},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {42--55},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch5},
doi = {10.1137/1.9781611977585.CH5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/ChenKGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/SachdevaZ23,
author = {Sushant Sachdeva and
Yibin Zhao},
editor = {Kunal Agrawal and
Julian Shun},
title = {A Simple and Efficient Parallel Laplacian Solver},
booktitle = {Proceedings of the 35th {ACM} Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2023, Orlando, FL, USA, June 17-19, 2023},
pages = {315--325},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3558481.3591101},
doi = {10.1145/3558481.3591101},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/SachdevaZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-02491,
author = {Gramoz Goranci and
Monika Henzinger and
Harald R{\"{a}}cke and
Sushant Sachdeva and
A. R. Sricharan},
title = {Electrical Flows for Polylogarithmic Competitive Oblivious Routing},
journal = {CoRR},
volume = {abs/2303.02491},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.02491},
doi = {10.48550/ARXIV.2303.02491},
eprinttype = {arXiv},
eprint = {2303.02491},
timestamp = {Tue, 14 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-02491.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-14345,
author = {Sushant Sachdeva and
Yibin Zhao},
title = {A Simple and Efficient Parallel Laplacian Solver},
journal = {CoRR},
volume = {abs/2304.14345},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.14345},
doi = {10.48550/ARXIV.2304.14345},
eprinttype = {arXiv},
eprint = {2304.14345},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-14345.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-05826,
author = {Rajarshi Bhattacharjee and
Gregory Dexter and
Cameron Musco and
Archan Ray and
Sushant Sachdeva and
David P. Woodruff},
title = {Universal Matrix Sparsifiers and Fast Deterministic Algorithms for
Linear Algebra},
journal = {CoRR},
volume = {abs/2305.05826},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.05826},
doi = {10.48550/ARXIV.2305.05826},
eprinttype = {arXiv},
eprint = {2305.05826},
timestamp = {Tue, 14 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-05826.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-16629,
author = {Jan van den Brand and
Li Chen and
Rasmus Kyng and
Yang P. Liu and
Richard Peng and
Maximilian Probst Gutenberg and
Sushant Sachdeva and
Aaron Sidford},
title = {A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow},
journal = {CoRR},
volume = {abs/2309.16629},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.16629},
doi = {10.48550/ARXIV.2309.16629},
eprinttype = {arXiv},
eprint = {2309.16629},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-16629.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-16351,
author = {Sally Dong and
Gramoz Goranci and
Lawrence Li and
Sushant Sachdeva and
Guanghao Ye},
title = {Fast Algorithms for Separable Linear Programs},
journal = {CoRR},
volume = {abs/2310.16351},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.16351},
doi = {10.48550/ARXIV.2310.16351},
eprinttype = {arXiv},
eprint = {2310.16351},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-16351.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-03174,
author = {Jan van den Brand and
Li Chen and
Rasmus Kyng and
Yang P. Liu and
Richard Peng and
Maximilian Probst Gutenberg and
Sushant Sachdeva and
Aaron Sidford},
title = {Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial
Update Time},
journal = {CoRR},
volume = {abs/2311.03174},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.03174},
doi = {10.48550/ARXIV.2311.03174},
eprinttype = {arXiv},
eprint = {2311.03174},
timestamp = {Wed, 08 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-03174.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-06232,
author = {Sushant Sachdeva and
Anvith Thudi and
Yibin Zhao},
title = {Better Sparsifiers for Directed Eulerian Graphs},
journal = {CoRR},
volume = {abs/2311.06232},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.06232},
doi = {10.48550/ARXIV.2311.06232},
eprinttype = {arXiv},
eprint = {2311.06232},
timestamp = {Wed, 15 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-06232.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenKLPGS22,
author = {Li Chen and
Rasmus Kyng and
Yang P. Liu and
Richard Peng and
Maximilian Probst Gutenberg and
Sushant Sachdeva},
title = {Maximum Flow and Minimum-Cost Flow in Almost-Linear Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {612--623},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00064},
doi = {10.1109/FOCS54457.2022.00064},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenKLPGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/KeswaniMSV22,
author = {Vijay Keswani and
Oren Mangoubi and
Sushant Sachdeva and
Nisheeth K. Vishnoi},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {A Convergent and Dimension-Independent Min-Max Optimization Algorithm},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {10939--10973},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/keswani22a.html},
timestamp = {Tue, 12 Jul 2022 17:36:52 +0200},
biburl = {https://dblp.org/rec/conf/icml/KeswaniMSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DongGGLPSY22,
author = {Sally Dong and
Yu Gao and
Gramoz Goranci and
Yin Tat Lee and
Richard Peng and
Sushant Sachdeva and
Guanghao Ye},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear
Time},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {124--153},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.7},
doi = {10.1137/1.9781611977073.7},
timestamp = {Fri, 14 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DongGGLPSY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-00671,
author = {Li Chen and
Rasmus Kyng and
Yang P. Liu and
Richard Peng and
Maximilian Probst Gutenberg and
Sushant Sachdeva},
title = {Maximum Flow and Minimum-Cost Flow in Almost-Linear Time},
journal = {CoRR},
volume = {abs/2203.00671},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.00671},
doi = {10.48550/ARXIV.2203.00671},
eprinttype = {arXiv},
eprint = {2203.00671},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-00671.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-01562,
author = {Sally Dong and
Yu Gao and
Gramoz Goranci and
Yin Tat Lee and
Richard Peng and
Sushant Sachdeva and
Guanghao Ye},
title = {Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear
Time},
journal = {CoRR},
volume = {abs/2205.01562},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.01562},
doi = {10.48550/ARXIV.2205.01562},
eprinttype = {arXiv},
eprint = {2205.01562},
timestamp = {Fri, 14 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-01562.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-06167,
author = {Deeksha Adil and
Brian Bullins and
Arun Jambulapati and
Sushant Sachdeva},
title = {Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities},
journal = {CoRR},
volume = {abs/2205.06167},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.06167},
doi = {10.48550/ARXIV.2205.06167},
eprinttype = {arXiv},
eprint = {2205.06167},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-06167.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-08845,
author = {Li Chen and
Rasmus Kyng and
Maximilian Probst Gutenberg and
Sushant Sachdeva},
title = {A Simple Framework for Finding Balanced Sparse Cuts via {APSP}},
journal = {CoRR},
volume = {abs/2209.08845},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.08845},
doi = {10.48550/ARXIV.2209.08845},
eprinttype = {arXiv},
eprint = {2209.08845},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-08845.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-01468,
author = {Lawrence Li and
Sushant Sachdeva},
title = {A New Approach to Estimating Effective Resistances and Counting Spanning
Trees in Expander Graphs},
journal = {CoRR},
volume = {abs/2211.01468},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.01468},
doi = {10.48550/ARXIV.2211.01468},
eprinttype = {arXiv},
eprint = {2211.01468},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-01468.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03963,
author = {Deeksha Adil and
Rasmus Kyng and
Richard Peng and
Sushant Sachdeva},
title = {Fast Algorithms for {\unicode{120001}}\({}_{\mbox{p}}\)-Regression},
journal = {CoRR},
volume = {abs/2211.03963},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03963},
doi = {10.48550/ARXIV.2211.03963},
eprinttype = {arXiv},
eprint = {2211.03963},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03963.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AdilBKS21,
author = {Deeksha Adil and
Brian Bullins and
Rasmus Kyng and
Sushant Sachdeva},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Almost-Linear-Time Weighted {\unicode{120001}}\({}_{\mbox{p}}\)-Norm
Solvers in Slightly Dense Graphs via Sparsification},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {9:1--9:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.9},
doi = {10.4230/LIPICS.ICALP.2021.9},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AdilBKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AdilBS21,
author = {Deeksha Adil and
Brian Bullins and
Sushant Sachdeva},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {19122--19133},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/9f9e8cba3700df6a947a8cf91035ab84-Abstract.html},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/AdilBS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-06977,
author = {Deeksha Adil and
Brian Bullins and
Rasmus Kyng and
Sushant Sachdeva},
title = {Almost-linear-time Weighted {\unicode{120001}}\({}_{\mbox{p}}\)-norm
Solvers in Slightly Dense Graphs via Sparsification},
journal = {CoRR},
volume = {abs/2102.06977},
year = {2021},
url = {https://arxiv.org/abs/2102.06977},
eprinttype = {arXiv},
eprint = {2102.06977},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-06977.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-02432,
author = {Deeksha Adil and
Brian Bullins and
Sushant Sachdeva},
title = {Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization},
journal = {CoRR},
volume = {abs/2107.02432},
year = {2021},
url = {https://arxiv.org/abs/2107.02432},
eprinttype = {arXiv},
eprint = {2107.02432},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-02432.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/FahrbachGPSW20,
author = {Matthew Fahrbach and
Gramoz Goranci and
Richard Peng and
Sushant Sachdeva and
Chi Wang},
title = {Faster Graph Embeddings via Coarsening},
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 = {2953--2963},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v119/fahrbach20a.html},
timestamp = {Mon, 21 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/FahrbachGPSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BaoLSG20,
author = {Xuchan Bao and
James Lucas and
Sushant Sachdeva and
Roger B. Grosse},
editor = {Hugo Larochelle and
Marc'Aurelio Ranzato and
Raia Hadsell and
Maria{-}Florina Balcan and
Hsuan{-}Tien Lin},
title = {Regularized linear autoencoders recover the principal components,
eventually},
booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference
on Neural Information Processing Systems 2020, NeurIPS 2020, December
6-12, 2020, virtual},
year = {2020},
url = {https://proceedings.neurips.cc/paper/2020/hash/4dd9cec1c21bc54eecb53786a2c5fa09-Abstract.html},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/BaoLSG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AdilS20,
author = {Deeksha Adil and
Sushant Sachdeva},
editor = {Shuchi Chawla},
title = {Faster \emph{p}-norm minimizing flows, via smoothed \emph{q}-norm
problems},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {892--910},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.54},
doi = {10.1137/1.9781611975994.54},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/AdilS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-12376,
author = {Oren Mangoubi and
Sushant Sachdeva and
Nisheeth K. Vishnoi},
title = {A Provably Convergent and Practical Algorithm for Min-max Optimization
with Applications to GANs},
journal = {CoRR},
volume = {abs/2006.12376},
year = {2020},
url = {https://arxiv.org/abs/2006.12376},
eprinttype = {arXiv},
eprint = {2006.12376},
timestamp = {Tue, 23 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-12376.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-02817,
author = {Matthew Fahrbach and
Gramoz Goranci and
Richard Peng and
Sushant Sachdeva and
Chi Wang},
title = {Faster Graph Embeddings via Coarsening},
journal = {CoRR},
volume = {abs/2007.02817},
year = {2020},
url = {https://arxiv.org/abs/2007.02817},
eprinttype = {arXiv},
eprint = {2007.02817},
timestamp = {Mon, 21 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-02817.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-06731,
author = {Xuchan Bao and
James Lucas and
Sushant Sachdeva and
Roger B. Grosse},
title = {Regularized linear autoencoders recover the principal components,
eventually},
journal = {CoRR},
volume = {abs/2007.06731},
year = {2020},
url = {https://arxiv.org/abs/2007.06731},
eprinttype = {arXiv},
eprint = {2007.06731},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-06731.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/ViswanathanSTR19,
author = {Krishnamurthy Viswanathan and
Sushant Sachdeva and
Andrew Tomkins and
Sujith Ravi},
editor = {Kamalika Chaudhuri and
Masashi Sugiyama},
title = {Improved Semi-Supervised Learning with Multiple Graphs},
booktitle = {The 22nd International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2019, 16-18 April 2019, Naha, Okinawa, Japan},
series = {Proceedings of Machine Learning Research},
volume = {89},
pages = {3032--3041},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v89/viswanathan19a.html},
timestamp = {Fri, 07 Jun 2019 09:03:47 +0200},
biburl = {https://dblp.org/rec/conf/aistats/ViswanathanSTR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/ZhangLNMSDSG19,
author = {Guodong Zhang and
Lala Li and
Zachary Nado and
James Martens and
Sushant Sachdeva and
George E. Dahl and
Christopher J. Shallue and
Roger B. Grosse},
editor = {Hanna M. Wallach and
Hugo Larochelle and
Alina Beygelzimer and
Florence d'Alch{\'{e}}{-}Buc and
Emily B. Fox and
Roman Garnett},
title = {Which Algorithmic Choices Matter at Which Batch Sizes? Insights From
a Noisy Quadratic Model},
booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
on Neural Information Processing Systems 2019, NeurIPS 2019, December
8-14, 2019, Vancouver, BC, Canada},
pages = {8194--8205},
year = {2019},
url = {https://proceedings.neurips.cc/paper/2019/hash/e0eacd983971634327ae1819ea8b6214-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/ZhangLNMSDSG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AdilPS19,
author = {Deeksha Adil and
Richard Peng and
Sushant Sachdeva},
editor = {Hanna M. Wallach and
Hugo Larochelle and
Alina Beygelzimer and
Florence d'Alch{\'{e}}{-}Buc and
Emily B. Fox and
Roman Garnett},
title = {Fast, Provably convergent {IRLS} Algorithm for p-norm Linear Regression},
booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
on Neural Information Processing Systems 2019, NeurIPS 2019, December
8-14, 2019, Vancouver, BC, Canada},
pages = {14166--14177},
year = {2019},
url = {https://proceedings.neurips.cc/paper/2019/hash/46c7cb50b373877fb2f8d5c4517bb969-Abstract.html},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/AdilPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AdilKPS19,
author = {Deeksha Adil and
Rasmus Kyng and
Richard Peng and
Sushant Sachdeva},
editor = {Timothy M. Chan},
title = {Iterative Refinement for {\(\mathscr{l}\)}p-norm Regression},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1405--1424},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.86},
doi = {10.1137/1.9781611975482.86},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/AdilKPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LiuSY19,
author = {Yang P. Liu and
Sushant Sachdeva and
Zejun Yu},
editor = {Timothy M. Chan},
title = {Short Cycles via Low-Diameter Decompositions},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {2602--2615},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.161},
doi = {10.1137/1.9781611975482.161},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/LiuSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KyngPSW19,
author = {Rasmus Kyng and
Richard Peng and
Sushant Sachdeva and
Di Wang},
editor = {Moses Charikar and
Edith Cohen},
title = {Flows in almost linear time via adaptive preconditioning},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {902--913},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316410},
doi = {10.1145/3313276.3316410},
timestamp = {Fri, 19 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KyngPSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-06764,
author = {Deeksha Adil and
Rasmus Kyng and
Richard Peng and
Sushant Sachdeva},
title = {Iterative Refinement for {\unicode{120001}}\({}_{\mbox{p}}\)-norm
Regression},
journal = {CoRR},
volume = {abs/1901.06764},
year = {2019},
url = {http://arxiv.org/abs/1901.06764},
eprinttype = {arXiv},
eprint = {1901.06764},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-06764.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-10340,
author = {Rasmus Kyng and
Richard Peng and
Sushant Sachdeva and
Di Wang},
title = {Flows in Almost Linear Time via Adaptive Preconditioning},
journal = {CoRR},
volume = {abs/1906.10340},
year = {2019},
url = {http://arxiv.org/abs/1906.10340},
eprinttype = {arXiv},
eprint = {1906.10340},
timestamp = {Fri, 19 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-10340.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04164,
author = {Guodong Zhang and
Lala Li and
Zachary Nado and
James Martens and
Sushant Sachdeva and
George E. Dahl and
Christopher J. Shallue and
Roger B. Grosse},
title = {Which Algorithmic Choices Matter at Which Batch Sizes? Insights From
a Noisy Quadratic Model},
journal = {CoRR},
volume = {abs/1907.04164},
year = {2019},
url = {http://arxiv.org/abs/1907.04164},
eprinttype = {arXiv},
eprint = {1907.04164},
timestamp = {Mon, 22 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04164.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-07167,
author = {Deeksha Adil and
Richard Peng and
Sushant Sachdeva},
title = {Fast, Provably convergent {IRLS} Algorithm for p-norm Linear Regression},
journal = {CoRR},
volume = {abs/1907.07167},
year = {2019},
url = {http://arxiv.org/abs/1907.07167},
eprinttype = {arXiv},
eprint = {1907.07167},
timestamp = {Tue, 23 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-07167.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-10571,
author = {Deeksha Adil and
Sushant Sachdeva},
title = {Faster p-norm minimizing flows, via smoothed q-norm problems},
journal = {CoRR},
volume = {abs/1910.10571},
year = {2019},
url = {http://arxiv.org/abs/1910.10571},
eprinttype = {arXiv},
eprint = {1910.10571},
timestamp = {Fri, 25 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-10571.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuGPSSW18,
author = {Timothy Chu and
Yu Gao and
Richard Peng and
Sushant Sachdeva and
Saurabh Sawlani and
Junxing Wang},
editor = {Mikkel Thorup},
title = {Graph Sparsification, Spectral Sketches, and Faster Resistance Computation,
via Short Cycle Decompositions},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {361--372},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00042},
doi = {10.1109/FOCS.2018.00042},
timestamp = {Fri, 14 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChuGPSSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/PanigrahyRSZ18,
author = {Rina Panigrahy and
Ali Rahimi and
Sushant Sachdeva and
Qiuyi Zhang},
editor = {Anna R. Karlin},
title = {Convergence Results for Neural Networks via Electrodynamics},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {22:1--22:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.22},
doi = {10.4230/LIPICS.ITCS.2018.22},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/PanigrahyRSZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhangaleKKST18,
author = {Amey Bhangale and
Subhash Khot and
Swastik Kopparty and
Sushant Sachdeva and
Devanathan Thiruvenkatachari},
editor = {Artur Czumaj},
title = {Near-optimal approximation algorithm for simultaneous Max-Cut},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1407--1425},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.93},
doi = {10.1137/1.9781611975031.93},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/BhangaleKKST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-04497,
author = {Amey Bhangale and
Subhash Khot and
Swastik Kopparty and
Sushant Sachdeva and
Devanathan Thiruvenkatachari},
title = {Near-optimal approximation algorithm for simultaneous Max-Cut},
journal = {CoRR},
volume = {abs/1801.04497},
year = {2018},
url = {http://arxiv.org/abs/1801.04497},
eprinttype = {arXiv},
eprint = {1801.04497},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-04497.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-12051,
author = {Timothy Chu and
Yu Gao and
Richard Peng and
Sushant Sachdeva and
Saurabh Sawlani and
Junxing Wang},
title = {Graph Sparsification, Spectral Sketches, and Faster Resistance Computation,
via Short Cycle Decompositions},
journal = {CoRR},
volume = {abs/1805.12051},
year = {2018},
url = {http://arxiv.org/abs/1805.12051},
eprinttype = {arXiv},
eprint = {1805.12051},
timestamp = {Fri, 14 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-12051.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-05143,
author = {Yang P. Liu and
Sushant Sachdeva and
Zejun Yu},
title = {Short Cycles via Low-Diameter Decompositions},
journal = {CoRR},
volume = {abs/1810.05143},
year = {2018},
url = {http://arxiv.org/abs/1810.05143},
eprinttype = {arXiv},
eprint = {1810.05143},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-05143.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KyngPPS17,
author = {Rasmus Kyng and
Jakub Pachocki and
Richard Peng and
Sushant Sachdeva},
editor = {Philip N. Klein},
title = {A Framework for Analyzing Resparsification Algorithms},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2032--2043},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.132},
doi = {10.1137/1.9781611974782.132},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/KyngPPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurfeeKPRS17,
author = {David Durfee and
Rasmus Kyng and
John Peebles and
Anup B. Rao and
Sushant Sachdeva},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Sampling random spanning trees faster than matrix multiplication},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {730--742},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055499},
doi = {10.1145/3055399.3055499},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DurfeeKPRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ZhangPS17,
author = {Qiuyi Zhang and
Rina Panigrahy and
Sushant Sachdeva},
title = {Electron-Proton Dynamics in Deep Learning},
journal = {CoRR},
volume = {abs/1702.00458},
year = {2017},
url = {http://arxiv.org/abs/1702.00458},
eprinttype = {arXiv},
eprint = {1702.00458},
timestamp = {Mon, 02 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ZhangPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/SachdevaV16,
author = {Sushant Sachdeva and
Nisheeth K. Vishnoi},
title = {The mixing time of the Dikin walk in a polytope - {A} simple proof},
journal = {Oper. Res. Lett.},
volume = {44},
number = {5},
pages = {630--634},
year = {2016},
url = {https://doi.org/10.1016/j.orl.2016.07.005},
doi = {10.1016/J.ORL.2016.07.005},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/SachdevaV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KyngS16,
author = {Rasmus Kyng and
Sushant Sachdeva},
editor = {Irit Dinur},
title = {Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and
Simple},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {573--582},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.68},
doi = {10.1109/FOCS.2016.68},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KyngS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KyngLPSS16,
author = {Rasmus Kyng and
Yin Tat Lee and
Richard Peng and
Sushant Sachdeva and
Daniel A. Spielman},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Sparsified Cholesky and multigrid solvers for connection laplacians},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {842--850},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897640},
doi = {10.1145/2897518.2897640},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KyngLPSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KyngS16,
author = {Rasmus Kyng and
Sushant Sachdeva},
title = {Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and
Simple},
journal = {CoRR},
volume = {abs/1605.02353},
year = {2016},
url = {http://arxiv.org/abs/1605.02353},
eprinttype = {arXiv},
eprint = {1605.02353},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KyngS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KyngPPS16,
author = {Rasmus Kyng and
Jakub Pachocki and
Richard Peng and
Sushant Sachdeva},
title = {A Framework for Analyzing Resparsification Algorithms},
journal = {CoRR},
volume = {abs/1611.06940},
year = {2016},
url = {http://arxiv.org/abs/1611.06940},
eprinttype = {arXiv},
eprint = {1611.06940},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KyngPPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DurfeeKPRS16,
author = {David Durfee and
Rasmus Kyng and
John Peebles and
Anup B. Rao and
Sushant Sachdeva},
title = {Sampling Random Spanning Trees Faster than Matrix Multiplication},
journal = {CoRR},
volume = {abs/1611.07451},
year = {2016},
url = {http://arxiv.org/abs/1611.07451},
eprinttype = {arXiv},
eprint = {1611.07451},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DurfeeKPRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AroraGMS15,
author = {Sanjeev Arora and
Rong Ge and
Ankur Moitra and
Sushant Sachdeva},
title = {Provable {ICA} with Unknown Gaussian Noise, and Implications for Gaussian
Mixtures and Autoencoders},
journal = {Algorithmica},
volume = {72},
number = {1},
pages = {215--236},
year = {2015},
url = {https://doi.org/10.1007/s00453-015-9972-2},
doi = {10.1007/S00453-015-9972-2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AroraGMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GuruswamiSS15,
author = {Venkatesan Guruswami and
Sushant Sachdeva and
Rishi Saket},
title = {Inapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {1},
pages = {36--58},
year = {2015},
url = {https://doi.org/10.1137/130919416},
doi = {10.1137/130919416},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GuruswamiSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KyngRSS15,
author = {Rasmus Kyng and
Anup Rao and
Sushant Sachdeva and
Daniel A. Spielman},
editor = {Peter Gr{\"{u}}nwald and
Elad Hazan and
Satyen Kale},
title = {Algorithms for Lipschitz Learning on Graphs},
booktitle = {Proceedings of The 28th Conference on Learning Theory, {COLT} 2015,
Paris, France, July 3-6, 2015},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {40},
pages = {1190--1223},
publisher = {JMLR.org},
year = {2015},
url = {http://proceedings.mlr.press/v40/Kyng15.html},
timestamp = {Thu, 03 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/KyngRSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BhangaleKS15,
author = {Amey Bhangale and
Swastik Kopparty and
Sushant Sachdeva},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Simultaneous Approximation of Constraint Satisfaction Problems},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {193--205},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_16},
doi = {10.1007/978-3-662-47672-7\_16},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BhangaleKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/KyngRS15,
author = {Rasmus Kyng and
Anup Rao and
Sushant Sachdeva},
editor = {Corinna Cortes and
Neil D. Lawrence and
Daniel D. Lee and
Masashi Sugiyama and
Roman Garnett},
title = {Fast, Provable Algorithms for Isotonic Regression in all L{\_}p-norms},
booktitle = {Advances in Neural Information Processing Systems 28: Annual Conference
on Neural Information Processing Systems 2015, December 7-12, 2015,
Montreal, Quebec, Canada},
pages = {2719--2727},
year = {2015},
url = {https://proceedings.neurips.cc/paper/2015/hash/be53ee61104935234b174e62a07e53cf-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/KyngRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KyngRSS15,
author = {Rasmus Kyng and
Anup Rao and
Sushant Sachdeva and
Daniel A. Spielman},
title = {Algorithms for Lipschitz Learning on Graphs},
journal = {CoRR},
volume = {abs/1505.00290},
year = {2015},
url = {http://arxiv.org/abs/1505.00290},
eprinttype = {arXiv},
eprint = {1505.00290},
timestamp = {Thu, 03 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KyngRSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KyngRS15,
author = {Rasmus Kyng and
Anup Rao and
Sushant Sachdeva},
title = {Fast, Provable Algorithms for Isotonic Regression in all {\(\mathscr{l}\)}\({}_{\mbox{p}}\)-norms},
journal = {CoRR},
volume = {abs/1507.00710},
year = {2015},
url = {http://arxiv.org/abs/1507.00710},
eprinttype = {arXiv},
eprint = {1507.00710},
timestamp = {Thu, 03 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KyngRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SachdevaV15,
author = {Sushant Sachdeva and
Nisheeth K. Vishnoi},
title = {A Simple Analysis of the Dikin Walk},
journal = {CoRR},
volume = {abs/1508.01977},
year = {2015},
url = {http://arxiv.org/abs/1508.01977},
eprinttype = {arXiv},
eprint = {1508.01977},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SachdevaV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KyngLPSS15,
author = {Rasmus Kyng and
Yin Tat Lee and
Richard Peng and
Sushant Sachdeva and
Daniel A. Spielman},
title = {Sparsified Cholesky and Multigrid Solvers for Connection Laplacians},
journal = {CoRR},
volume = {abs/1512.01892},
year = {2015},
url = {http://arxiv.org/abs/1512.01892},
eprinttype = {arXiv},
eprint = {1512.01892},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KyngLPSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgf/CazalsDSS14,
author = {Fr{\'{e}}d{\'{e}}ric Cazals and
Tom Dreyfus and
Sushant Sachdeva and
N. Shah},
title = {Greedy Geometric Algorithms for Collection of Balls, with Applications
to Geometric Approximation and Molecular Coarse-Graining},
journal = {Comput. Graph. Forum},
volume = {33},
number = {6},
pages = {1--17},
year = {2014},
url = {https://doi.org/10.1111/cgf.12270},
doi = {10.1111/CGF.12270},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cgf/CazalsDSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/SachdevaV14,
author = {Sushant Sachdeva and
Nisheeth K. Vishnoi},
title = {Faster Algorithms via Approximation Theory},
journal = {Found. Trends Theor. Comput. Sci.},
volume = {9},
number = {2},
pages = {125--210},
year = {2014},
url = {https://doi.org/10.1561/0400000065},
doi = {10.1561/0400000065},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fttcs/SachdevaV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhangaleKS14,
author = {Amey Bhangale and
Swastik Kopparty and
Sushant Sachdeva},
title = {Simultaneous Approximation of Constraint Satisfaction Problems},
journal = {CoRR},
volume = {abs/1407.7759},
year = {2014},
url = {http://arxiv.org/abs/1407.7759},
eprinttype = {arXiv},
eprint = {1407.7759},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhangaleKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhangaleKS14,
author = {Amey Bhangale and
Swastik Kopparty and
Sushant Sachdeva},
title = {Simultaneous Approximation of Constraint Satisfaction Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-098}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/098},
eprinttype = {ECCC},
eprint = {TR14-098},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhangaleKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SachdevaS13,
author = {Sushant Sachdeva and
Rishi Saket},
title = {Optimal Inapproximability for Scheduling Problems via Structural Hardness
for Hypergraph Vertex Cover},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {219--229},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.30},
doi = {10.1109/CCC.2013.30},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SachdevaS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-4921,
author = {Pooya Hatami and
Sushant Sachdeva and
Madhur Tulsiani},
title = {An Arithmetic Analogue of Fox's Triangle Removal Argument},
journal = {CoRR},
volume = {abs/1304.4921},
year = {2013},
url = {http://arxiv.org/abs/1304.4921},
eprinttype = {arXiv},
eprint = {1304.4921},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-4921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0526,
author = {Sushant Sachdeva and
Nisheeth K. Vishnoi},
title = {Matrix Inversion Is As Easy As Exponentiation},
journal = {CoRR},
volume = {abs/1305.0526},
year = {2013},
url = {http://arxiv.org/abs/1305.0526},
eprinttype = {arXiv},
eprint = {1305.0526},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-0526.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SachdevaV13,
author = {Sushant Sachdeva and
Nisheeth K. Vishnoi},
title = {Approximation Theory and the Design of Fast Algorithms},
journal = {CoRR},
volume = {abs/1309.4882},
year = {2013},
url = {http://arxiv.org/abs/1309.4882},
eprinttype = {arXiv},
eprint = {1309.4882},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SachdevaV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiSS13,
author = {Venkatesan Guruswami and
Sushant Sachdeva and
Rishi Saket},
title = {Inapproximability of Minimum Vertex Cover on k-uniform k-partite Hypergraphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-071}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/071},
eprinttype = {ECCC},
eprint = {TR13-071},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AroraBMS12,
author = {Sanjeev Arora and
Arnab Bhattacharyya and
Rajsekar Manokaran and
Sushant Sachdeva},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Testing Permanent Oracles - Revisited},
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 = {362--373},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_31},
doi = {10.1007/978-3-642-32512-0\_31},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AroraBMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AroraGMS12,
author = {Sanjeev Arora and
Rong Ge and
Ankur Moitra and
Sushant Sachdeva},
editor = {Peter L. Bartlett and
Fernando C. N. Pereira and
Christopher J. C. Burges and
L{\'{e}}on Bottou and
Kilian Q. Weinberger},
title = {"Provable {ICA} with Unknown Gaussian Noise, with Implications
for Gaussian Mixtures and Autoencoders"},
booktitle = {Advances in Neural Information Processing Systems 25: 26th Annual
Conference on Neural Information Processing Systems 2012. Proceedings
of a meeting held December 3-6, 2012, Lake Tahoe, Nevada, United States},
pages = {2384--2392},
year = {2012},
url = {https://proceedings.neurips.cc/paper/2012/hash/09c6c3783b4a70054da74f2538ed47c6-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/AroraGMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/AroraGSS12,
author = {Sanjeev Arora and
Rong Ge and
Sushant Sachdeva and
Grant Schoenebeck},
editor = {Boi Faltings and
Kevin Leyton{-}Brown and
Panos Ipeirotis},
title = {Finding overlapping communities in social networks: toward a rigorous
approach},
booktitle = {Proceedings of the 13th {ACM} Conference on Electronic Commerce, {EC}
2012, Valencia, Spain, June 4-8, 2012},
pages = {37--54},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2229012.2229020},
doi = {10.1145/2229012.2229020},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/AroraGSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/OrecchiaSV12,
author = {Lorenzo Orecchia and
Sushant Sachdeva and
Nisheeth K. Vishnoi},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Approximating the exponential, the lanczos method and an {\~{O}}(\emph{m})-time
spectral algorithm for balanced separator},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {1141--1160},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214080},
doi = {10.1145/2213977.2214080},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/OrecchiaSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-5349,
author = {Sanjeev Arora and
Rong Ge and
Ankur Moitra and
Sushant Sachdeva},
title = {Provable {ICA} with Unknown Gaussian Noise, and Implications for Gaussian
Mixtures and Autoencoders},
journal = {CoRR},
volume = {abs/1206.5349},
year = {2012},
url = {http://arxiv.org/abs/1206.5349},
eprinttype = {arXiv},
eprint = {1206.5349},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-5349.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4783,
author = {Sanjeev Arora and
Arnab Bhattacharyya and
Rajsekar Manokaran and
Sushant Sachdeva},
title = {Testing Permanent Oracles -- Revisited},
journal = {CoRR},
volume = {abs/1207.4783},
year = {2012},
url = {http://arxiv.org/abs/1207.4783},
eprinttype = {arXiv},
eprint = {1207.4783},
timestamp = {Thu, 07 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-4783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AroraBMS12,
author = {Sanjeev Arora and
Arnab Bhattacharyya and
Rajsekar Manokaran and
Sushant Sachdeva},
title = {Testing Permanent Oracles - Revisited},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-094}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/094},
eprinttype = {ECCC},
eprint = {TR12-094},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AroraBMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/LoriotSBPC11,
author = {S{\'{e}}bastien Loriot and
Sushant Sachdeva and
Karine Bastard and
Chantal Pr{\'{e}}vost and
Fr{\'{e}}d{\'{e}}ric Cazals},
title = {On the Characterization and Selection of Diverse Conformational Ensembles
with Applications to Flexible Docking},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {8},
number = {2},
pages = {487--498},
year = {2011},
url = {https://doi.org/10.1109/TCBB.2009.59},
doi = {10.1109/TCBB.2009.59},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcbb/LoriotSBPC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/SachdevaS11,
author = {Sushant Sachdeva and
Rishi Saket},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite
Hypergraphs},
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 = {327--338},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_28},
doi = {10.1007/978-3-642-22935-0\_28},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/SachdevaS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1456,
author = {Sanjeev Arora and
James R. Lee and
Sushant Sachdeva},
title = {A Reformulation of the Arora-Rao-Vazirani Structure Theorem},
journal = {CoRR},
volume = {abs/1102.1456},
year = {2011},
url = {http://arxiv.org/abs/1102.1456},
eprinttype = {arXiv},
eprint = {1102.1456},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-1456.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-3383,
author = {Sushant Sachdeva and
Madhur Tulsiani},
title = {Cuts in Cartesian Products of Graphs},
journal = {CoRR},
volume = {abs/1105.3383},
year = {2011},
url = {http://arxiv.org/abs/1105.3383},
eprinttype = {arXiv},
eprint = {1105.3383},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-3383.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-4175,
author = {Sushant Sachdeva and
Rishi Saket},
title = {Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite
Hypergraphs},
journal = {CoRR},
volume = {abs/1105.4175},
year = {2011},
url = {http://arxiv.org/abs/1105.4175},
eprinttype = {arXiv},
eprint = {1105.4175},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-4175.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-1491,
author = {Lorenzo Orecchia and
Sushant Sachdeva and
Nisheeth K. Vishnoi},
title = {Approximating the Exponential, the Lanczos Method and an {\textbackslash}tilde\{O\}(m)-Time
Spectral Algorithm for Balanced Separator},
journal = {CoRR},
volume = {abs/1111.1491},
year = {2011},
url = {http://arxiv.org/abs/1111.1491},
eprinttype = {arXiv},
eprint = {1111.1491},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-1491.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-1831,
author = {Sanjeev Arora and
Rong Ge and
Sushant Sachdeva and
Grant Schoenebeck},
title = {Finding Overlapping Communities in Social Networks: Toward a Rigorous
Approach},
journal = {CoRR},
volume = {abs/1112.1831},
year = {2011},
url = {http://arxiv.org/abs/1112.1831},
eprinttype = {arXiv},
eprint = {1112.1831},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-1831.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-09 00:21 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:
