Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Nicholas J. A. Harvey
@inproceedings{DBLP:conf/nips/KunstnerP0H23, author = {Frederik Kunstner and Victor Sanches Portella and Mark Schmidt and Nicholas J. A. Harvey}, editor = {Alice Oh and Tristan Naumann and Amir Globerson and Kate Saenko and Moritz Hardt and Sergey Levine}, title = {Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking}, 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/07e436cdeb48e2a67618274f5d5eff85-Abstract-Conference.html}, timestamp = {Fri, 01 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/KunstnerP0H23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2306-02527, author = {Frederik Kunstner and Victor S. Portella and Mark Schmidt and Nick Harvey}, title = {Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking}, journal = {CoRR}, volume = {abs/2306.02527}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2306.02527}, doi = {10.48550/ARXIV.2306.02527}, eprinttype = {arXiv}, eprint = {2306.02527}, timestamp = {Wed, 14 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2306-02527.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jmlr/FangHPF22, author = {Huang Fang and Nicholas J. A. Harvey and Victor S. Portella and Michael P. Friedlander}, title = {Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case}, journal = {J. Mach. Learn. Res.}, volume = {23}, pages = {121:1--121:38}, year = {2022}, url = {http://jmlr.org/papers/v23/21-1027.html}, timestamp = {Wed, 07 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/FangHPF22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alt/GreenstreetHP22, author = {Laura Greenstreet and Nicholas J. A. Harvey and Victor Sanches Portella}, editor = {Sanjoy Dasgupta and Nika Haghtalab}, title = {Efficient and Optimal Fixed-Time Regret with Two Experts}, booktitle = {International Conference on Algorithmic Learning Theory, 29 March - 1 April 2022, Paris, France}, series = {Proceedings of Machine Learning Research}, volume = {167}, pages = {436--464}, publisher = {{PMLR}}, year = {2022}, url = {https://proceedings.mlr.press/v167/greenstreet22a.html}, timestamp = {Fri, 10 Mar 2023 11:41:45 +0100}, biburl = {https://dblp.org/rec/conf/alt/GreenstreetHP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2203-07577, author = {Laura Greenstreet and Nicholas J. A. Harvey and Victor Sanches Portella}, title = {Efficient and Optimal Fixed-Time Regret with Two Experts}, journal = {CoRR}, volume = {abs/2203.07577}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2203.07577}, doi = {10.48550/ARXIV.2203.07577}, eprinttype = {arXiv}, eprint = {2203.07577}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2203-07577.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2206-00236, author = {Victor Sanches Portella and Christopher Liaw and Nicholas J. A. Harvey}, title = {Continuous Prediction with Experts' Advice}, journal = {CoRR}, volume = {abs/2206.00236}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2206.00236}, doi = {10.48550/ARXIV.2206.00236}, eprinttype = {arXiv}, eprint = {2206.00236}, timestamp = {Mon, 13 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2206-00236.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/AshtianiBHLMP20, author = {Hassan Ashtiani and Shai Ben{-}David and Nicholas J. A. Harvey and Christopher Liaw and Abbas Mehrabian and Yaniv Plan}, title = {Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes}, journal = {J. {ACM}}, volume = {67}, number = {6}, pages = {32:1--32:42}, year = {2020}, url = {https://doi.org/10.1145/3417994}, doi = {10.1145/3417994}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/AshtianiBHLMP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/HarveyV20, author = {Nicholas J. A. Harvey and Jan Vondr{\'{a}}k}, title = {An Algorithmic Proof of the Lov{\'{a}}sz Local Lemma via Resampling Oracles}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {2}, pages = {394--428}, year = {2020}, url = {https://doi.org/10.1137/18M1167176}, doi = {10.1137/18M1167176}, timestamp = {Wed, 20 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/HarveyV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HarveyLPR20, author = {Nicholas J. A. Harvey and Christopher Liaw and Edwin A. Perkins and Sikander Randhawa}, editor = {Sandy Irani}, title = {Optimal anytime regret for two experts}, booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2020, Durham, NC, USA, November 16-19, 2020}, pages = {1404--1415}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/FOCS46700.2020.00132}, doi = {10.1109/FOCS46700.2020.00132}, timestamp = {Wed, 15 Dec 2021 10:49:16 +0100}, biburl = {https://dblp.org/rec/conf/focs/HarveyLPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/FangHPF20, author = {Huang Fang and Nick Harvey and Victor S. Portella and Michael P. Friedlander}, title = {Online mirror descent and dual averaging: keeping pace in the dynamic case}, booktitle = {Proceedings of the 37th International Conference on Machine Learning, {ICML} 2020, 13-18 July 2020, Virtual Event}, series = {Proceedings of Machine Learning Research}, volume = {119}, pages = {3008--3017}, publisher = {{PMLR}}, year = {2020}, url = {http://proceedings.mlr.press/v119/fang20a.html}, timestamp = {Tue, 15 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icml/FangHPF20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/HarveyLS20, author = {Nicholas J. A. Harvey and Christopher Liaw and Tasuku Soma}, editor = {Hugo Larochelle and Marc'Aurelio Ranzato and Raia Hadsell and Maria{-}Florina Balcan and Hsuan{-}Tien Lin}, title = {Improved Algorithms for Online Submodular Maximization via First-order Regret 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/0163cceb20f5ca7b313419c068abd9dc-Abstract.html}, timestamp = {Tue, 19 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/HarveyLS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/ZhouP0H20, author = {Yihan Zhou and Victor S. Portella and Mark Schmidt and Nicholas J. A. Harvey}, editor = {Hugo Larochelle and Marc'Aurelio Ranzato and Raia Hadsell and Maria{-}Florina Balcan and Hsuan{-}Tien Lin}, title = {Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses}, 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/b67fb3360ae5597d85a005153451dd4e-Abstract.html}, timestamp = {Tue, 19 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/ZhouP0H20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-08994, author = {Nicholas J. A. Harvey and Christopher Liaw and Edwin A. Perkins and Sikander Randhawa}, title = {Optimal anytime regret with two experts}, journal = {CoRR}, volume = {abs/2002.08994}, year = {2020}, url = {https://arxiv.org/abs/2002.08994}, eprinttype = {arXiv}, eprint = {2002.08994}, timestamp = {Mon, 25 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-08994.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2006-02585, author = {Huang Fang and Nicholas J. A. Harvey and Victor S. Portella and Michael P. Friedlander}, title = {Online mirror descent and dual averaging: keeping pace in the dynamic case}, journal = {CoRR}, volume = {abs/2006.02585}, year = {2020}, url = {https://arxiv.org/abs/2006.02585}, eprinttype = {arXiv}, eprint = {2006.02585}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-02585.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2010-12033, author = {Yihan Zhou and Victor S. Portella and Mark Schmidt and Nicholas J. A. Harvey}, title = {Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses}, journal = {CoRR}, volume = {abs/2010.12033}, year = {2020}, url = {https://arxiv.org/abs/2010.12033}, eprinttype = {arXiv}, eprint = {2010.12033}, timestamp = {Thu, 29 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2010-12033.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jmlr/BartlettHLM19, author = {Peter L. Bartlett and Nick Harvey and Christopher Liaw and Abbas Mehrabian}, title = {Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks}, journal = {J. Mach. Learn. Res.}, volume = {20}, pages = {63:1--63:17}, year = {2019}, url = {http://jmlr.org/papers/v20/17-612.html}, timestamp = {Wed, 10 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/BartlettHLM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FungHHP19, author = {Wai Shing Fung and Ramesh Hariharan and Nicholas J. A. Harvey and Debmalya Panigrahi}, title = {A General Framework for Graph Sparsification}, journal = {{SIAM} J. Comput.}, volume = {48}, number = {4}, pages = {1196--1223}, year = {2019}, url = {https://doi.org/10.1137/16M1091666}, doi = {10.1137/16M1091666}, timestamp = {Fri, 27 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/FungHHP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HarveyLPR19, author = {Nicholas J. A. Harvey and Christopher Liaw and Yaniv Plan and Sikander Randhawa}, editor = {Alina Beygelzimer and Daniel Hsu}, title = {Tight analyses for non-smooth stochastic gradient descent}, booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix, AZ, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {99}, pages = {1579--1613}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v99/harvey19a.html}, timestamp = {Mon, 08 Jul 2019 16:13:41 +0200}, biburl = {https://dblp.org/rec/conf/colt/HarveyLPR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1909-00843, author = {Nicholas J. A. Harvey and Christopher Liaw and Sikander Randhawa}, title = {Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent}, journal = {CoRR}, volume = {abs/1909.00843}, year = {2019}, url = {http://arxiv.org/abs/1909.00843}, eprinttype = {arXiv}, eprint = {1909.00843}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1909-00843.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BalcanH18, author = {Maria{-}Florina Balcan and Nicholas J. A. Harvey}, title = {Submodular Functions: Learnability, Structure, and Optimization}, journal = {{SIAM} J. Comput.}, volume = {47}, number = {3}, pages = {703--754}, year = {2018}, url = {https://doi.org/10.1137/120888909}, doi = {10.1137/120888909}, timestamp = {Mon, 23 Jul 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/BalcanH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/AshtianiBHLMP18, author = {Hassan Ashtiani and Shai Ben{-}David and Nicholas J. A. Harvey and Christopher Liaw and Abbas Mehrabian and Yaniv Plan}, editor = {Samy Bengio and Hanna M. Wallach and Hugo Larochelle and Kristen Grauman and Nicol{\`{o}} Cesa{-}Bianchi and Roman Garnett}, title = {Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes}, booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montr{\'{e}}al, Canada}, pages = {3416--3425}, year = {2018}, url = {https://proceedings.neurips.cc/paper/2018/hash/70ece1e1e0931919438fcfc6bd5f199c-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/AshtianiBHLMP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HarveySV18, author = {Nicholas J. A. Harvey and Piyush Srivastava and Jan Vondr{\'{a}}k}, editor = {Artur Czumaj}, title = {Computing the Independence Polynomial: from the Tree Threshold down to the Roots}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018}, pages = {1557--1576}, publisher = {{SIAM}}, year = {2018}, url = {https://doi.org/10.1137/1.9781611975031.102}, doi = {10.1137/1.9781611975031.102}, timestamp = {Thu, 21 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/HarveySV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/HarveyLL18, author = {Nicholas J. A. Harvey and Christopher Liaw and Paul Liu}, editor = {Christian Scheideler and Jeremy T. Fineman}, title = {Greedy and Local Ratio Algorithms in the MapReduce Model}, booktitle = {Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, {SPAA} 2018, Vienna, Austria, July 16-18, 2018}, pages = {43--52}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3210377.3210386}, doi = {10.1145/3210377.3210386}, timestamp = {Tue, 19 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/spaa/HarveyLL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-06421, author = {Nicholas J. A. Harvey and Christopher Liaw and Paul Liu}, title = {Greedy and Local Ratio Algorithms in the MapReduce Model}, journal = {CoRR}, volume = {abs/1806.06421}, year = {2018}, url = {http://arxiv.org/abs/1806.06421}, eprinttype = {arXiv}, eprint = {1806.06421}, timestamp = {Tue, 19 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-06421.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1812-05217, author = {Nicholas J. A. Harvey and Christopher Liaw and Yaniv Plan and Sikander Randhawa}, title = {Tight Analyses for Non-Smooth Stochastic Gradient Descent}, journal = {CoRR}, volume = {abs/1812.05217}, year = {2018}, url = {http://arxiv.org/abs/1812.05217}, eprinttype = {arXiv}, eprint = {1812.05217}, timestamp = {Tue, 01 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1812-05217.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HarveyL17, author = {Nicholas J. A. Harvey and Christopher Liaw}, title = {Rainbow Hamilton cycles and lopsidependency}, journal = {Discret. Math.}, volume = {340}, number = {6}, pages = {1261--1270}, year = {2017}, url = {https://doi.org/10.1016/j.disc.2017.01.026}, doi = {10.1016/J.DISC.2017.01.026}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HarveyL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HarveyLM17, author = {Nick Harvey and Christopher Liaw and Abbas Mehrabian}, editor = {Satyen Kale and Ohad Shamir}, title = {Nearly-tight VC-dimension bounds for piecewise linear neural networks}, booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017, Amsterdam, The Netherlands, 7-10 July 2017}, series = {Proceedings of Machine Learning Research}, volume = {65}, pages = {1064--1068}, publisher = {{PMLR}}, year = {2017}, url = {http://proceedings.mlr.press/v65/harvey17a.html}, timestamp = {Wed, 29 May 2019 08:41:46 +0200}, biburl = {https://dblp.org/rec/conf/colt/HarveyLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HarveyLM17, author = {Nick Harvey and Christopher Liaw and Abbas Mehrabian}, title = {Nearly-tight VC-dimension bounds for piecewise linear neural networks}, journal = {CoRR}, volume = {abs/1703.02930}, year = {2017}, url = {http://arxiv.org/abs/1703.02930}, eprinttype = {arXiv}, eprint = {1703.02930}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HarveyLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HarveyKSP17, author = {Nicholas J. A. Harvey and David R. Karger and Virginia Savova and Leonid Peshkin}, title = {Matroids Hitting Sets and Unsupervised Dependency Grammar Induction}, journal = {CoRR}, volume = {abs/1705.08992}, year = {2017}, url = {http://arxiv.org/abs/1705.08992}, eprinttype = {arXiv}, eprint = {1705.08992}, timestamp = {Sat, 18 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HarveyKSP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/SilvaHS16, author = {Marcel Kenji de Carli Silva and Nicholas J. A. Harvey and Cristiane M. Sato}, title = {Sparse Sums of Positive Semidefinite Matrices}, journal = {{ACM} Trans. Algorithms}, volume = {12}, number = {1}, pages = {9:1--9:17}, year = {2016}, url = {https://doi.org/10.1145/2746241}, doi = {10.1145/2746241}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/SilvaHS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/HarveyX16, author = {Nicholas J. A. Harvey and Keyulu Xu}, editor = {Evangelos Kranakis and Gonzalo Navarro and Edgar Ch{\'{a}}vez}, title = {Generating Random Spanning Trees via Fast Matrix Multiplication}, booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9644}, pages = {522--535}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-49529-2\_39}, doi = {10.1007/978-3-662-49529-2\_39}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/latin/HarveyX16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HarveySV16, author = {Nicholas J. A. Harvey and Piyush Srivastava and Jan Vondr{\'{a}}k}, title = {Computing the independence polynomial in Shearer's region for the {LLL}}, journal = {CoRR}, volume = {abs/1608.02282}, year = {2016}, url = {http://arxiv.org/abs/1608.02282}, eprinttype = {arXiv}, eprint = {1608.02282}, timestamp = {Thu, 21 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HarveySV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Harvey15, author = {Nicholas J. A. Harvey}, title = {A note on the discrepancy of matrices with bounded row and column sums}, journal = {Discret. Math.}, volume = {338}, number = {4}, pages = {517--521}, year = {2015}, url = {https://doi.org/10.1016/j.disc.2014.11.020}, doi = {10.1016/J.DISC.2014.11.020}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Harvey15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/usenix-login/WiresIDHW15, author = {Jake Wires and Stephen Ingram and Zachary Drudi and Nicholas J. A. Harvey and Andrew Warfield}, title = {Counter Stacks and the Elusive Working Set}, journal = {login Usenix Mag.}, volume = {40}, number = {1}, year = {2015}, url = {https://www.usenix.org/publications/login/feb15/wires}, timestamp = {Thu, 02 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/usenix-login/WiresIDHW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DrudiHIWW15, author = {Zachary Drudi and Nicholas J. A. Harvey and Stephen Ingram and Andrew Warfield and Jake Wires}, editor = {Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'{e}} D. P. Rolim}, title = {Approximating Hit Rate Curves using Streaming Algorithms}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {40}, pages = {225--241}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.225}, doi = {10.4230/LIPICS.APPROX-RANDOM.2015.225}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/DrudiHIWW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HarveyV15, author = {Nicholas J. A. Harvey and Jan Vondr{\'{a}}k}, editor = {Venkatesan Guruswami}, title = {An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles}, booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS} 2015, Berkeley, CA, USA, 17-20 October, 2015}, pages = {1327--1346}, publisher = {{IEEE} Computer Society}, year = {2015}, url = {https://doi.org/10.1109/FOCS.2015.85}, doi = {10.1109/FOCS.2015.85}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/HarveyV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HarveyV15, author = {Nicholas J. A. Harvey and Jan Vondr{\'{a}}k}, title = {An Algorithmic Proof of the Lopsided Lovasz Local Lemma}, journal = {CoRR}, volume = {abs/1504.02044}, year = {2015}, url = {http://arxiv.org/abs/1504.02044}, eprinttype = {arXiv}, eprint = {1504.02044}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HarveyV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DemaineDHUUU14, author = {Erik D. Demaine and Martin L. Demaine and Nicholas J. A. Harvey and Ryuhei Uehara and Takeaki Uno and Yushi Uno}, title = {{UNO} is hard, even for a single player}, journal = {Theor. Comput. Sci.}, volume = {521}, pages = {51--61}, year = {2014}, url = {https://doi.org/10.1016/j.tcs.2013.11.023}, doi = {10.1016/J.TCS.2013.11.023}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DemaineDHUUU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/HarveySS14, author = {Nicholas J. A. Harvey and Roy Schwartz and Mohit Singh}, editor = {Klaus Jansen and Jos{\'{e}} D. P. Rolim and Nikhil R. Devanur and Cristopher Moore}, title = {Discrepancy Without Partial Colorings}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona, Spain}, series = {LIPIcs}, volume = {28}, pages = {258--273}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.258}, doi = {10.4230/LIPICS.APPROX-RANDOM.2014.258}, timestamp = {Wed, 30 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/HarveySS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/HarveyS14, author = {Nick Harvey and Samira Samadi}, editor = {Maria{-}Florina Balcan and Vitaly Feldman and Csaba Szepesv{\'{a}}ri}, title = {Near-Optimal Herding}, booktitle = {Proceedings of The 27th Conference on Learning Theory, {COLT} 2014, Barcelona, Spain, June 13-15, 2014}, series = {{JMLR} Workshop and Conference Proceedings}, volume = {35}, pages = {1165--1182}, publisher = {JMLR.org}, year = {2014}, url = {http://proceedings.mlr.press/v35/harvey14.html}, timestamp = {Wed, 29 May 2019 08:41:46 +0200}, biburl = {https://dblp.org/rec/conf/colt/HarveyS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/osdi/WiresIDHW14, author = {Jake Wires and Stephen Ingram and Zachary Drudi and Nicholas J. A. Harvey and Andrew Warfield}, editor = {Jason Flinn and Hank Levy}, title = {Characterizing Storage Workloads with Counter Stacks}, booktitle = {11th {USENIX} Symposium on Operating Systems Design and Implementation, {OSDI} '14, Broomfield, CO, USA, October 6-8, 2014}, pages = {335--349}, publisher = {{USENIX} Association}, year = {2014}, url = {https://www.usenix.org/conference/osdi14/technical-sessions/presentation/wires}, timestamp = {Tue, 02 Feb 2021 08:05:58 +0100}, biburl = {https://dblp.org/rec/conf/osdi/WiresIDHW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HarveyO14, author = {Nicholas J. A. Harvey and Neil Olver}, editor = {Chandra Chekuri}, title = {Pipage Rounding, Pessimistic Estimators and Matrix Concentration}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014}, pages = {926--945}, publisher = {{SIAM}}, year = {2014}, url = {https://doi.org/10.1137/1.9781611973402.69}, doi = {10.1137/1.9781611973402.69}, timestamp = {Tue, 02 Feb 2021 17:07:40 +0100}, biburl = {https://dblp.org/rec/conf/soda/HarveyO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/HarveyO13, author = {Nicholas J. A. Harvey and Neil Olver}, title = {Pipage Rounding, Pessimistic Estimators and Matrix Concentration}, journal = {CoRR}, volume = {abs/1307.2274}, year = {2013}, url = {http://arxiv.org/abs/1307.2274}, eprinttype = {arXiv}, eprint = {1307.2274}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/HarveyO13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/pkdd/BalcanH12, author = {Maria{-}Florina Balcan and Nicholas J. A. Harvey}, editor = {Peter A. Flach and Tijl De Bie and Nello Cristianini}, title = {Learning Submodular Functions}, booktitle = {Machine Learning and Knowledge Discovery in Databases - European Conference, {ECML} {PKDD} 2012, Bristol, UK, September 24-28, 2012. Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {7524}, pages = {846--849}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33486-3\_61}, doi = {10.1007/978-3-642-33486-3\_61}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/pkdd/BalcanH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/HarveyKL11, author = {Nicholas J. A. Harvey and Tam{\'{a}}s Kir{\'{a}}ly and Lap Chi Lau}, title = {On Disjoint Common Bases in Two Matroids}, journal = {{SIAM} J. Discret. Math.}, volume = {25}, number = {4}, pages = {1792--1803}, year = {2011}, url = {https://doi.org/10.1137/100815232}, doi = {10.1137/100815232}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/HarveyKL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ItoDHPSUU11, author = {Takehiro Ito and Erik D. Demaine and Nicholas J. A. Harvey and Christos H. Papadimitriou and Martha Sideri and Ryuhei Uehara and Yushi Uno}, title = {On the complexity of reconfiguration problems}, journal = {Theor. Comput. Sci.}, volume = {412}, number = {12-14}, pages = {1054--1065}, year = {2011}, url = {https://doi.org/10.1016/j.tcs.2010.12.005}, doi = {10.1016/J.TCS.2010.12.005}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ItoDHPSUU11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FungHHP11, author = {Wai Shing Fung and Ramesh Hariharan and Nicholas J. A. Harvey and Debmalya Panigrahi}, editor = {Lance Fortnow and Salil P. Vadhan}, title = {A general framework for graph sparsification}, booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC} 2011, San Jose, CA, USA, 6-8 June 2011}, pages = {71--80}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993636.1993647}, doi = {10.1145/1993636.1993647}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FungHHP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BalcanH11, author = {Maria{-}Florina Balcan and Nicholas J. A. Harvey}, editor = {Lance Fortnow and Salil P. Vadhan}, title = {Learning submodular functions}, booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC} 2011, San Jose, CA, USA, 6-8 June 2011}, pages = {793--802}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993636.1993741}, doi = {10.1145/1993636.1993741}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BalcanH11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1107-0088, author = {Marcel Kenji de Carli Silva and Nicholas J. A. Harvey and Cristiane M. Sato}, title = {Sparse Sums of Positive Semidefinite Matrices}, journal = {CoRR}, volume = {abs/1107.0088}, year = {2011}, url = {http://arxiv.org/abs/1107.0088}, eprinttype = {arXiv}, eprint = {1107.0088}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1107-0088.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1005-0265, author = {Wai Shing Fung and Nicholas J. A. Harvey}, title = {Graph Sparsification by Edge-Connectivity and Random Spanning Trees}, journal = {CoRR}, volume = {abs/1005.0265}, year = {2010}, url = {http://arxiv.org/abs/1005.0265}, eprinttype = {arXiv}, eprint = {1005.0265}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1005-0265.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1008-2159, author = {Maria{-}Florina Balcan and Nicholas J. A. Harvey}, title = {Learning Submodular Functions}, journal = {CoRR}, volume = {abs/1008.2159}, year = {2010}, url = {http://arxiv.org/abs/1008.2159}, eprinttype = {arXiv}, eprint = {1008.2159}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1008-2159.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Harvey09, author = {Nicholas J. A. Harvey}, title = {Algebraic Algorithms for Matching and Matroid Problems}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {2}, pages = {679--702}, year = {2009}, url = {https://doi.org/10.1137/070684008}, doi = {10.1137/070684008}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Harvey09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoemansHIM09, author = {Michel X. Goemans and Nicholas J. A. Harvey and Satoru Iwata and Vahab S. Mirrokni}, editor = {Claire Mathieu}, title = {Approximating submodular functions everywhere}, booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009}, pages = {535--544}, publisher = {{SIAM}}, year = {2009}, url = {https://doi.org/10.1137/1.9781611973068.59}, doi = {10.1137/1.9781611973068.59}, timestamp = {Mon, 12 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/GoemansHIM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0909-0941, author = {Michel X. Goemans and Nicholas J. A. Harvey and Kamal Jain and Mohit Singh}, title = {A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem}, journal = {CoRR}, volume = {abs/0909.0941}, year = {2009}, url = {http://arxiv.org/abs/0909.0941}, eprinttype = {arXiv}, eprint = {0909.0941}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0909-0941.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/ndltd/Harvey08, author = {Nicholas J. A. Harvey}, title = {Matchings, matroids and submodular functions}, school = {Massachusetts Institute of Technology, Cambridge, MA, {USA}}, year = {2008}, url = {https://hdl.handle.net/1721.1/44416}, timestamp = {Wed, 04 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/ndltd/Harvey08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/HarveyNO08, author = {Nicholas J. A. Harvey and Jelani Nelson and Krzysztof Onak}, title = {Sketching and Streaming Entropy via Approximation Theory}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {489--498}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.76}, doi = {10.1109/FOCS.2008.76}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/HarveyNO08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/ItoDHPSUU08, author = {Takehiro Ito and Erik D. Demaine and Nicholas J. A. Harvey and Christos H. Papadimitriou and Martha Sideri and Ryuhei Uehara and Yushi Uno}, editor = {Seok{-}Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, title = {On the Complexity of Reconfiguration Problems}, booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC} 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5369}, pages = {28--39}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92182-0\_6}, doi = {10.1007/978-3-540-92182-0\_6}, timestamp = {Thu, 27 Apr 2023 14:57:19 +0200}, biburl = {https://dblp.org/rec/conf/isaac/ItoDHPSUU08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/itw/HarveyNO08, author = {Nicholas J. A. Harvey and Jelani Nelson and Krzysztof Onak}, title = {Streaming algorithms for estimating entropy}, booktitle = {2008 {IEEE} Information Theory Workshop, {ITW} 2008, Porto, Portugal, May 5-9, 2008}, pages = {227--231}, publisher = {{IEEE}}, year = {2008}, url = {https://doi.org/10.1109/ITW.2008.4578656}, doi = {10.1109/ITW.2008.4578656}, timestamp = {Mon, 09 Aug 2021 14:54:02 +0200}, biburl = {https://dblp.org/rec/conf/itw/HarveyNO08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Harvey08, author = {Nicholas J. A. Harvey}, editor = {Shang{-}Hua Teng}, title = {Matroid intersection, pointer chasing, and Young's seminormal representation of \emph{S\({}_{\mbox{n}}\)}}, booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22, 2008}, pages = {542--549}, publisher = {{SIAM}}, year = {2008}, url = {http://dl.acm.org/citation.cfm?id=1347082.1347142}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/Harvey08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0804-4138, author = {Nicholas J. A. Harvey and Jelani Nelson and Krzysztof Onak}, title = {Sketching and Streaming Entropy via Approximation Theory}, journal = {CoRR}, volume = {abs/0804.4138}, year = {2008}, url = {http://arxiv.org/abs/0804.4138}, eprinttype = {arXiv}, eprint = {0804.4138}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0804-4138.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/infocom/HarveyPWYC07, author = {Nicholas J. A. Harvey and Mihai P{u{a}}tra{c{s}}cu and Yonggang Wen and Sergey Yekhanin and Vincent W. S. Chan}, title = {Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs}, booktitle = {{INFOCOM} 2007. 26th {IEEE} International Conference on Computer Communications, Joint Conference of the {IEEE} Computer and Communications Societies, 6-12 May 2007, Anchorage, Alaska, {USA}}, pages = {697--705}, publisher = {{IEEE}}, year = {2007}, url = {https://doi.org/10.1109/INFCOM.2007.87}, doi = {10.1109/INFCOM.2007.87}, timestamp = {Tue, 30 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/infocom/HarveyPWYC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/HarveyKNW07, author = {Nicholas J. A. Harvey and Robert Kleinberg and Chandra Nair and Yunnan Wu}, title = {A "Chicken {\&} Egg" Network Coding Problem}, booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2007, Nice, France, June 24-29, 2007}, pages = {131--135}, publisher = {{IEEE}}, year = {2007}, url = {https://doi.org/10.1109/ISIT.2007.4557215}, doi = {10.1109/ISIT.2007.4557215}, timestamp = {Wed, 16 Oct 2019 14:14:48 +0200}, biburl = {https://dblp.org/rec/conf/isit/HarveyKNW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Harvey07, author = {Nicholas J. A. Harvey}, editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein}, title = {An algebraic algorithm for weighted linear matroid intersection}, booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9, 2007}, pages = {444--453}, publisher = {{SIAM}}, year = {2007}, url = {http://dl.acm.org/citation.cfm?id=1283383.1283430}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/soda/Harvey07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DunaganH07, author = {John Dunagan and Nicholas J. A. Harvey}, editor = {David S. Johnson and Uriel Feige}, title = {Iteratively constructing preconditioners via the conjugate gradient method}, booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007}, pages = {207--216}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1250790.1250821}, doi = {10.1145/1250790.1250821}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DunaganH07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/HarveyLLT06, author = {Nicholas J. A. Harvey and Richard E. Ladner and L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and Tami Tamir}, title = {Semi-matchings for bipartite graphs and load balancing}, journal = {J. Algorithms}, volume = {59}, number = {1}, pages = {53--78}, year = {2006}, url = {https://doi.org/10.1016/j.jalgor.2005.01.003}, doi = {10.1016/J.JALGOR.2005.01.003}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/HarveyLLT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/HarveyKL06, author = {Nicholas J. A. Harvey and Robert D. Kleinberg and April Rasala Lehman}, title = {On the capacity of information networks}, journal = {{IEEE} Trans. Inf. Theory}, volume = {52}, number = {6}, pages = {2345--2364}, year = {2006}, url = {https://doi.org/10.1109/TIT.2006.874531}, doi = {10.1109/TIT.2006.874531}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/HarveyKL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Harvey06, author = {Nicholas J. A. Harvey}, title = {Algebraic Structures and Algorithms for Matching and Matroid Problems}, booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings}, pages = {531--542}, publisher = {{IEEE} Computer Society}, year = {2006}, url = {https://doi.org/10.1109/FOCS.2006.8}, doi = {10.1109/FOCS.2006.8}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Harvey06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AdlerHJKL06, author = {Micah Adler and Nicholas J. A. Harvey and Kamal Jain and Robert D. Kleinberg and April Rasala Lehman}, title = {On the capacity of information networks}, booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006}, pages = {241--250}, publisher = {{ACM} Press}, year = {2006}, url = {http://dl.acm.org/citation.cfm?id=1109557.1109585}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/AdlerHJKL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AdlerDHP06, author = {Micah Adler and Erik D. Demaine and Nicholas J. A. Harvey and Mihai P{u{a}}tra{c{s}}cu}, title = {Lower bounds for asymmetric communication channels and distributed source coding}, booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006}, pages = {251--260}, publisher = {{ACM} Press}, year = {2006}, url = {http://dl.acm.org/citation.cfm?id=1109557.1109586}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/AdlerDHP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HarveyKY06, author = {Nicholas J. A. Harvey and David R. Karger and Sergey Yekhanin}, title = {The complexity of matrix completion}, booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006}, pages = {1103--1111}, publisher = {{ACM} Press}, year = {2006}, url = {http://dl.acm.org/citation.cfm?id=1109557.1109679}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/HarveyKY06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-cs-0601026, author = {Nicholas J. A. Harvey}, title = {Algebraic Structures and Algorithms for Matching and Matroid Problems (Preliminary Version)}, journal = {CoRR}, volume = {abs/cs/0601026}, year = {2006}, url = {http://arxiv.org/abs/cs/0601026}, eprinttype = {arXiv}, eprint = {cs/0601026}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-cs-0601026.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/HarveyKM05, author = {Nicholas J. A. Harvey and David R. Karger and Kazuo Murota}, title = {Deterministic network coding by matrix completion}, booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {489--498}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070499}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/HarveyKM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HarveyM04, author = {Nicholas J. A. Harvey and J. Ian Munro}, title = {Deterministic SkipNet}, journal = {Inf. Process. Lett.}, volume = {90}, number = {4}, pages = {205--208}, year = {2004}, url = {https://doi.org/10.1016/j.ipl.2004.01.019}, doi = {10.1016/J.IPL.2004.01.019}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HarveyM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/osdi/DunaganHJKTW04, author = {John Dunagan and Nicholas J. A. Harvey and Michael B. Jones and Dejan Kostic and Marvin Theimer and Alec Wolman}, editor = {Eric A. Brewer and Peter Chen}, title = {{FUSE:} Lightweight Guaranteed Distributed Failure Notification}, booktitle = {6th Symposium on Operating System Design and Implementation {(OSDI} 2004), San Francisco, California, USA, December 6-8, 2004}, pages = {151--166}, publisher = {{USENIX} Association}, year = {2004}, url = {http://www.usenix.org/events/osdi04/tech/dunagan.html}, timestamp = {Tue, 02 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/osdi/DunaganHJKTW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/ZatloukalH04, author = {Kevin C. Zatloukal and Nicholas J. A. Harvey}, editor = {J. Ian Munro}, title = {Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time}, booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14, 2004}, pages = {308--317}, publisher = {{SIAM}}, year = {2004}, url = {http://dl.acm.org/citation.cfm?id=982792.982835}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/ZatloukalH04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iptps/HarveyJTW03, author = {Nicholas J. A. Harvey and Michael B. Jones and Marvin Theimer and Alec Wolman}, editor = {M. Frans Kaashoek and Ion Stoica}, title = {Efficient Recovery from Organizational Disconnects in SkipNet}, booktitle = {Peer-to-Peer Systems II, Second International Workshop, {IPTPS} 2003, Berkeley, CA, USA, February 21-22,2003, Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {2735}, pages = {183--196}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45172-3\_17}, doi = {10.1007/978-3-540-45172-3\_17}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/iptps/HarveyJTW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/HarveyM03, author = {Nicholas J. A. Harvey and J. Ian Munro}, editor = {Elizabeth Borowsky and Sergio Rajsbaum}, title = {Brief announcement: deterministic skipnet}, booktitle = {Proceedings of the Twenty-Second {ACM} Symposium on Principles of Distributed Computing, {PODC} 2003, Boston, Massachusetts, USA, July 13-16, 2003}, pages = {152}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/872035.872057}, doi = {10.1145/872035.872057}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/HarveyM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/usits/HarveyJSTW03, author = {Nicholas J. A. Harvey and Michael B. Jones and Stefan Saroiu and Marvin Theimer and Alec Wolman}, editor = {Steven D. Gribble}, title = {SkipNet: {A} Scalable Overlay Network with Practical Locality Properties}, booktitle = {4th {USENIX} Symposium on Internet Technologies and Systems, USITS'03, Seattle, Washington, USA, March 26-28, 2003}, publisher = {{USENIX}}, year = {2003}, url = {http://www.usenix.org/events/usits03/tech/harvey.html}, timestamp = {Tue, 02 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/usits/HarveyJSTW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/HarveyLLT03, author = {Nicholas J. A. Harvey and Richard E. Ladner and L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and Tami Tamir}, editor = {Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Michiel H. M. Smid}, title = {Semi-matchings for Bipartite Graphs and Load Balancing}, booktitle = {Algorithms and Data Structures, 8th International Workshop, {WADS} 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2748}, pages = {294--308}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45078-8\_26}, doi = {10.1007/978-3-540-45078-8\_26}, timestamp = {Tue, 06 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wads/HarveyLLT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.