Efficient Recovery from Organizational Disconnects in SkipNet. - Nicholas J. A. Harvey; Michael B. Jones; Marvin Theimer; Alec Wolman (IPTPS, 2003)

Brief announcement: deterministic skipnet. - Nicholas J. A. Harvey; J. Ian Munro (PODC, 2003)

SkipNet: A Scalable Overlay Network with Practical Locality Properties. - Nicholas J. A. Harvey; Michael B. Jones; Stefan Saroiu; Marvin Theimer; Alec Wolman (USENIX Symposium on Internet Technologies and Systems, 2003)

FUSE: Lightweight Guaranteed Distributed Failure Notification. - John Dunagan; Nicholas J. A. Harvey; Michael B. Jones; Dejan Kostic; Marvin Theimer; Alec Wolman (OSDI, 2004)

Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. - Kevin C. Zatloukal; Nicholas J. A. Harvey (SODA, 2004)

Deterministic SkipNet. - Nicholas J. A. Harvey; J. Ian Munro (Inf. Process. Lett., 2004)

Deterministic network coding by matrix completion. - Nicholas J. A. Harvey; David R. Karger; Kazuo Murota (SODA, 2005)

Algebraic Structures and Algorithms for Matching and Matroid Problems. - Nicholas J. A. Harvey (FOCS, 2006)

Lower bounds for asymmetric communication channels and distributed source coding. - Micah Adler; Erik D. Demaine; Nicholas J. A. Harvey; Mihai Patrascu (SODA, 2006)

On the capacity of information networks. - Micah Adler; Nicholas J. A. Harvey; Kamal Jain; Robert D. Kleinberg; April Rasala Lehman (SODA, 2006)

The complexity of matrix completion. - Nicholas J. A. Harvey; David R. Karger; Sergey Yekhanin (SODA, 2006)

Algebraic Structures and Algorithms for Matching and Matroid Problems (Preliminary Version) - Nicholas J. A. Harvey (CoRR, 2006)

Semi-matchings for bipartite graphs and load balancing. - Nicholas J. A. Harvey; Richard E. Ladner; László Lovász 001; Tami Tamir (J. Algorithms, 2006)

On the capacity of information networks. - Nicholas J. A. Harvey; Robert D. Kleinberg; April Rasala Lehman (IEEE Trans. Inf. Theory, 2006)

Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs. - Nicholas J. A. Harvey; Mihai Patrascu; Yonggang Wen 001; Sergey Yekhanin; Vincent W. S. Chan (INFOCOM, 2007)

A "Chicken & Egg" Network Coding Problem. - Nicholas J. A. Harvey; Robert Kleinberg; Chandra Nair; Yunnan Wu (ISIT, 2007)

An algebraic algorithm for weighted linear matroid intersection. - Nicholas J. A. Harvey (SODA, 2007)

Iteratively constructing preconditioners via the conjugate gradient method. - John Dunagan; Nicholas J. A. Harvey (STOC, 2007)

Sketching and Streaming Entropy via Approximation Theory. - Nicholas J. A. Harvey; Jelani Nelson; Krzysztof Onak (FOCS, 2008)

Streaming algorithms for estimating entropy. - Nicholas J. A. Harvey; Jelani Nelson; Krzysztof Onak (ITW, 2008)

Matroid intersection, pointer chasing, and Young's seminormal representation of Sn. - Nicholas J. A. Harvey (SODA, 2008)

Matchings, matroids and submodular functions. - Nicholas J. A. Harvey (2008)

Approximating submodular functions everywhere. - Michel X. Goemans; Nicholas J. A. Harvey; Satoru Iwata 001; Vahab S. Mirrokni (SODA, 2009)

A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem - Michel X. Goemans; Nicholas J. A. Harvey; Kamal Jain; Mohit Singh (CoRR, 2009)

Algebraic Algorithms for Matching and Matroid Problems. - Nicholas J. A. Harvey (SIAM J. Comput., 2009)

Graph Sparsification by Edge-Connectivity and Random Spanning Trees - Wai Shing Fung; Nicholas J. A. Harvey (CoRR, 2010)

Learning submodular functions. - Maria-Florina Balcan; Nicholas J. A. Harvey (STOC, 2011)

On Disjoint Common Bases in Two Matroids. - Nicholas J. A. Harvey; Tamás Király; Lap Chi Lau (SIAM J. Discret. Math., 2011)

On the complexity of reconfiguration problems. - Takehiro Ito; Erik D. Demaine; Nicholas J. A. Harvey; Christos H. Papadimitriou; Martha Sideri; Ryuhei Uehara; Yushi Uno (Theor. Comput. Sci., 2011)

Discrepancy Without Partial Colorings. - Nicholas J. A. Harvey; Roy Schwartz 002; Mohit Singh (APPROX-RANDOM, 2014)

Near-Optimal Herding. - Nick Harvey; Samira Samadi (COLT, 2014)

Characterizing Storage Workloads with Counter Stacks. - Jake Wires; Stephen Ingram; Zachary Drudi; Nicholas J. A. Harvey; Andrew Warfield (OSDI, 2014)

