BibTeX records: Yin Tat Lee

download as .bib file

@article{DBLP:journals/talg/LeePW20,
  author    = {Yin Tat Lee and
               Marcin Pilipczuk and
               David P. Woodruff},
  title     = {Introduction to the Special Issue on SODA'18},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {16},
  number    = {1},
  pages     = {1:1--1:2},
  year      = {2020},
  url       = {https://doi.org/10.1145/3368307},
  doi       = {10.1145/3368307},
  timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/LeePW20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EliasKKL20,
  author    = {Marek Eli{\'{a}}s and
               Michael Kapralov and
               Janardhan Kulkarni and
               Yin Tat Lee},
  editor    = {Shuchi Chawla},
  title     = {Differentially Private Release of Synthetic Graphs},
  booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
               {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages     = {560--578},
  publisher = {{SIAM}},
  year      = {2020},
  url       = {https://doi.org/10.1137/1.9781611975994.34},
  doi       = {10.1137/1.9781611975994.34},
  timestamp = {Mon, 03 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/EliasKKL20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BubeckKLLS20,
  author    = {S{\'{e}}bastien Bubeck and
               Bo'az Klartag and
               Yin Tat Lee and
               Yuanzhi Li and
               Mark Sellke},
  editor    = {Shuchi Chawla},
  title     = {Chasing Nested Convex Bodies Nearly Optimally},
  booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
               {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages     = {1496--1508},
  publisher = {{SIAM}},
  year      = {2020},
  url       = {https://doi.org/10.1137/1.9781611975994.91},
  doi       = {10.1137/1.9781611975994.91},
  timestamp = {Fri, 31 Jan 2020 13:35:06 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/BubeckKLLS20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DongLQ20,
  author    = {Sally Dong and
               Yin Tat Lee and
               Kent Quanrud},
  editor    = {Shuchi Chawla},
  title     = {Computing Circle Packing Representations of Planar Graphs},
  booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
               {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages     = {2860--2875},
  publisher = {{SIAM}},
  year      = {2020},
  url       = {https://doi.org/10.1137/1.9781611975994.174},
  doi       = {10.1137/1.9781611975994.174},
  timestamp = {Fri, 31 Jan 2020 13:35:06 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/DongLQ20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-02304,
  author    = {Jan van den Brand and
               Yin Tat Lee and
               Aaron Sidford and
               Zhao Song},
  title     = {Solving Tall Dense Linear Programs in Nearly Linear Time},
  journal   = {CoRR},
  volume    = {abs/2002.02304},
  year      = {2020},
  url       = {https://arxiv.org/abs/2002.02304},
  archivePrefix = {arXiv},
  eprint    = {2002.02304},
  timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2002-02304.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-04121,
  author    = {Yin Tat Lee and
               Ruoqi Shen and
               Kevin Tian},
  title     = {Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized
               Hamiltonian Monte Carlo},
  journal   = {CoRR},
  volume    = {abs/2002.04121},
  year      = {2020},
  url       = {https://arxiv.org/abs/2002.04121},
  archivePrefix = {arXiv},
  eprint    = {2002.04121},
  timestamp = {Wed, 12 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2002-04121.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-04830,
  author    = {Arun Jambulapati and
               Yin Tat Lee and
               Jerry Li and
               Swati Padmanabhan and
               Kevin Tian},
  title     = {Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent},
  journal   = {CoRR},
  volume    = {abs/2002.04830},
  year      = {2020},
  url       = {https://arxiv.org/abs/2002.04830},
  archivePrefix = {arXiv},
  eprint    = {2002.04830},
  timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2002-04830.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-08078,
  author    = {Yair Carmon and
               Arun Jambulapati and
               Qijia Jiang and
               Yujia Jin and
               Yin Tat Lee and
               Aaron Sidford and
               Kevin Tian},
  title     = {Acceleration with a Ball Optimization Oracle},
  journal   = {CoRR},
  volume    = {abs/2003.08078},
  year      = {2020},
  url       = {https://arxiv.org/abs/2003.08078},
  archivePrefix = {arXiv},
  eprint    = {2003.08078},
  timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2003-08078.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-04250,
  author    = {Haotian Jiang and
               Yin Tat Lee and
               Zhao Song and
               Sam Chiu{-}wai Wong},
  title     = {An Improved Cutting Plane Method for Convex Optimization, Convex-Concave
               Games and its Applications},
  journal   = {CoRR},
  volume    = {abs/2004.04250},
  year      = {2020},
  url       = {https://arxiv.org/abs/2004.04250},
  archivePrefix = {arXiv},
  eprint    = {2004.04250},
  timestamp = {Tue, 14 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2004-04250.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BubeckJLLS19,
  author    = {S{\'{e}}bastien Bubeck and
               Qijia Jiang and
               Yin Tat Lee and
               Yuanzhi Li and
               Aaron Sidford},
  editor    = {Alina Beygelzimer and
               Daniel Hsu},
  title     = {Near-optimal method for highly smooth convex optimization},
  booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
               AZ, {USA}},
  series    = {Proceedings of Machine Learning Research},
  volume    = {99},
  pages     = {492--507},
  publisher = {{PMLR}},
  year      = {2019},
  url       = {http://proceedings.mlr.press/v99/bubeck19a.html},
  timestamp = {Mon, 08 Jul 2019 16:13:41 +0200},
  biburl    = {https://dblp.org/rec/conf/colt/BubeckJLLS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/CohenCLY19,
  author    = {Michael B. Cohen and
               Ben Cousins and
               Yin Tat Lee and
               Xin Yang},
  editor    = {Alina Beygelzimer and
               Daniel Hsu},
  title     = {A near-optimal algorithm for approximating the John Ellipsoid},
  booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
               AZ, {USA}},
  series    = {Proceedings of Machine Learning Research},
  volume    = {99},
  pages     = {849--873},
  publisher = {{PMLR}},
  year      = {2019},
  url       = {http://proceedings.mlr.press/v99/cohen19a.html},
  timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/colt/CohenCLY19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GasnikovDGVSU0W19,
  author    = {Alexander Gasnikov and
               Pavel E. Dvurechensky and
               Eduard A. Gorbunov and
               Evgeniya A. Vorontsova and
               Daniil Selikhanovych and
               C{\'{e}}sar A. Uribe and
               Bo Jiang and
               Haoyue Wang and
               Shuzhong Zhang and
               S{\'{e}}bastien Bubeck and
               Qijia Jiang and
               Yin Tat Lee and
               Yuanzhi Li and
               Aaron Sidford},
  editor    = {Alina Beygelzimer and
               Daniel Hsu},
  title     = {Near Optimal Methods for Minimizing Convex Functions with Lipschitz
               {\textdollar}p{\textdollar}-th Derivatives},
  booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
               AZ, {USA}},
  series    = {Proceedings of Machine Learning Research},
  volume    = {99},
  pages     = {1392--1393},
  publisher = {{PMLR}},
  year      = {2019},
  url       = {http://proceedings.mlr.press/v99/gasnikov19b.html},
  timestamp = {Thu, 22 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/colt/GasnikovDGVSU0W19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/LeeSZ19,
  author    = {Yin Tat Lee and
               Zhao Song and
               Qiuyi Zhang},
  editor    = {Alina Beygelzimer and
               Daniel Hsu},
  title     = {Solving Empirical Risk Minimization in the Current Matrix Multiplication
               Time},
  booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
               AZ, {USA}},
  series    = {Proceedings of Machine Learning Research},
  volume    = {99},
  pages     = {2140--2157},
  publisher = {{PMLR}},
  year      = {2019},
  url       = {http://proceedings.mlr.press/v99/lee19a.html},
  timestamp = {Mon, 08 Jul 2019 16:13:41 +0200},
  biburl    = {https://dblp.org/rec/conf/colt/LeeSZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabartyLS0W19,
  author    = {Deeparnab Chakrabarty and
               Yin Tat Lee and
               Aaron Sidford and
               Sahil Singla and
               Sam Chiu{-}wai Wong},
  editor    = {David Zuckerman},
  title     = {Faster Matroid Intersection},
  booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2019, Baltimore, Maryland, USA, November 9-12, 2019},
  pages     = {1146--1168},
  publisher = {{IEEE} Computer Society},
  year      = {2019},
  url       = {https://doi.org/10.1109/FOCS.2019.00072},
  doi       = {10.1109/FOCS.2019.00072},
  timestamp = {Tue, 07 Jan 2020 13:25:31 +0100},
  biburl    = {https://dblp.org/rec/conf/focs/ChakrabartyLS0W19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/BubeckLPR19,
  author    = {S{\'{e}}bastien Bubeck and
               Yin Tat Lee and
               Eric Price and
               Ilya P. Razenshteyn},
  editor    = {Kamalika Chaudhuri and
               Ruslan Salakhutdinov},
  title     = {Adversarial examples from computational constraints},
  booktitle = {Proceedings of the 36th International Conference on Machine Learning,
               {ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},
  series    = {Proceedings of Machine Learning Research},
  volume    = {97},
  pages     = {831--840},
  publisher = {{PMLR}},
  year      = {2019},
  url       = {http://proceedings.mlr.press/v97/bubeck19a.html},
  timestamp = {Tue, 11 Jun 2019 15:37:38 +0200},
  biburl    = {https://dblp.org/rec/conf/icml/BubeckLPR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/ShenL19,
  author    = {Ruoqi Shen and
               Yin Tat Lee},
  editor    = {Hanna M. Wallach and
               Hugo Larochelle and
               Alina Beygelzimer and
               Florence d'Alch{\'{e}}{-}Buc and
               Emily B. Fox and
               Roman Garnett},
  title     = {The Randomized Midpoint Method for Log-Concave Sampling},
  booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
               on Neural Information Processing Systems 2019, NeurIPS 2019, 8-14
               December 2019, Vancouver, BC, Canada},
  pages     = {2098--2109},
  year      = {2019},
  url       = {http://papers.nips.cc/paper/8483-the-randomized-midpoint-method-for-log-concave-sampling},
  timestamp = {Fri, 06 Mar 2020 16:59:09 +0100},
  biburl    = {https://dblp.org/rec/conf/nips/ShenL19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BubeckJLLS19,
  author    = {S{\'{e}}bastien Bubeck and
               Qijia Jiang and
               Yin Tat Lee and
               Yuanzhi Li and
               Aaron Sidford},
  editor    = {Hanna M. Wallach and
               Hugo Larochelle and
               Alina Beygelzimer and
               Florence d'Alch{\'{e}}{-}Buc and
               Emily B. Fox and
               Roman Garnett},
  title     = {Complexity of Highly Parallel Non-Smooth Convex Optimization},
  booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
               on Neural Information Processing Systems 2019, NeurIPS 2019, 8-14
               December 2019, Vancouver, BC, Canada},
  pages     = {13900--13909},
  year      = {2019},
  url       = {http://papers.nips.cc/paper/9541-complexity-of-highly-parallel-non-smooth-convex-optimization},
  timestamp = {Fri, 06 Mar 2020 16:59:09 +0100},
  biburl    = {https://dblp.org/rec/conf/nips/BubeckJLLS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BubeckCLL19,
  author    = {S{\'{e}}bastien Bubeck and
               Michael B. Cohen and
               James R. Lee and
               Yin Tat Lee},
  editor    = {Timothy M. Chan},
  title     = {Metrical task systems on trees via mirror descent and unfair gluing},
  booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  pages     = {89--97},
  publisher = {{SIAM}},
  year      = {2019},
  url       = {https://doi.org/10.1137/1.9781611975482.6},
  doi       = {10.1137/1.9781611975482.6},
  timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/BubeckCLL19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ArgueBCGL19,
  author    = {C. J. Argue and
               S{\'{e}}bastien Bubeck and
               Michael B. Cohen and
               Anupam Gupta and
               Yin Tat Lee},
  editor    = {Timothy M. Chan},
  title     = {A Nearly-Linear Bound for Chasing Nested Convex Bodies},
  booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  pages     = {117--122},
  publisher = {{SIAM}},
  year      = {2019},
  url       = {https://doi.org/10.1137/1.9781611975482.8},
  doi       = {10.1137/1.9781611975482.8},
  timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/ArgueBCGL19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BubeckLLS19,
  author    = {S{\'{e}}bastien Bubeck and
               Yin Tat Lee and
               Yuanzhi Li and
               Mark Sellke},
  editor    = {Moses Charikar and
               Edith Cohen},
  title     = {Competitively chasing convex bodies},
  booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
  pages     = {861--868},
  publisher = {{ACM}},
  year      = {2019},
  url       = {https://doi.org/10.1145/3313276.3316314},
  doi       = {10.1145/3313276.3316314},
  timestamp = {Sat, 22 Jun 2019 17:42:26 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/BubeckLLS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenLS19,
  author    = {Michael B. Cohen and
               Yin Tat Lee and
               Zhao Song},
  editor    = {Moses Charikar and
               Edith Cohen},
  title     = {Solving linear programs in the current matrix multiplication time},
  booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
  pages     = {938--942},
  publisher = {{ACM}},
  year      = {2019},
  url       = {https://doi.org/10.1145/3313276.3316303},
  doi       = {10.1145/3313276.3316303},
  timestamp = {Sat, 22 Jun 2019 17:42:26 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/CohenLS19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-01859,
  author    = {Yin Tat Lee and
               Swati Padmanabhan},
  title     = {An {\~{O}}(m/{\(\epsilon\)}\({}^{\mbox{3.5}}\))-Cost Algorithm for
               Semidefinite Programs with Diagonal Constraints},
  journal   = {CoRR},
  volume    = {abs/1903.01859},
  year      = {2019},
  url       = {http://arxiv.org/abs/1903.01859},
  archivePrefix = {arXiv},
  eprint    = {1903.01859},
  timestamp = {Sat, 30 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1903-01859.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-04447,
  author    = {Yin Tat Lee and
               Zhao Song and
               Qiuyi Zhang},
  title     = {Solving Empirical Risk Minimization in the Current Matrix Multiplication
               Time},
  journal   = {CoRR},
  volume    = {abs/1905.04447},
  year      = {2019},
  url       = {http://arxiv.org/abs/1905.04447},
  archivePrefix = {arXiv},
  eprint    = {1905.04447},
  timestamp = {Tue, 28 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1905-04447.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-11580,
  author    = {Michael B. Cohen and
               Ben Cousins and
               Yin Tat Lee and
               Xin Yang},
  title     = {A near-optimal algorithm for approximating the John Ellipsoid},
  journal   = {CoRR},
  volume    = {abs/1905.11580},
  year      = {2019},
  url       = {http://arxiv.org/abs/1905.11580},
  archivePrefix = {arXiv},
  eprint    = {1905.11580},
  timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1905-11580.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-10655,
  author    = {S{\'{e}}bastien Bubeck and
               Qijia Jiang and
               Yin Tat Lee and
               Yuanzhi Li and
               Aaron Sidford},
  title     = {Complexity of Highly Parallel Non-Smooth Convex Optimization},
  journal   = {CoRR},
  volume    = {abs/1906.10655},
  year      = {2019},
  url       = {http://arxiv.org/abs/1906.10655},
  archivePrefix = {arXiv},
  eprint    = {1906.10655},
  timestamp = {Fri, 28 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1906-10655.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-05503,
  author    = {Ruoqi Shen and
               Yin Tat Lee},
  title     = {The Randomized Midpoint Method for Log-Concave Sampling},
  journal   = {CoRR},
  volume    = {abs/1909.05503},
  year      = {2019},
  url       = {http://arxiv.org/abs/1909.05503},
  archivePrefix = {arXiv},
  eprint    = {1909.05503},
  timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1909-05503.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-08033,
  author    = {Yin Tat Lee and
               Aaron Sidford},
  title     = {Solving Linear Programs with Sqrt(rank) Linear System Solves},
  journal   = {CoRR},
  volume    = {abs/1910.08033},
  year      = {2019},
  url       = {http://arxiv.org/abs/1910.08033},
  archivePrefix = {arXiv},
  eprint    = {1910.08033},
  timestamp = {Tue, 22 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1910-08033.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-00612,
  author    = {Sally Dong and
               Yin Tat Lee and
               Kent Quanrud},
  title     = {Computing Circle Packing Representations of Planar Graphs},
  journal   = {CoRR},
  volume    = {abs/1911.00612},
  year      = {2019},
  url       = {http://arxiv.org/abs/1911.00612},
  archivePrefix = {arXiv},
  eprint    = {1911.00612},
  timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1911-00612.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-05656,
  author    = {Aditi Laddha and
               Yin Tat Lee and
               Santosh S. Vempala},
  title     = {Strong Self-Concordance and Sampling},
  journal   = {CoRR},
  volume    = {abs/1911.05656},
  year      = {2019},
  url       = {http://arxiv.org/abs/1911.05656},
  archivePrefix = {arXiv},
  eprint    = {1911.05656},
  timestamp = {Mon, 02 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1911-05656.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-10765,
  author    = {Deeparnab Chakrabarty and
               Yin Tat Lee and
               Aaron Sidford and
               Sahil Singla and
               Sam Chiu{-}wai Wong},
  title     = {Faster Matroid Intersection},
  journal   = {CoRR},
  volume    = {abs/1911.10765},
  year      = {2019},
  url       = {http://arxiv.org/abs/1911.10765},
  archivePrefix = {arXiv},
  eprint    = {1911.10765},
  timestamp = {Mon, 09 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1911-10765.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lee018,
  author    = {Yin Tat Lee and
               He Sun},
  title     = {Constructing Linear-Sized Spectral Sparsification in Almost-Linear
               Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {47},
  number    = {6},
  pages     = {2315--2336},
  year      = {2018},
  url       = {https://doi.org/10.1137/16M1061850},
  doi       = {10.1137/16M1061850},
  timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Lee018.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/LeeSV18,
  author    = {Yin Tat Lee and
               Aaron Sidford and
               Santosh S. Vempala},
  editor    = {S{\'{e}}bastien Bubeck and
               Vianney Perchet and
               Philippe Rigollet},
  title     = {Efficient Convex Optimization with Membership Oracles},
  booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9
               July 2018},
  series    = {Proceedings of Machine Learning Research},
  volume    = {75},
  pages     = {1292--1294},
  publisher = {{PMLR}},
  year      = {2018},
  url       = {http://proceedings.mlr.press/v75/lee18a.html},
  timestamp = {Wed, 03 Apr 2019 18:17:23 +0200},
  biburl    = {https://dblp.org/rec/conf/colt/LeeSV18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/ScamanBBML18,
  author    = {Kevin Scaman and
               Francis Bach and
               S{\'{e}}bastien Bubeck and
               Laurent Massouli{\'{e}} and
               Yin Tat Lee},
  editor    = {Samy Bengio and
               Hanna M. Wallach and
               Hugo Larochelle and
               Kristen Grauman and
               Nicol{\`{o}} Cesa{-}Bianchi and
               Roman Garnett},
  title     = {Optimal Algorithms for Non-Smooth Distributed Optimization in Networks},
  booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
               on Neural Information Processing Systems 2018, NeurIPS 2018, 3-8 December
               2018, Montr{\'{e}}al, Canada},
  pages     = {2745--2754},
  year      = {2018},
  url       = {http://papers.nips.cc/paper/7539-optimal-algorithms-for-non-smooth-distributed-optimization-in-networks},
  timestamp = {Fri, 06 Mar 2020 17:00:31 +0100},
  biburl    = {https://dblp.org/rec/conf/nips/ScamanBBML18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BubeckCLLM18,
  author    = {S{\'{e}}bastien Bubeck and
               Michael B. Cohen and
               Yin Tat Lee and
               James R. Lee and
               Aleksander Madry},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {k-server via multiscale entropic regularization},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {3--16},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188798},
  doi       = {10.1145/3188745.3188798},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/BubeckCLLM18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KwokLLR18,
  author    = {Tsz Chiu Kwok and
               Lap Chi Lau and
               Yin Tat Lee and
               Akshay Ramachandran},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {The Paulsen problem, continuous operator scaling, and smoothed analysis},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {182--189},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188794},
  doi       = {10.1145/3188745.3188794},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/KwokLLR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GargLSS18,
  author    = {Ankit Garg and
               Yin Tat Lee and
               Zhao Song and
               Nikhil Srivastava},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {A matrix expander Chernoff bound},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {1102--1114},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188890},
  doi       = {10.1145/3188745.3188890},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/GargLSS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeV18,
  author    = {Yin Tat Lee and
               Santosh S. Vempala},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {Convergence rate of riemannian Hamiltonian Monte Carlo and faster
               polytope volume computation},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {1115--1121},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188774},
  doi       = {10.1145/3188745.3188774},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/LeeV18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeV18a,
  author    = {Yin Tat Lee and
               Santosh S. Vempala},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {1122--1129},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188866},
  doi       = {10.1145/3188745.3188866},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/LeeV18a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BubeckCLL18,
  author    = {S{\'{e}}bastien Bubeck and
               Michael B. Cohen and
               Yin Tat Lee and
               Yuanzhi Li},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {An homotopy method for l\({}_{\mbox{p}}\) regression provably beyond
               self-concordance and in input-sparsity time},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {1130--1137},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188776},
  doi       = {10.1145/3188745.3188776},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/BubeckCLL18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-08865,
  author    = {C. J. Argue and
               S{\'{e}}bastien Bubeck and
               Michael B. Cohen and
               Anupam Gupta and
               Yin Tat Lee},
  title     = {A Nearly-Linear Bound for Chasing Nested Convex Bodies},
  journal   = {CoRR},
  volume    = {abs/1806.08865},
  year      = {2018},
  url       = {http://arxiv.org/abs/1806.08865},
  archivePrefix = {arXiv},
  eprint    = {1806.08865},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1806-08865.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-03465,
  author    = {Yin Tat Lee and
               Santosh S. Vempala},
  title     = {The Kannan-Lov{\'{a}}sz-Simonovits Conjecture},
  journal   = {CoRR},
  volume    = {abs/1807.03465},
  year      = {2018},
  url       = {http://arxiv.org/abs/1807.03465},
  archivePrefix = {arXiv},
  eprint    = {1807.03465},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1807-03465.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-04404,
  author    = {S{\'{e}}bastien Bubeck and
               Michael B. Cohen and
               James R. Lee and
               Yin Tat Lee},
  title     = {Metrical task systems on trees via mirror descent and unfair gluing},
  journal   = {CoRR},
  volume    = {abs/1807.04404},
  year      = {2018},
  url       = {http://arxiv.org/abs/1807.04404},
  archivePrefix = {arXiv},
  eprint    = {1807.04404},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1807-04404.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-07896,
  author    = {Michael B. Cohen and
               Yin Tat Lee and
               Zhao Song},
  title     = {Solving Linear Programs in the Current Matrix Multiplication Time},
  journal   = {CoRR},
  volume    = {abs/1810.07896},
  year      = {2018},
  url       = {http://arxiv.org/abs/1810.07896},
  archivePrefix = {arXiv},
  eprint    = {1810.07896},
  timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1810-07896.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-00887,
  author    = {S{\'{e}}bastien Bubeck and
               Yin Tat Lee and
               Yuanzhi Li and
               Mark Sellke},
  title     = {Competitively Chasing Convex Bodies},
  journal   = {CoRR},
  volume    = {abs/1811.00887},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.00887},
  archivePrefix = {arXiv},
  eprint    = {1811.00887},
  timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1811-00887.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-00999,
  author    = {S{\'{e}}bastien Bubeck and
               Yin Tat Lee and
               Yuanzhi Li and
               Mark Sellke},
  title     = {Chasing Nested Convex Bodies Nearly Optimally},
  journal   = {CoRR},
  volume    = {abs/1811.00999},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.00999},
  archivePrefix = {arXiv},
  eprint    = {1811.00999},
  timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1811-00999.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-06418,
  author    = {S{\'{e}}bastien Bubeck and
               Yin Tat Lee and
               Eric Price and
               Ilya P. Razenshteyn},
  title     = {Adversarial Examples from Cryptographic Pseudo-Random Generators},
  journal   = {CoRR},
  volume    = {abs/1811.06418},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.06418},
  archivePrefix = {arXiv},
  eprint    = {1811.06418},
  timestamp = {Sun, 25 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1811-06418.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-06243,
  author    = {Yin Tat Lee and
               Zhao Song and
               Santosh S. Vempala},
  title     = {Algorithmic Theory of ODEs and Sampling from Well-conditioned Logconcave
               Densities},
  journal   = {CoRR},
  volume    = {abs/1812.06243},
  year      = {2018},
  url       = {http://arxiv.org/abs/1812.06243},
  archivePrefix = {arXiv},
  eprint    = {1812.06243},
  timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1812-06243.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KapralovLMMS17,
  author    = {Michael Kapralov and
               Yin Tat Lee and
               Cameron Musco and
               Christopher Musco and
               Aaron Sidford},
  title     = {Single Pass Spectral Sparsification in Dynamic Streams},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {1},
  pages     = {456--477},
  year      = {2017},
  url       = {https://doi.org/10.1137/141002281},
  doi       = {10.1137/141002281},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KapralovLMMS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KwokLL17,
  author    = {Tsz Chiu Kwok and
               Lap Chi Lau and
               Yin Tat Lee},
  title     = {Improved Cheeger's Inequality and Analysis of Local Graph Partitioning
               using Vertex Expansion and Expansion Profile},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {3},
  pages     = {890--910},
  year      = {2017},
  url       = {https://doi.org/10.1137/16M1079816},
  doi       = {10.1137/16M1079816},
  timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KwokLL17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeV17,
  author    = {Yin Tat Lee and
               Santosh Srinivas Vempala},
  editor    = {Chris Umans},
  title     = {Eldan's Stochastic Localization and the {KLS} Hyperplane Conjecture:
               An Improved Lower Bound for Expansion},
  booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2017, Berkeley, CA, USA, October 15-17, 2017},
  pages     = {998--1007},
  publisher = {{IEEE} Computer Society},
  year      = {2017},
  url       = {https://doi.org/10.1109/FOCS.2017.96},
  doi       = {10.1109/FOCS.2017.96},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/LeeV17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/ScamanBBLM17,
  author    = {Kevin Scaman and
               Francis R. Bach and
               S{\'{e}}bastien Bubeck and
               Yin Tat Lee and
               Laurent Massouli{\'{e}}},
  editor    = {Doina Precup and
               Yee Whye Teh},
  title     = {Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization
               in Networks},
  booktitle = {Proceedings of the 34th International Conference on Machine Learning,
               {ICML} 2017, Sydney, NSW, Australia, 6-11 August 2017},
  series    = {Proceedings of Machine Learning Research},
  volume    = {70},
  pages     = {3027--3036},
  publisher = {{PMLR}},
  year      = {2017},
  url       = {http://proceedings.mlr.press/v70/scaman17a.html},
  timestamp = {Wed, 29 May 2019 08:41:45 +0200},
  biburl    = {https://dblp.org/rec/conf/icml/ScamanBBLM17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BubeckLE17,
  author    = {S{\'{e}}bastien Bubeck and
               Yin Tat Lee and
               Ronen Eldan},
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {Kernel-based methods for bandit convex optimization},
  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages     = {72--85},
  publisher = {{ACM}},
  year      = {2017},
  url       = {https://doi.org/10.1145/3055399.3055403},
  doi       = {10.1145/3055399.3055403},
  timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/BubeckLE17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Lee017,
  author    = {Yin Tat Lee and
               He Sun},
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {An SDP-based algorithm for linear-sized spectral sparsification},
  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages     = {678--687},
  publisher = {{ACM}},
  year      = {2017},
  url       = {https://doi.org/10.1145/3055399.3055477},
  doi       = {10.1145/3055399.3055477},
  timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/Lee017.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeV17,
  author    = {Yin Tat Lee and
               Santosh S. Vempala},
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {Geodesic walks in polytopes},
  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages     = {927--940},
  publisher = {{ACM}},
  year      = {2017},
  url       = {https://doi.org/10.1145/3055399.3055416},
  doi       = {10.1145/3055399.3055416},
  timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/LeeV17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChakrabartyLSW17,
  author    = {Deeparnab Chakrabarty and
               Yin Tat Lee and
               Aaron Sidford and
               Sam Chiu{-}wai Wong},
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {Subquadratic submodular function minimization},
  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages     = {1220--1231},
  publisher = {{ACM}},
  year      = {2017},
  url       = {https://doi.org/10.1145/3055399.3055419},
  doi       = {10.1145/3055399.3055419},
  timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/ChakrabartyLSW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeS17,
  author    = {Yin Tat Lee and
               He Sun},
  title     = {An SDP-Based Algorithm for Linear-Sized Spectral Sparsification},
  journal   = {CoRR},
  volume    = {abs/1702.08415},
  year      = {2017},
  url       = {http://arxiv.org/abs/1702.08415},
  archivePrefix = {arXiv},
  eprint    = {1702.08415},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeeS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeSV17,
  author    = {Yin Tat Lee and
               Aaron Sidford and
               Santosh S. Vempala},
  title     = {Efficient Convex Optimization with Membership Oracles},
  journal   = {CoRR},
  volume    = {abs/1706.07357},
  year      = {2017},
  url       = {http://arxiv.org/abs/1706.07357},
  archivePrefix = {arXiv},
  eprint    = {1706.07357},
  timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeeSV17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-02587,
  author    = {Tsz Chiu Kwok and
               Lap Chi Lau and
               Yin Tat Lee and
               Akshay Ramachandran},
  title     = {The Paulsen Problem, Continuous Operator Scaling, and Smoothed Analysis},
  journal   = {CoRR},
  volume    = {abs/1710.02587},
  year      = {2017},
  url       = {http://arxiv.org/abs/1710.02587},
  archivePrefix = {arXiv},
  eprint    = {1710.02587},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1710-02587.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-06261,
  author    = {Yin Tat Lee and
               Santosh Srinivas Vempala},
  title     = {Convergence Rate of Riemannian Hamiltonian Monte Carlo and Faster
               Polytope Volume Computation},
  journal   = {CoRR},
  volume    = {abs/1710.06261},
  year      = {2017},
  url       = {http://arxiv.org/abs/1710.06261},
  archivePrefix = {arXiv},
  eprint    = {1710.06261},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1710-06261.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-01085,
  author    = {S{\'{e}}bastien Bubeck and
               Michael B. Cohen and
               James R. Lee and
               Yin Tat Lee and
               Aleksander Madry},
  title     = {k-server via multiscale entropic regularization},
  journal   = {CoRR},
  volume    = {abs/1711.01085},
  year      = {2017},
  url       = {http://arxiv.org/abs/1711.01085},
  archivePrefix = {arXiv},
  eprint    = {1711.01085},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1711-01085.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-01328,
  author    = {S{\'{e}}bastien Bubeck and
               Michael B. Cohen and
               Yin Tat Lee and
               Yuanzhi Li},
  title     = {An homotopy method for {\unicode{120053}}\({}_{\mbox{p}}\) regression
               provably beyond self-concordance and in input-sparsity time},
  journal   = {CoRR},
  volume    = {abs/1711.01328},
  year      = {2017},
  url       = {http://arxiv.org/abs/1711.01328},
  archivePrefix = {arXiv},
  eprint    = {1711.01328},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1711-01328.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-08426,
  author    = {Naman Agarwal and
               Sham M. Kakade and
               Rahul Kidambi and
               Yin Tat Lee and
               Praneeth Netrapalli and
               Aaron Sidford},
  title     = {Leverage Score Sampling for Faster Accelerated Regression and {ERM}},
  journal   = {CoRR},
  volume    = {abs/1711.08426},
  year      = {2017},
  url       = {http://arxiv.org/abs/1711.08426},
  archivePrefix = {arXiv},
  eprint    = {1711.08426},
  timestamp = {Tue, 23 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1711-08426.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jscic/LeeLL16,
  author    = {Yin Tat Lee and
               Ka Chun Lam and
               Lok Ming Lui},
  title     = {Landmark-Matching Transformation with Large Deformation Via n-dimensional
               Quasi-conformal Maps},
  journal   = {J. Sci. Comput.},
  volume    = {67},
  number    = {3},
  pages     = {926--954},
  year      = {2016},
  url       = {https://doi.org/10.1007/s10915-015-0113-5},
  doi       = {10.1007/s10915-015-0113-5},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jscic/LeeLL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/BubeckL16,
  author    = {S{\'{e}}bastien Bubeck and
               Yin Tat Lee},
  editor    = {Maria{-}Florina Balcan and
               Kilian Q. Weinberger},
  title     = {Black-box Optimization with a Politician},
  booktitle = {Proceedings of the 33nd International Conference on Machine Learning,
               {ICML} 2016, New York City, NY, USA, June 19-24, 2016},
  series    = {{JMLR} Workshop and Conference Proceedings},
  volume    = {48},
  pages     = {1624--1631},
  publisher = {JMLR.org},
  year      = {2016},
  url       = {http://proceedings.mlr.press/v48/bubeck16.html},
  timestamp = {Wed, 29 May 2019 08:41:46 +0200},
  biburl    = {https://dblp.org/rec/conf/icml/BubeckL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Allen-ZhuLO16,
  author    = {Zeyuan {Allen Zhu} and
               Yin Tat Lee and
               Lorenzo Orecchia},
  editor    = {Robert Krauthgamer},
  title     = {Using Optimization to Obtain a Width-Independent, Parallel, Simpler,
               and Faster Positive {SDP} Solver},
  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages     = {1824--1831},
  publisher = {{SIAM}},
  year      = {2016},
  url       = {https://doi.org/10.1137/1.9781611974331.ch127},
  doi       = {10.1137/1.9781611974331.ch127},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/Allen-ZhuLO16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KwokLL16,
  author    = {Tsz Chiu Kwok and
               Lap Chi Lau and
               Yin Tat Lee},
  editor    = {Robert Krauthgamer},
  title     = {Improved Cheeger's Inequality and Analysis of Local Graph Partitioning
               using Vertex Expansion and Expansion Profile},
  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages     = {1848--1861},
  publisher = {{SIAM}},
  year      = {2016},
  url       = {https://doi.org/10.1137/1.9781611974331.ch129},
  doi       = {10.1137/1.9781611974331.ch129},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/KwokLL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenLMPS16,
  author    = {Michael B. Cohen and
               Yin Tat Lee and
               Gary L. Miller and
               Jakub Pachocki and
               Aaron Sidford},
  editor    = {Daniel Wichs and
               Yishay Mansour},
  title     = {Geometric median in nearly linear time},
  booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  pages     = {9--21},
  publisher = {{ACM}},
  year      = {2016},
  url       = {https://doi.org/10.1145/2897518.2897647},
  doi       = {10.1145/2897518.2897647},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/CohenLMPS16.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 = {Sat, 19 Oct 2019 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/BubeckL16,
  author    = {S{\'{e}}bastien Bubeck and
               Yin Tat Lee},
  title     = {Black-box optimization with a politician},
  journal   = {CoRR},
  volume    = {abs/1602.04847},
  year      = {2016},
  url       = {http://arxiv.org/abs/1602.04847},
  archivePrefix = {arXiv},
  eprint    = {1602.04847},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BubeckL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeV16,
  author    = {Yin Tat Lee and
               Santosh S. Vempala},
  title     = {Geodesic Walks on Polytopes},
  journal   = {CoRR},
  volume    = {abs/1606.04696},
  year      = {2016},
  url       = {http://arxiv.org/abs/1606.04696},
  archivePrefix = {arXiv},
  eprint    = {1606.04696},
  timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeeV16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CohenLMPS16,
  author    = {Michael B. Cohen and
               Yin Tat Lee and
               Gary L. Miller and
               Jakub W. Pachocki and
               Aaron Sidford},
  title     = {Geometric Median in Nearly Linear Time},
  journal   = {CoRR},
  volume    = {abs/1606.05225},
  year      = {2016},
  url       = {http://arxiv.org/abs/1606.05225},
  archivePrefix = {arXiv},
  eprint    = {1606.05225},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/CohenLMPS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BubeckEL16,
  author    = {S{\'{e}}bastien Bubeck and
               Ronen Eldan and
               Yin Tat Lee},
  title     = {Kernel-based methods for bandit convex optimization},
  journal   = {CoRR},
  volume    = {abs/1607.03084},
  year      = {2016},
  url       = {http://arxiv.org/abs/1607.03084},
  archivePrefix = {arXiv},
  eprint    = {1607.03084},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BubeckEL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChakrabartyLSW16,
  author    = {Deeparnab Chakrabarty and
               Yin Tat Lee and
               Aaron Sidford and
               Sam Chiu{-}wai Wong},
  title     = {Subquadratic Submodular Function Minimization},
  journal   = {CoRR},
  volume    = {abs/1610.09800},
  year      = {2016},
  url       = {http://arxiv.org/abs/1610.09800},
  archivePrefix = {arXiv},
  eprint    = {1610.09800},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/ChakrabartyLSW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeV16a,
  author    = {Yin Tat Lee and
               Santosh S. Vempala},
  title     = {Eldan's Stochastic Localization and the {KLS} Hyperplane Conjecture:
               An Improved Lower Bound for Expansion},
  journal   = {CoRR},
  volume    = {abs/1612.01507},
  year      = {2016},
  url       = {http://arxiv.org/abs/1612.01507},
  archivePrefix = {arXiv},
  eprint    = {1612.01507},
  timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeeV16a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeS15,
  author    = {Yin Tat Lee and
               Aaron Sidford},
  editor    = {Venkatesan Guruswami},
  title     = {Efficient Inverse Maintenance and Faster Algorithms for Linear Programming},
  booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
               2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages     = {230--249},
  publisher = {{IEEE} Computer Society},
  year      = {2015},
  url       = {https://doi.org/10.1109/FOCS.2015.23},
  doi       = {10.1109/FOCS.2015.23},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/LeeS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeS15a,
  author    = {Yin Tat Lee and
               He Sun},
  editor    = {Venkatesan Guruswami},
  title     = {Constructing Linear-Sized Spectral Sparsification in Almost-Linear
               Time},
  booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
               2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages     = {250--269},
  publisher = {{IEEE} Computer Society},
  year      = {2015},
  url       = {https://doi.org/10.1109/FOCS.2015.24},
  doi       = {10.1109/FOCS.2015.24},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/LeeS15a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeSW15,
  author    = {Yin Tat Lee and
               Aaron Sidford and
               Sam Chiu{-}wai Wong},
  editor    = {Venkatesan Guruswami},
  title     = {A Faster Cutting Plane Method and its Implications for Combinatorial
               and Convex Optimization},
  booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
               2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages     = {1049--1065},
  publisher = {{IEEE} Computer Society},
  year      = {2015},
  url       = {https://doi.org/10.1109/FOCS.2015.68},
  doi       = {10.1109/FOCS.2015.68},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/LeeSW15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CohenLMMPS15,
  author    = {Michael B. Cohen and
               Yin Tat Lee and
               Cameron Musco and
               Christopher Musco and
               Richard Peng and
               Aaron Sidford},
  editor    = {Tim Roughgarden},
  title     = {Uniform Sampling for Matrix Approximation},
  booktitle = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
               Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
  pages     = {181--190},
  publisher = {{ACM}},
  year      = {2015},
  url       = {https://doi.org/10.1145/2688073.2688113},
  doi       = {10.1145/2688073.2688113},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/innovations/CohenLMMPS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeS15,
  author    = {Yin Tat Lee and
               Aaron Sidford},
  title     = {Efficient Inverse Maintenance and Faster Algorithms for Linear Programming},
  journal   = {CoRR},
  volume    = {abs/1503.01752},
  year      = {2015},
  url       = {http://arxiv.org/abs/1503.01752},
  archivePrefix = {arXiv},
  eprint    = {1503.01752},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeeS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KwokLL15,
  author    = {Tsz Chiu Kwok and
               Lap Chi Lau and
               Yin Tat Lee},
  title     = {Improved Cheeger's Inequality and Analysis of Local Graph Partitioning
               using Vertex Expansion and Expansion Profile},
  journal   = {CoRR},
  volume    = {abs/1504.00686},
  year      = {2015},
  url       = {http://arxiv.org/abs/1504.00686},
  archivePrefix = {arXiv},
  eprint    = {1504.00686},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/KwokLL15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BubeckLS15,
  author    = {S{\'{e}}bastien Bubeck and
               Yin Tat Lee and
               Mohit Singh},
  title     = {A geometric alternative to Nesterov's accelerated gradient descent},
  journal   = {CoRR},
  volume    = {abs/1506.08187},
  year      = {2015},
  url       = {http://arxiv.org/abs/1506.08187},
  archivePrefix = {arXiv},
  eprint    = {1506.08187},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BubeckLS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeePS15,
  author    = {Yin Tat Lee and
               Richard Peng and
               Daniel A. Spielman},
  title     = {Sparsified Cholesky Solvers for {SDD} linear systems},
  journal   = {CoRR},
  volume    = {abs/1506.08204},
  year      = {2015},
  url       = {http://arxiv.org/abs/1506.08204},
  archivePrefix = {arXiv},
  eprint    = {1506.08204},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeePS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ZhuLO15a,
  author    = {Zeyuan {Allen Zhu} and
               Yin Tat Lee and
               Lorenzo Orecchia},
  title     = {Using Optimization to Obtain a Width-Independent, Parallel, Simpler,
               and Faster Positive {SDP} Solver},
  journal   = {CoRR},
  volume    = {abs/1507.02259},
  year      = {2015},
  url       = {http://arxiv.org/abs/1507.02259},
  archivePrefix = {arXiv},
  eprint    = {1507.02259},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/ZhuLO15a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeS15a,
  author    = {Yin Tat Lee and
               He Sun},
  title     = {Constructing Linear-Sized Spectral Sparsification in Almost-Linear
               Time},
  journal   = {CoRR},
  volume    = {abs/1508.03261},
  year      = {2015},
  url       = {http://arxiv.org/abs/1508.03261},
  archivePrefix = {arXiv},
  eprint    = {1508.03261},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeeS15a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeSW15,
  author    = {Yin Tat Lee and
               Aaron Sidford and
               Sam Chiu{-}wai Wong},
  title     = {A Faster Cutting Plane Method and its Implications for Combinatorial
               and Convex Optimization},
  journal   = {CoRR},
  volume    = {abs/1508.04874},
  year      = {2015},
  url       = {http://arxiv.org/abs/1508.04874},
  archivePrefix = {arXiv},
  eprint    = {1508.04874},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeeSW15.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},
  archivePrefix = {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}
}
@inproceedings{DBLP:conf/focs/LeeS14,
  author    = {Yin Tat Lee and
               Aaron Sidford},
  title     = {Path Finding Methods for Linear Programming: Solving Linear Programs
               in {\~{O}}(vrank) Iterations and Faster Algorithms for Maximum Flow},
  booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2014, Philadelphia, PA, USA, October 18-21, 2014},
  pages     = {424--433},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
  url       = {https://doi.org/10.1109/FOCS.2014.52},
  doi       = {10.1109/FOCS.2014.52},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/LeeS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KapralovLMMS14,
  author    = {Michael Kapralov and
               Yin Tat Lee and
               Cameron Musco and
               Christopher Musco and
               Aaron Sidford},
  title     = {Single Pass Spectral Sparsification in Dynamic Streams},
  booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2014, Philadelphia, PA, USA, October 18-21, 2014},
  pages     = {561--570},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
  url       = {https://doi.org/10.1109/FOCS.2014.66},
  doi       = {10.1109/FOCS.2014.66},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/KapralovLMMS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KelnerLOS14,
  author    = {Jonathan A. Kelner and
               Yin Tat Lee and
               Lorenzo Orecchia and
               Aaron Sidford},
  editor    = {Chandra Chekuri},
  title     = {An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected
               Graphs, and its Multicommodity Generalizations},
  booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages     = {217--226},
  publisher = {{SIAM}},
  year      = {2014},
  url       = {https://doi.org/10.1137/1.9781611973402.16},
  doi       = {10.1137/1.9781611973402.16},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/KelnerLOS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Lee14,
  author    = {Yin Tat Lee},
  title     = {Probabilistic Spectral Sparsification In Sublinear Time},
  journal   = {CoRR},
  volume    = {abs/1401.0085},
  year      = {2014},
  url       = {http://arxiv.org/abs/1401.0085},
  archivePrefix = {arXiv},
  eprint    = {1401.0085},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Lee14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeLL14,
  author    = {Yin Tat Lee and
               Ka Chun Lam and
               Lok Ming Lui},
  title     = {Large Deformation Registration via n-dimensional Quasi-conformal Maps},
  journal   = {CoRR},
  volume    = {abs/1402.6908},
  year      = {2014},
  url       = {http://arxiv.org/abs/1402.6908},
  archivePrefix = {arXiv},
  eprint    = {1402.6908},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeeLL14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KapralovLMMS14,
  author    = {Michael Kapralov and
               Yin Tat Lee and
               Cameron Musco and
               Christopher Musco and
               Aaron Sidford},
  title     = {Single Pass Spectral Sparsification in Dynamic Streams},
  journal   = {CoRR},
  volume    = {abs/1407.1289},
  year      = {2014},
  url       = {http://arxiv.org/abs/1407.1289},
  archivePrefix = {arXiv},
  eprint    = {1407.1289},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/KapralovLMMS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CohenLMMPS14,
  author    = {Michael B. Cohen and
               Yin Tat Lee and
               Cameron Musco and
               Christopher Musco and
               Richard Peng and
               Aaron Sidford},
  title     = {Uniform Sampling for Matrix Approximation},
  journal   = {CoRR},
  volume    = {abs/1408.5099},
  year      = {2014},
  url       = {http://arxiv.org/abs/1408.5099},
  archivePrefix = {arXiv},
  eprint    = {1408.5099},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/CohenLMMPS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeS13,
  author    = {Yin Tat Lee and
               Aaron Sidford},
  title     = {Efficient Accelerated Coordinate Descent Methods and Faster Algorithms
               for Solving Linear Systems},
  booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  pages     = {147--156},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {https://doi.org/10.1109/FOCS.2013.24},
  doi       = {10.1109/FOCS.2013.24},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/LeeS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KwokLLGT13,
  author    = {Tsz Chiu Kwok and
               Lap Chi Lau and
               Yin Tat Lee and
               Shayan Oveis Gharan and
               Luca Trevisan},
  editor    = {Dan Boneh and
               Tim Roughgarden and
               Joan Feigenbaum},
  title     = {Improved Cheeger's inequality: analysis of spectral partitioning algorithms
               through higher order spectral gap},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  pages     = {11--20},
  publisher = {{ACM}},
  year      = {2013},
  url       = {https://doi.org/10.1145/2488608.2488611},
  doi       = {10.1145/2488608.2488611},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/KwokLLGT13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeRS13,
  author    = {Yin Tat Lee and
               Satish Rao and
               Nikhil Srivastava},
  editor    = {Dan Boneh and
               Tim Roughgarden and
               Joan Feigenbaum},
  title     = {A new approach to computing maximum flows using electrical flows},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  pages     = {755--764},
  publisher = {{ACM}},
  year      = {2013},
  url       = {https://doi.org/10.1145/2488608.2488704},
  doi       = {10.1145/2488608.2488704},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/LeeRS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-5584,
  author    = {Tsz Chiu Kwok and
               Lap Chi Lau and
               Yin Tat Lee and
               Shayan Oveis Gharan and
               Luca Trevisan},
  title     = {Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms
               through Higher Order Spectral Gap},
  journal   = {CoRR},
  volume    = {abs/1301.5584},
  year      = {2013},
  url       = {http://arxiv.org/abs/1301.5584},
  archivePrefix = {arXiv},
  eprint    = {1301.5584},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1301-5584.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-2338,
  author    = {Jonathan A. Kelner and
               Lorenzo Orecchia and
               Yin Tat Lee and
               Aaron Sidford},
  title     = {An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected
               Graphs, and its Multicommodity Generalizations},
  journal   = {CoRR},
  volume    = {abs/1304.2338},
  year      = {2013},
  url       = {http://arxiv.org/abs/1304.2338},
  archivePrefix = {arXiv},
  eprint    = {1304.2338},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1304-2338.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-1922,
  author    = {Yin Tat Lee and
               Aaron Sidford},
  title     = {Efficient Accelerated Coordinate Descent Methods and Faster Algorithms
               for Solving Linear Systems},
  journal   = {CoRR},
  volume    = {abs/1305.1922},
  year      = {2013},
  url       = {http://arxiv.org/abs/1305.1922},
  archivePrefix = {arXiv},
  eprint    = {1305.1922},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1305-1922.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeS13a,
  author    = {Yin Tat Lee and
               Aaron Sidford},
  title     = {Matching the Universal Barrier Without Paying the Costs : Solving
               Linear Programs with {\~{O}}(sqrt(rank)) Linear System Solves},
  journal   = {CoRR},
  volume    = {abs/1312.6677},
  year      = {2013},
  url       = {http://arxiv.org/abs/1312.6677},
  archivePrefix = {arXiv},
  eprint    = {1312.6677},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeeS13a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeS13b,
  author    = {Yin Tat Lee and
               Aaron Sidford},
  title     = {Following the Path of Least Resistance : An {\~{O}}(m sqrt(n)) Algorithm
               for the Minimum Cost Flow Problem},
  journal   = {CoRR},
  volume    = {abs/1312.6713},
  year      = {2013},
  url       = {http://arxiv.org/abs/1312.6713},
  archivePrefix = {arXiv},
  eprint    = {1312.6713},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/LeeS13b.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics