Nicholas J. A. Harvey

From MaRDI portal
Person:389941

Available identifiers

zbMath Open harvey.nicholas-j-aDBLP93/4141WikidataQ102340206 ScholiaQ102340206MaRDI QIDQ389941

List of research outcomes





PublicationDate of PublicationType
Tight analyses for subgradient descent. I: Lower bounds2024-11-05Paper
Optimal anytime regret with two experts2023-11-06Paper
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes2022-12-08Paper
Continuous Prediction with Experts' Advice2022-06-01Paper
Efficient and Optimal Fixed-Time Regret with Two Experts2022-03-14Paper
An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles2020-04-16Paper
A General Framework for Graph Sparsification2019-09-02Paper
Pipage Rounding, Pessimistic Estimators and Matrix Concentration2019-06-20Paper
https://portal.mardi4nfdi.de/entity/Q46338642019-05-06Paper
Sparse Sums of Positive Semidefinite Matrices2018-10-30Paper
Submodular Functions: Learnability, Structure, and Optimization2018-06-12Paper
Computing the Independence Polynomial: from the Tree Threshold down to the Roots2018-03-15Paper
Short proofs for generalizations of the Lov\'asz Local Lemma: Shearer's condition and cluster expansion2017-11-17Paper
https://portal.mardi4nfdi.de/entity/Q53519042017-08-31Paper
Rainbow Hamilton cycles and lopsidependency2017-08-29Paper
Discrepancy Without Partial Colorings2017-03-22Paper
https://portal.mardi4nfdi.de/entity/Q55012722015-08-03Paper
A generalization of the Cauchy-Schwarz inequality involving four vectors2015-05-12Paper
A note on the discrepancy of matrices with bounded row and column sums2015-01-23Paper
https://portal.mardi4nfdi.de/entity/Q29346252014-12-18Paper
Deterministic network coding by matrix completion2014-10-13Paper
A general framework for graph sparsification2014-06-05Paper
Learning submodular functions2014-06-05Paper
UNO is hard, even for a single player2014-01-22Paper
On Disjoint Common Bases in Two Matroids2012-03-15Paper
https://portal.mardi4nfdi.de/entity/Q29996532011-05-16Paper
On the complexity of reconfiguration problems2011-03-14Paper
The complexity of matrix completion2010-08-16Paper
Lower bounds for asymmetric communication channels and distributed source coding2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35794492010-08-06Paper
Algebraic Algorithms for Matching and Matroid Problems2010-04-29Paper
Algorithms and Data Structures2010-04-20Paper
Deterministic SkipNet2009-07-21Paper
On the Complexity of Reconfiguration Problems2009-01-29Paper
https://portal.mardi4nfdi.de/entity/Q35496152009-01-05Paper
On the capacity of information networks2008-12-21Paper
Semi-matchings for bipartite graphs and load balancing2006-10-05Paper

Research outcomes over time

This page was built for person: Nicholas J. A. Harvey