Pipage Rounding, Pessimistic Estimators and Matrix Concentration. - Nicholas J. A. Harvey; Neil Olver (SODA, 2014)

UNO is hard, even for a single player. - Erik D. Demaine; Martin L. Demaine; Nicholas J. A. Harvey; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Theor. Comput. Sci., 2014)

Approximating Hit Rate Curves using Streaming Algorithms. - Zachary Drudi; Nicholas J. A. Harvey; Stephen Ingram; Andrew Warfield; Jake Wires (APPROX-RANDOM, 2015)

An Algorithmic Proof of the Lopsided Lovasz Local Lemma. - Nicholas J. A. Harvey; Jan Vondrák (CoRR, 2015)

A note on the discrepancy of matrices with bounded row and column sums. - Nicholas J. A. Harvey (Discret. Math., 2015)

Counter Stacks and the Elusive Working Set. - Jake Wires; Stephen Ingram; Zachary Drudi; Nicholas J. A. Harvey; Andrew Warfield (login Usenix Mag., 2015)

Generating Random Spanning Trees via Fast Matrix Multiplication. - Nicholas J. A. Harvey; Keyulu Xu (LATIN, 2016)

Computing the independence polynomial in Shearer's region for the LLL. - Nicholas J. A. Harvey; Piyush Srivastava 001; Jan Vondrák (CoRR, 2016)

Sparse Sums of Positive Semidefinite Matrices. - Marcel Kenji de Carli Silva; Nicholas J. A. Harvey; Cristiane M. Sato (ACM Trans. Algorithms, 2016)

Nearly-tight VC-dimension bounds for piecewise linear neural networks. - Nick Harvey; Christopher Liaw; Abbas Mehrabian (COLT, 2017)

Matroids Hitting Sets and Unsupervised Dependency Grammar Induction. - Nicholas J. A. Harvey; David R. Karger; Virginia Savova; Leonid Peshkin (CoRR, 2017)

Rainbow Hamilton cycles and lopsidependency. - Nicholas J. A. Harvey; Christopher Liaw (Discret. Math., 2017)

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. - Hassan Ashtiani; Shai Ben-David; Nicholas J. A. Harvey; Christopher Liaw; Abbas Mehrabian; Yaniv Plan (NeurIPS, 2018)

Computing the Independence Polynomial: from the Tree Threshold down to the Roots. - Nicholas J. A. Harvey; Piyush Srivastava 001; Jan Vondrák (SODA, 2018)

Greedy and Local Ratio Algorithms in the MapReduce Model. - Nicholas J. A. Harvey; Christopher Liaw; Paul Liu 001 (SPAA, 2018)

Submodular Functions: Learnability, Structure, and Optimization. - Maria-Florina Balcan; Nicholas J. A. Harvey (SIAM J. Comput., 2018)

Tight analyses for non-smooth stochastic gradient descent. - Nicholas J. A. Harvey; Christopher Liaw; Yaniv Plan; Sikander Randhawa (COLT, 2019)

Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent. - Nicholas J. A. Harvey; Christopher Liaw; Sikander Randhawa (CoRR, 2019)

Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks. - Peter L. Bartlett; Nick Harvey; Christopher Liaw; Abbas Mehrabian (J. Mach. Learn. Res., 2019)

A General Framework for Graph Sparsification. - Wai Shing Fung; Ramesh Hariharan; Nicholas J. A. Harvey; Debmalya Panigrahi (SIAM J. Comput., 2019)

Optimal anytime regret for two experts. - Nicholas J. A. Harvey; Christopher Liaw; Edwin A. Perkins; Sikander Randhawa (FOCS, 2020)

Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds. - Nicholas J. A. Harvey; Christopher Liaw; Tasuku Soma (NeurIPS, 2020)

Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses. - Yihan Zhou; Victor S. Portella; Mark Schmidt 001; Nicholas J. A. Harvey (NeurIPS, 2020)

Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes. - Hassan Ashtiani; Shai Ben-David; Nicholas J. A. Harvey; Christopher Liaw; Abbas Mehrabian; Yaniv Plan (J. ACM, 2020)

An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles. - Nicholas J. A. Harvey; Jan Vondrák (SIAM J. Comput., 2020)

Efficient and Optimal Fixed-Time Regret with Two Experts. - Laura Greenstreet; Nicholas J. A. Harvey; Victor Sanches Portella (ALT, 2022)

Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case. - Huang Fang; Nicholas J. A. Harvey; Victor S. Portella; Michael P. Friedlander (J. Mach. Learn. Res., 2022)

Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking. - Frederik Kunstner; Victor Sanches Portella; Mark Schmidt 001; Nicholas J. A. Harvey (NeurIPS, 2023)

Continuous Prediction with Experts' Advice. - Nicholas J. A. Harvey; Christopher Liaw; Victor S. Portella (J. Mach. Learn. Res., 2024)

Tight analyses for subgradient descent I: Lower bounds. - Nicholas J. A. Harvey; Chris Liaw; Sikander Randhawa (Open J. Math. Optim., 2024)

Lower Bounds for Private Estimation of Gaussian Covariance Matrices under All Reasonable Parameter Regimes. - Victor S. Portella; Nicholas J. A. Harvey (COLT, 2025)