Nicholas J. A. Harvey

Available identifiers

zbMath Open harvey.nicholas-j-aWikidataQ102340206 ScholiaQ102340206MaRDI QIDQ389941

List of research outcomes

Publication	Date of Publication	Type
Optimal anytime regret with two experts	2023-11-06	Paper
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes	2022-12-08	Paper
Continuous Prediction with Experts' Advice	2022-06-01	Paper
Efficient and Optimal Fixed-Time Regret with Two Experts	2022-03-14	Paper
An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles	2020-04-16	Paper
A General Framework for Graph Sparsification	2019-09-02	Paper
Pipage Rounding, Pessimistic Estimators and Matrix Concentration	2019-06-20	Paper
https://portal.mardi4nfdi.de/entity/Q4633864	2019-05-06	Paper
Sparse Sums of Positive Semidefinite Matrices	2018-10-30	Paper
Submodular Functions: Learnability, Structure, and Optimization	2018-06-12	Paper
Computing the Independence Polynomial: from the Tree Threshold down to the Roots	2018-03-15	Paper
Short proofs for generalizations of the Lov\'asz Local Lemma: Shearer's condition and cluster expansion	2017-11-17	Paper
https://portal.mardi4nfdi.de/entity/Q5351904	2017-08-31	Paper
Rainbow Hamilton cycles and lopsidependency	2017-08-29	Paper
Discrepancy Without Partial Colorings	2017-03-22	Paper
Generating Random Spanning Trees via Fast Matrix Multiplication	2016-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q5501272	2015-08-03	Paper
A generalization of the Cauchy-Schwarz inequality involving four vectors	2015-05-12	Paper
A note on the discrepancy of matrices with bounded row and column sums	2015-01-23	Paper
https://portal.mardi4nfdi.de/entity/Q2934625	2014-12-18	Paper
https://portal.mardi4nfdi.de/entity/Q2921704	2014-10-13	Paper
A general framework for graph sparsification	2014-06-05	Paper
Learning submodular functions	2014-06-05	Paper
UNO is hard, even for a single player	2014-01-22	Paper
On Disjoint Common Bases in Two Matroids	2012-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q2999653	2011-05-16	Paper
On the complexity of reconfiguration problems	2011-03-14	Paper
Lower bounds for asymmetric communication channels and distributed source coding	2010-08-16	Paper
The complexity of matrix completion	2010-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q3579449	2010-08-06	Paper
Algebraic Algorithms for Matching and Matroid Problems	2010-04-29	Paper
Algorithms and Data Structures	2010-04-20	Paper
Deterministic SkipNet	2009-07-21	Paper
On the Complexity of Reconfiguration Problems	2009-01-29	Paper
https://portal.mardi4nfdi.de/entity/Q3549615	2009-01-05	Paper
On the capacity of information networks	2008-12-21	Paper
Semi-matchings for bipartite graphs and load balancing	2006-10-05	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

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