Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jonathan A. Kelner
@article{DBLP:journals/corr/abs-2402-15409,
author = {Jonathan A. Kelner and
Frederic Koehler and
Raghu Meka and
Dhruv Rohatgi},
title = {Lasso with Latents: Efficient Estimation, Covariate Rescaling, and
Computational-Statistical Gaps},
journal = {CoRR},
volume = {abs/2402.15409},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.15409},
doi = {10.48550/ARXIV.2402.15409},
eprinttype = {arXiv},
eprint = {2402.15409},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-15409.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Kelner0LST23,
author = {Jonathan A. Kelner and
Jerry Li and
Allen Liu and
Aaron Sidford and
Kevin Tian},
editor = {Gergely Neu and
Lorenzo Rosasco},
title = {Semi-Random Sparse Recovery in Nearly-Linear Time},
booktitle = {The Thirty Sixth Annual Conference on Learning Theory, {COLT} 2023,
12-15 July 2023, Bangalore, India},
series = {Proceedings of Machine Learning Research},
volume = {195},
pages = {2352--2398},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v195/kelner23a.html},
timestamp = {Sat, 03 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/Kelner0LST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kelner0LST23,
author = {Jonathan A. Kelner and
Jerry Li and
Allen Liu and
Aaron Sidford and
Kevin Tian},
title = {Matrix Completion in Almost-Verification Time},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2102--2128},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00129},
doi = {10.1109/FOCS57990.2023.00129},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kelner0LST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/KelnerKMR23,
author = {Jonathan A. Kelner and
Frederic Koehler and
Raghu Meka and
Dhruv Rohatgi},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Feature Adaptation for Sparse Linear Regression},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/5f999632c48f87cffb214e575581e4a9-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/KelnerKMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-00480,
author = {Khashayar Gatmiry and
Jonathan A. Kelner and
Santosh S. Vempala},
title = {Sampling with Barriers: Faster Mixing via Lewis Weights},
journal = {CoRR},
volume = {abs/2303.00480},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.00480},
doi = {10.48550/ARXIV.2303.00480},
eprinttype = {arXiv},
eprint = {2303.00480},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-00480.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-16892,
author = {Jonathan A. Kelner and
Frederic Koehler and
Raghu Meka and
Dhruv Rohatgi},
title = {Feature Adaptation for Sparse Linear Regression},
journal = {CoRR},
volume = {abs/2305.16892},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.16892},
doi = {10.48550/ARXIV.2305.16892},
eprinttype = {arXiv},
eprint = {2305.16892},
timestamp = {Wed, 07 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-16892.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-03661,
author = {Jonathan A. Kelner and
Jerry Li and
Allen Liu and
Aaron Sidford and
Kevin Tian},
title = {Matrix Completion in Almost-Verification Time},
journal = {CoRR},
volume = {abs/2308.03661},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.03661},
doi = {10.48550/ARXIV.2308.03661},
eprinttype = {arXiv},
eprint = {2308.03661},
timestamp = {Tue, 22 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-03661.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KelnerMSSVY22,
author = {Jonathan A. Kelner and
Annie Marsden and
Vatsal Sharan and
Aaron Sidford and
Gregory Valiant and
Honglin Yuan},
editor = {Po{-}Ling Loh and
Maxim Raginsky},
title = {Big-Step-Little-Step: Efficient Gradient Methods for Objectives with
Multiple Scales},
booktitle = {Conference on Learning Theory, 2-5 July 2022, London, {UK}},
series = {Proceedings of Machine Learning Research},
volume = {178},
pages = {2431--2540},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v178/kelner22a.html},
timestamp = {Tue, 12 Jul 2022 17:36:51 +0200},
biburl = {https://dblp.org/rec/conf/colt/KelnerMSSVY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/GatmiryJK22,
author = {Khashayar Gatmiry and
Stefanie Jegelka and
Jonathan A. Kelner},
title = {Optimization and Adaptive Generalization of Three layer Neural Networks},
booktitle = {The Tenth International Conference on Learning Representations, {ICLR}
2022, Virtual Event, April 25-29, 2022},
publisher = {OpenReview.net},
year = {2022},
url = {https://openreview.net/forum?id=dPyRNUlttBv},
timestamp = {Sat, 20 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iclr/GatmiryJK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/KelnerKMR22,
author = {Jonathan A. Kelner and
Frederic Koehler and
Raghu Meka and
Dhruv Rohatgi},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/9a8d52eb05eb7b13f54b3d9eada667b7-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/KelnerKMR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-02824,
author = {Jonathan A. Kelner and
Frederic Koehler and
Raghu Meka and
Dhruv Rohatgi},
title = {Distributional Hardness Against Preconditioned Lasso via Erasure-Robust
Designs},
journal = {CoRR},
volume = {abs/2203.02824},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.02824},
doi = {10.48550/ARXIV.2203.02824},
eprinttype = {arXiv},
eprint = {2203.02824},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-02824.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-04002,
author = {Jonathan A. Kelner and
Jerry Li and
Allen Liu and
Aaron Sidford and
Kevin Tian},
title = {Semi-Random Sparse Recovery in Nearly-Linear Time},
journal = {CoRR},
volume = {abs/2203.04002},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.04002},
doi = {10.48550/ARXIV.2203.04002},
eprinttype = {arXiv},
eprint = {2203.04002},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-04002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KelnerKMR21,
author = {Jonathan A. Kelner and
Frederic Koehler and
Raghu Meka and
Dhruv Rohatgi},
title = {On the Power of Preconditioning in Sparse Linear Regression},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {550--561},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00061},
doi = {10.1109/FOCS52979.2021.00061},
timestamp = {Wed, 09 Mar 2022 12:12:23 +0100},
biburl = {https://dblp.org/rec/conf/focs/KelnerKMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-09207,
author = {Jonathan A. Kelner and
Frederic Koehler and
Raghu Meka and
Dhruv Rohatgi},
title = {On the Power of Preconditioning in Sparse Linear Regression},
journal = {CoRR},
volume = {abs/2106.09207},
year = {2021},
url = {https://arxiv.org/abs/2106.09207},
eprinttype = {arXiv},
eprint = {2106.09207},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-09207.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-03137,
author = {Jonathan A. Kelner and
Annie Marsden and
Vatsal Sharan and
Aaron Sidford and
Gregory Valiant and
Honglin Yuan},
title = {Big-Step-Little-Step: Efficient Gradient Methods for Objectives with
Multiple Scales},
journal = {CoRR},
volume = {abs/2111.03137},
year = {2021},
url = {https://arxiv.org/abs/2111.03137},
eprinttype = {arXiv},
eprint = {2111.03137},
timestamp = {Wed, 10 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-03137.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AhmadinejadKMPS20,
author = {AmirMahdi Ahmadinejad and
Jonathan A. Kelner and
Jack Murtagh and
John Peebles and
Aaron Sidford and
Salil P. Vadhan},
editor = {Sandy Irani},
title = {High-precision Estimation of Random Walks in Small Space},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1295--1306},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00123},
doi = {10.1109/FOCS46700.2020.00123},
timestamp = {Wed, 15 Dec 2021 10:49:16 +0100},
biburl = {https://dblp.org/rec/conf/focs/AhmadinejadKMPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/KelnerKMM20,
author = {Jonathan A. Kelner and
Frederic Koehler and
Raghu Meka and
Ankur Moitra},
editor = {Hugo Larochelle and
Marc'Aurelio Ranzato and
Raia Hadsell and
Maria{-}Florina Balcan and
Hsuan{-}Tien Lin},
title = {Learning Some Popular Gaussian Graphical Models without Condition
Number Bounds},
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/7cc980b0f894bd0cf05c37c246f215f3-Abstract.html},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/KelnerKMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarakHKKMP19,
author = {Boaz Barak and
Samuel B. Hopkins and
Jonathan A. Kelner and
Pravesh K. Kothari and
Ankur Moitra and
Aaron Potechin},
title = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {2},
pages = {687--735},
year = {2019},
url = {https://doi.org/10.1137/17M1138236},
doi = {10.1137/17M1138236},
timestamp = {Thu, 23 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BarakHKKMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-01282,
author = {Jonathan A. Kelner and
Frederic Koehler and
Raghu Meka and
Ankur Moitra},
title = {Learning Some Popular Gaussian Graphical Models without Condition
Number Bounds},
journal = {CoRR},
volume = {abs/1905.01282},
year = {2019},
url = {http://arxiv.org/abs/1905.01282},
eprinttype = {arXiv},
eprint = {1905.01282},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-01282.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-04524,
author = {AmirMahdi Ahmadinejad and
Jonathan A. Kelner and
Jack Murtagh and
John Peebles and
Aaron Sidford and
Salil P. Vadhan},
title = {High-precision Estimation of Random Walks in Small Space},
journal = {CoRR},
volume = {abs/1912.04524},
year = {2019},
url = {http://arxiv.org/abs/1912.04524},
eprinttype = {arXiv},
eprint = {1912.04524},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-04524.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohenKKPPRS18,
author = {Michael B. Cohen and
Jonathan A. Kelner and
Rasmus Kyng and
John Peebles and
Richard Peng and
Anup B. Rao and
Aaron Sidford},
editor = {Mikkel Thorup},
title = {Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse
{LU} Factorizations},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {898--909},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00089},
doi = {10.1109/FOCS.2018.00089},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CohenKKPPRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-10722,
author = {Michael B. Cohen and
Jonathan A. Kelner and
Rasmus Kyng and
John Peebles and
Richard Peng and
Anup B. Rao and
Aaron Sidford},
title = {Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse
{LU} Factorizations},
journal = {CoRR},
volume = {abs/1811.10722},
year = {2018},
url = {http://arxiv.org/abs/1811.10722},
eprinttype = {arXiv},
eprint = {1811.10722},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-10722.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Censor-HillelHK17,
author = {Keren Censor{-}Hillel and
Bernhard Haeupler and
Jonathan A. Kelner and
Petar Maymounkov},
title = {Rumor Spreading with No Dependence on Conductance},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {1},
pages = {58--79},
year = {2017},
url = {https://doi.org/10.1137/14099992X},
doi = {10.1137/14099992X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Censor-HillelHK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenKPPRSV17,
author = {Michael B. Cohen and
Jonathan A. Kelner and
John Peebles and
Richard Peng and
Anup B. Rao and
Aaron Sidford and
Adrian Vladu},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Almost-linear-time algorithms for Markov chains and new spectral primitives
for directed graphs},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {410--419},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055463},
doi = {10.1145/3055399.3055463},
timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CohenKPPRSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarakHKKMP16,
author = {Boaz Barak and
Samuel B. Hopkins and
Jonathan A. Kelner and
Pravesh Kothari and
Ankur Moitra and
Aaron Potechin},
editor = {Irit Dinur},
title = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {428--437},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.53},
doi = {10.1109/FOCS.2016.53},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BarakHKKMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohenKPPSV16,
author = {Michael B. Cohen and
Jonathan A. Kelner and
John Peebles and
Richard Peng and
Aaron Sidford and
Adrian Vladu},
editor = {Irit Dinur},
title = {Faster Algorithms for Computing the Stationary Distribution, Simulating
Random Walks, and More},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {583--592},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.69},
doi = {10.1109/FOCS.2016.69},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CohenKPPSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarakHKKMP16,
author = {Boaz Barak and
Samuel B. Hopkins and
Jonathan A. Kelner and
Pravesh Kothari and
Ankur Moitra and
Aaron Potechin},
title = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem},
journal = {CoRR},
volume = {abs/1604.03084},
year = {2016},
url = {http://arxiv.org/abs/1604.03084},
eprinttype = {arXiv},
eprint = {1604.03084},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BarakHKKMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CohenKPPSV16,
author = {Michael B. Cohen and
Jonathan A. Kelner and
John Peebles and
Richard Peng and
Aaron Sidford and
Adrian Vladu},
title = {Faster Algorithms for Computing the Stationary Distribution, Simulating
Random Walks, and More},
journal = {CoRR},
volume = {abs/1608.03270},
year = {2016},
url = {http://arxiv.org/abs/1608.03270},
eprinttype = {arXiv},
eprint = {1608.03270},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CohenKPPSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CohenKPPRSV16,
author = {Michael B. Cohen and
Jonathan A. Kelner and
John Peebles and
Richard Peng and
Anup B. Rao and
Aaron Sidford and
Adrian Vladu},
title = {Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives
for Directed Graphs},
journal = {CoRR},
volume = {abs/1611.00755},
year = {2016},
url = {http://arxiv.org/abs/1611.00755},
eprinttype = {arXiv},
eprint = {1611.00755},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CohenKPPRSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakHKKMP16,
author = {Boaz Barak and
Samuel B. Hopkins and
Jonathan A. Kelner and
Pravesh Kothari and
Ankur Moitra and
Aaron Potechin},
title = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-058}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/058},
eprinttype = {ECCC},
eprint = {TR16-058},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BarakHKKMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarakKS15,
author = {Boaz Barak and
Jonathan A. Kelner and
David Steurer},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Dictionary Learning and Tensor Decomposition via the Sum-of-Squares
Method},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {143--151},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746605},
doi = {10.1145/2746539.2746605},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BarakKS15.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 = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/KelnerLOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarakKS14,
author = {Boaz Barak and
Jonathan A. Kelner and
David Steurer},
editor = {David B. Shmoys},
title = {Rounding sum-of-squares relaxations},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {31--40},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591886},
doi = {10.1145/2591796.2591886},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BarakKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarakKS14,
author = {Boaz Barak and
Jonathan A. Kelner and
David Steurer},
title = {Dictionary Learning and Tensor Decomposition via the Sum-of-Squares
Method},
journal = {CoRR},
volume = {abs/1407.1543},
year = {2014},
url = {http://arxiv.org/abs/1407.1543},
eprinttype = {arXiv},
eprint = {1407.1543},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BarakKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KelnerL13,
author = {Jonathan A. Kelner and
Alex Levin},
title = {Spectral Sparsification in the Semi-streaming Setting},
journal = {Theory Comput. Syst.},
volume = {53},
number = {2},
pages = {243--262},
year = {2013},
url = {https://doi.org/10.1007/s00224-012-9396-1},
doi = {10.1007/S00224-012-9396-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KelnerL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AnandkumarHK13,
author = {Animashree Anandkumar and
Avinatan Hassidim and
Jonathan A. Kelner},
title = {Topology discovery of sparse random graphs with few participants},
journal = {Random Struct. Algorithms},
volume = {43},
number = {1},
pages = {16--48},
year = {2013},
url = {https://doi.org/10.1002/rsa.20420},
doi = {10.1002/RSA.20420},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AnandkumarHK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KelnerOSZ13,
author = {Jonathan A. Kelner and
Lorenzo Orecchia and
Aaron Sidford and
Zeyuan Allen Zhu},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {A simple, combinatorial algorithm for solving {SDD} systems in nearly-linear
time},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {911--920},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488724},
doi = {10.1145/2488608.2488724},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KelnerOSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-6628,
author = {Jonathan A. Kelner and
Lorenzo Orecchia and
Aaron Sidford and
Zeyuan Allen Zhu},
title = {A Simple, Combinatorial Algorithm for Solving {SDD} Systems in Nearly-Linear
Time},
journal = {CoRR},
volume = {abs/1301.6628},
year = {2013},
url = {http://arxiv.org/abs/1301.6628},
eprinttype = {arXiv},
eprint = {1301.6628},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-6628.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},
eprinttype = {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/BarakKS13,
author = {Boaz Barak and
Jonathan A. Kelner and
David Steurer},
title = {Rounding Sum-of-Squares Relaxations},
journal = {CoRR},
volume = {abs/1312.6652},
year = {2013},
url = {http://arxiv.org/abs/1312.6652},
eprinttype = {arXiv},
eprint = {1312.6652},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BarakKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakKS13,
author = {Boaz Barak and
Jonathan A. Kelner and
David Steurer},
title = {Rounding Sum-of-Squares Relaxations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-184}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/184},
eprinttype = {ECCC},
eprint = {TR13-184},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BarakKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/AaronsonFGHKL12,
author = {Scott Aaronson and
Edward Farhi and
David Gosset and
Avinatan Hassidim and
Jonathan A. Kelner and
Andrew Lutomirski},
title = {Quantum money},
journal = {Commun. {ACM}},
volume = {55},
number = {8},
pages = {84--92},
year = {2012},
url = {https://doi.org/10.1145/2240236.2240258},
doi = {10.1145/2240236.2240258},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/AaronsonFGHKL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/popl/ZhuMKR12,
author = {Zeyuan Allen Zhu and
Sasa Misailovic and
Jonathan A. Kelner and
Martin C. Rinard},
editor = {John Field and
Michael Hicks},
title = {Randomized accuracy-aware program transformations for efficient approximate
computations},
booktitle = {Proceedings of the 39th {ACM} {SIGPLAN-SIGACT} Symposium on Principles
of Programming Languages, {POPL} 2012, Philadelphia, Pennsylvania,
USA, January 22-28, 2012},
pages = {441--454},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2103656.2103710},
doi = {10.1145/2103656.2103710},
timestamp = {Thu, 24 Jun 2021 16:19:31 +0200},
biburl = {https://dblp.org/rec/conf/popl/ZhuMKR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KelnerMP12,
author = {Jonathan A. Kelner and
Gary L. Miller and
Richard Peng},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Faster approximate multicommodity flow using quadratically coupled
flows},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {1--18},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2213979},
doi = {10.1145/2213977.2213979},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KelnerMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarakBHKSZ12,
author = {Boaz Barak and
Fernando G. S. L. Brand{\~{a}}o and
Aram W. Harrow and
Jonathan A. Kelner and
David Steurer and
Yuan Zhou},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Hypercontractivity, sum-of-squares proofs, and their applications},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {307--326},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214006},
doi = {10.1145/2213977.2214006},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BarakBHKSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Censor-HillelHKM12,
author = {Keren Censor{-}Hillel and
Bernhard Haeupler and
Jonathan A. Kelner and
Petar Maymounkov},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Global computation in a poorly connected world: fast rumor spreading
with no dependence on conductance},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {961--970},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214064},
doi = {10.1145/2213977.2214064},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Censor-HillelHKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-3367,
author = {Jonathan A. Kelner and
Gary L. Miller and
Richard Peng},
title = {Faster Approximate Multicommodity Flow Using Quadratically Coupled
Flows},
journal = {CoRR},
volume = {abs/1202.3367},
year = {2012},
url = {http://arxiv.org/abs/1202.3367},
eprinttype = {arXiv},
eprint = {1202.3367},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-3367.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-4484,
author = {Boaz Barak and
Fernando G. S. L. Brand{\~{a}}o and
Aram W. Harrow and
Jonathan A. Kelner and
David Steurer and
Yuan Zhou},
title = {Hypercontractivity, Sum-of-Squares Proofs, and their Applications},
journal = {CoRR},
volume = {abs/1205.4484},
year = {2012},
url = {http://arxiv.org/abs/1205.4484},
eprinttype = {arXiv},
eprint = {1205.4484},
timestamp = {Mon, 12 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-4484.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KelnerM11,
author = {Jonathan A. Kelner and
Petar Maymounkov},
title = {Electric routing and concurrent flow cutting},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {32},
pages = {4123--4135},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.06.013},
doi = {10.1016/J.TCS.2010.06.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KelnerM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmetrics/AnandkumarHK11,
author = {Animashree Anandkumar and
Avinatan Hassidim and
Jonathan A. Kelner},
editor = {Arif Merchant and
Kimberly Keeton and
Dan Rubenstein},
title = {Topology discovery of sparse random graphs with few participants},
booktitle = {{SIGMETRICS} 2011, Proceedings of the 2011 {ACM} {SIGMETRICS} International
Conference on Measurement and Modeling of Computer Systems, San Jose,
CA, USA, 07-11 June 2011 (Co-located with {FCRC} 2011)},
pages = {293--304},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993744.1993774},
doi = {10.1145/1993744.1993774},
timestamp = {Sun, 01 Aug 2021 14:20:40 +0200},
biburl = {https://dblp.org/rec/conf/sigmetrics/AnandkumarHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KelnerL11,
author = {Jonathan A. Kelner and
Alex Levin},
editor = {Thomas Schwentick and
Christoph D{\"{u}}rr},
title = {Spectral Sparsification in the Semi-Streaming Setting},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2011, March 10-12, 2011, Dortmund, Germany},
series = {LIPIcs},
volume = {9},
pages = {440--451},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.STACS.2011.440},
doi = {10.4230/LIPICS.STACS.2011.440},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KelnerL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChristianoKMST11,
author = {Paul F. Christiano and
Jonathan A. Kelner and
Aleksander Madry and
Daniel A. Spielman and
Shang{-}Hua Teng},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Electrical flows, laplacian systems, and faster approximation of maximum
flow in undirected graphs},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {273--282},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993674},
doi = {10.1145/1993636.1993674},
timestamp = {Thu, 01 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChristianoKMST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-5063,
author = {Animashree Anandkumar and
Avinatan Hassidim and
Jonathan A. Kelner},
title = {Topology Discovery of Sparse Random Graphs With Few Participants},
journal = {CoRR},
volume = {abs/1102.5063},
year = {2011},
url = {http://arxiv.org/abs/1102.5063},
eprinttype = {arXiv},
eprint = {1102.5063},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-5063.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-2944,
author = {Keren Censor{-}Hillel and
Bernhard Haeupler and
Jonathan A. Kelner and
Petar Maymounkov},
title = {Global Computation in a Poorly Connected World: Fast Rumor Spreading
with No Dependence on Conductance},
journal = {CoRR},
volume = {abs/1104.2944},
year = {2011},
url = {http://arxiv.org/abs/1104.2944},
eprinttype = {arXiv},
eprint = {1104.2944},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-2944.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LutomirskiAFGKHS10,
author = {Andrew Lutomirski and
Scott Aaronson and
Edward Farhi and
David Gosset and
Jonathan A. Kelner and
Avinatan Hassidim and
Peter W. Shor},
editor = {Andrew Chi{-}Chih Yao},
title = {Breaking and Making Quantum Money: Toward a New Quantum Cryptographic
Protocol},
booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
Beijing, China, January 5-7, 2010. Proceedings},
pages = {20--31},
publisher = {Tsinghua University Press},
year = {2010},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/2.html},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/LutomirskiAFGKHS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-3594,
author = {Jonathan A. Kelner and
James R. Lee and
Gregory N. Price and
Shang{-}Hua Teng},
title = {Metric uniformization and spectral bounds for graphs},
journal = {CoRR},
volume = {abs/1008.3594},
year = {2010},
url = {http://arxiv.org/abs/1008.3594},
eprinttype = {arXiv},
eprint = {1008.3594},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-3594.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-2921,
author = {Paul F. Christiano and
Jonathan A. Kelner and
Aleksander Madry and
Daniel A. Spielman and
Shang{-}Hua Teng},
title = {Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum
Flow in Undirected Graphs},
journal = {CoRR},
volume = {abs/1010.2921},
year = {2010},
url = {http://arxiv.org/abs/1010.2921},
eprinttype = {arXiv},
eprint = {1010.2921},
timestamp = {Thu, 01 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-2921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KelnerM09,
author = {Jonathan A. Kelner and
Aleksander Madry},
title = {Faster Generation of Random Spanning Trees},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {13--21},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.75},
doi = {10.1109/FOCS.2009.75},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KelnerM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HassidimKNO09,
author = {Avinatan Hassidim and
Jonathan A. Kelner and
Huy N. Nguyen and
Krzysztof Onak},
title = {Local Graph Partitions for Approximation and Testing},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {22--31},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.77},
doi = {10.1109/FOCS.2009.77},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HassidimKNO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KelnerLPT09,
author = {Jonathan A. Kelner and
James R. Lee and
Gregory N. Price and
Shang{-}Hua Teng},
title = {Higher Eigenvalues of Graphs},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {735--744},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.69},
doi = {10.1109/FOCS.2009.69},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KelnerLPT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/DaitchKS09,
author = {Samuel I. Daitch and
Jonathan A. Kelner and
Daniel A. Spielman},
editor = {Andrea Pohoreckyj Danyluk and
L{\'{e}}on Bottou and
Michael L. Littman},
title = {Fitting a graph to vector data},
booktitle = {Proceedings of the 26th Annual International Conference on Machine
Learning, {ICML} 2009, Montreal, Quebec, Canada, June 14-18, 2009},
series = {{ACM} International Conference Proceeding Series},
volume = {382},
pages = {201--208},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1553374.1553400},
doi = {10.1145/1553374.1553400},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/DaitchKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KelnerM09,
author = {Jonathan A. Kelner and
Petar Maymounkov},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Electric Routing and Concurrent Flow Cutting},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {792--801},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_80},
doi = {10.1007/978-3-642-10631-6\_80},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KelnerM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0908-1448,
author = {Jonathan A. Kelner and
Aleksander Madry},
title = {Faster generation of random spanning trees},
journal = {CoRR},
volume = {abs/0908.1448},
year = {2009},
url = {http://arxiv.org/abs/0908.1448},
eprinttype = {arXiv},
eprint = {0908.1448},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0908-1448.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-2859,
author = {Jonathan A. Kelner and
Petar Maymounkov},
title = {Electric routing and concurrent flow cutting},
journal = {CoRR},
volume = {abs/0909.2859},
year = {2009},
url = {http://arxiv.org/abs/0909.2859},
eprinttype = {arXiv},
eprint = {0909.2859},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-2859.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KelnerN07,
author = {Jonathan A. Kelner and
Evdokia Nikolova},
title = {On the Hardness and Smoothed Complexity of Quasi-Concave Minimization},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {472--482},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.49},
doi = {10.1109/FOCS.2007.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KelnerN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Kelner06,
author = {Jonathan A. Kelner},
title = {New geometric techniques for linear programming and graph partitioning},
school = {Massachusetts Institute of Technology, Cambridge, MA, {USA}},
year = {2006},
url = {https://hdl.handle.net/1721.1/38295},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ndltd/Kelner06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kelner06,
author = {Jonathan A. Kelner},
title = {Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for
Graphs of Bounded Genus},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {4},
pages = {882--902},
year = {2006},
url = {https://doi.org/10.1137/S0097539705447244},
doi = {10.1137/S0097539705447244},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kelner06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/NikolovaKBM06,
author = {Evdokia Nikolova and
Jonathan A. Kelner and
Matthew Brand and
Michael Mitzenmacher},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Stochastic Shortest Paths Via Quasi-convex Maximization},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {552--563},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_50},
doi = {10.1007/11841036\_50},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/NikolovaKBM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KelnerS06,
author = {Jonathan A. Kelner and
Daniel A. Spielman},
editor = {Jon M. Kleinberg},
title = {A randomized polynomial-time simplex algorithm for linear programming},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {51--60},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132524},
doi = {10.1145/1132516.1132524},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KelnerS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-156,
author = {Jonathan A. Kelner and
Daniel A. Spielman},
title = {A Randomized Polynomial-Time Simplex Algorithm for Linear Programming
(Preliminary Version)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-156}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-156/index.html},
eprinttype = {ECCC},
eprint = {TR05-156},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-156.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kelner04,
author = {Jonathan A. Kelner},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Spectral partitioning, eigenvalue bounds, and circle packings for
graphs of bounded genus},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {455--464},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007357},
doi = {10.1145/1007352.1007357},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kelner04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GoyalKK02,
author = {Vivek K. Goyal and
Jonathan A. Kelner and
Jelena Kovacevic},
title = {Multiple description vector quantization with a coarse lattice},
journal = {{IEEE} Trans. Inf. Theory},
volume = {48},
number = {3},
pages = {781--788},
year = {2002},
url = {https://doi.org/10.1109/18.986048},
doi = {10.1109/18.986048},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GoyalKK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/KelnerGK00,
author = {Jonathan A. Kelner and
Vivek K. Goyal and
Jelena Kovacevic},
title = {Multiple Description Lattice Vector Quantization: Variations and Extensions},
booktitle = {Data Compression Conference, {DCC} 2000, Snowbird, Utah, USA, March
28-30, 2000},
pages = {480--489},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/DCC.2000.838188},
doi = {10.1109/DCC.2000.838188},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/KelnerGK00.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-04-25 02:45 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:
