| Publication | Date of Publication | Type |
|---|
| Algebraic structures and algorithms for matching and matroid problems | 2026-05-29 | Paper |
| Explicit and near-optimal construction of t-rankwise independent permutations | 2025-10-06 | Paper |
| Optimal anytime regret for two experts | 2025-08-12 | Paper |
| An algorithmic proof of the Lovasz local lemma via resampling oracles | 2025-08-05 | Paper |
On the expected _-norm of high-dimensional martingales
Stochastic Processes and their Applications | 2025-03-31 | Paper |
| Efficient and optimal fixed-time regret with two experts | 2025-02-11 | Paper |
Tight analyses for subgradient descent. I: Lower bounds
OJMO. Open Journal of Mathematical Optimization | 2024-11-05 | Paper |
Optimal anytime regret with two experts
Mathematical Statistics and Learning | 2023-11-06 | Paper |
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
Journal of the ACM | 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
SIAM Journal on Computing | 2020-04-16 | Paper |
A general framework for graph sparsification
SIAM Journal on Computing | 2019-09-02 | Paper |
Pipage rounding, pessimistic estimators and matrix concentration
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| scientific article; zbMATH DE number 7051222 (Why is no real title available?) | 2019-05-06 | Paper |
Sparse sums of positive semidefinite matrices
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Submodular functions: learnability, structure, and optimization
SIAM Journal on Computing | 2018-06-12 | Paper |
| Computing the independence polynomial: from the tree threshold down to the roots | 2018-03-15 | Paper |
Computing the independence polynomial: from the tree threshold down to the roots
(available as arXiv preprint) | 2018-03-15 | Paper |
| Short proofs for generalizations of the Lov\'asz Local Lemma: Shearer's condition and cluster expansion | 2017-11-17 | Paper |
| Approximating hit rate curves using streaming algorithms | 2017-08-31 | Paper |
Rainbow Hamilton cycles and lopsidependency
Discrete Mathematics | 2017-08-29 | Paper |
| Discrepancy without partial colorings | 2017-03-22 | Paper |
| Family trees, an ordered dictionary with optimal congestion, locality, degree, and search time | 2015-08-03 | Paper |
A generalization of the Cauchy-Schwarz inequality involving four vectors
Journal of Mathematical Inequalities | 2015-05-12 | Paper |
A note on the discrepancy of matrices with bounded row and column sums
Discrete Mathematics | 2015-01-23 | Paper |
| An algebraic algorithm for weighted linear matroid intersection | 2014-12-18 | Paper |
| Deterministic network coding by matrix completion | 2014-10-13 | Paper |
A general framework for graph sparsification
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Learning submodular functions
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
UNO is hard, even for a single player
Theoretical Computer Science | 2014-01-22 | Paper |
On Disjoint Common Bases in Two Matroids
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
| scientific article; zbMATH DE number 5888307 (Why is no real title available?) | 2011-05-16 | Paper |
On the complexity of reconfiguration problems
Theoretical Computer Science | 2011-03-14 | Paper |
The complexity of matrix completion
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Lower bounds for asymmetric communication channels and distributed source coding
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764856 (Why is no real title available?) | 2010-08-06 | Paper |
Algebraic algorithms for matching and matroid problems
SIAM Journal on Computing | 2010-04-29 | Paper |
Semi-matchings for bipartite graphs and load balancing.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Deterministic SkipNet
Information Processing Letters | 2009-07-21 | Paper |
On the Complexity of Reconfiguration Problems
Algorithms and Computation | 2009-01-29 | Paper |
| Iteratively constructing preconditioners via the conjugate gradient method | 2009-01-05 | Paper |
On the capacity of information networks
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Semi-matchings for bipartite graphs and load balancing
Journal of Algorithms | 2006-10-05 | Paper |
