| Publication | Date of Publication | Type |
|---|
| Online robust mean estimation | 2024-11-28 | Paper |
| A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning | 2024-05-08 | Paper |
| Learning general halfspaces with general Massart noise under the Gaussian distribution | 2023-12-08 | Paper |
| Robustly learning mixtures of k arbitrary Gaussians | 2023-12-08 | Paper |
| Clustering mixture models in almost-linear time via list-decodable mean estimation | 2023-12-08 | Paper |
| Optimal testing of discrete distributions with high probability | 2023-11-14 | Paper |
| Efficiently learning halfspaces with Tsybakov noise | 2023-11-14 | Paper |
| Algorithmic High-Dimensional Robust Statistics | 2023-07-03 | Paper |
| A Nearly Tight Bound for Fitting an Ellipsoid to Gaussian Random Points | 2022-12-21 | Paper |
| Gaussian Mean Testing Made Simple | 2022-10-24 | Paper |
| On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer | 2022-05-31 | Paper |
| Robust High-Dimensional Statistics | 2022-02-04 | Paper |
| Sample-optimal identity testing with high probability | 2021-07-28 | Paper |
| Outlier-Robust Learning of Ising Models Under Dobrushin's Condition | 2021-02-03 | Paper |
| Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models | 2020-12-14 | Paper |
| Near-optimal disjoint-path facility location through set cover by pairs | 2020-11-04 | Paper |
| Testing Bayesian Networks | 2020-09-29 | Paper |
| Near-Optimal Closeness Testing of Discrete Histogram Distributions | 2020-05-27 | Paper |
| Degree-𝑑 chow parameters robustly determine degree-𝑑 PTFs (and algorithmic applications) | 2020-01-30 | Paper |
| High-dimensional robust mean estimation in nearly-linear time | 2019-10-15 | Paper |
| Efficient algorithms and lower bounds for robust linear regression | 2019-10-15 | Paper |
| Disjoint-path facility location: theory and practice | 2019-09-12 | Paper |
| Collision-based Testers are Optimal for Uniformity and Closeness | 2019-09-12 | Paper |
| Testing conditional independence of discrete distributions | 2019-08-22 | Paper |
| List-decodable robust mean estimation and learning mixtures of spherical Gaussians | 2019-08-22 | Paper |
| Learning geometric concepts with nasty noise | 2019-08-22 | Paper |
| Optimal algorithms for testing closeness of discrete distributions | 2019-06-20 | Paper |
| A polynomial-time approximation scheme for fault-tolerant distributed storage | 2019-06-20 | Paper |
| The complexity of optimal multidimensional pricing | 2019-06-20 | Paper |
| Learning mixtures of structured distributions over discrete domains | 2019-05-15 | Paper |
| Testing \(k\)-modal distributions: optimal algorithms via reductions | 2019-05-15 | Paper |
| Learning \(k\)-modal distributions via testing | 2019-05-10 | Paper |
| Robust estimators in high-dimensions without the computational intractability | 2019-05-07 | Paper |
| Playing anonymous games using simple strategies | 2018-07-16 | Paper |
| Sample-optimal density estimation in nearly-linear time | 2018-07-16 | Paper |
| The complexity of optimal multidimensional pricing for a unit-demand buyer | 2018-07-12 | Paper |
| Robustly learning a Gaussian: getting optimal error, efficiently | 2018-03-15 | Paper |
| Testing shape restrictions of discrete distributions | 2018-03-01 | Paper |
| Testing shape restrictions of discrete distributions | 2018-01-24 | Paper |
| The inverse Shapley value problem | 2017-10-24 | Paper |
| Testing identity of structured distributions | 2017-10-05 | Paper |
| Learning from satisfying assignments | 2017-10-05 | Paper |
| The Fourier transform of Poisson multinomial distributions and its algorithmic applications | 2017-09-29 | Paper |
| Hardness results for agnostically learning low-degree polynomial threshold functions | 2017-09-29 | Paper |
| Fourier-Based Testing for Families of Distributions | 2017-06-18 | Paper |
| How good is the Chord algorithm? | 2016-07-04 | Paper |
| A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry | 2016-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3466401 | 2016-02-01 | Paper |
| Efficient density estimation via piecewise polynomial approximation | 2015-06-26 | Paper |
| Learning Poisson binomial distributions | 2015-05-21 | Paper |
| Learning \(k\)-modal distributions via testing | 2015-02-03 | Paper |
| A regularity lemma and low-weight approximators for low-degree polynomial threshold functions | 2014-10-06 | Paper |
| Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces | 2014-09-12 | Paper |
| Bounding the average sensitivity and noise sensitivity of polynomial threshold functions | 2014-08-13 | Paper |
| Bounded Independence Fools Halfspaces | 2014-07-25 | Paper |
| Average sensitivity and noise sensitivity of polynomial threshold functions | 2014-06-04 | Paper |
| How good is the chord algorithm? | 2014-05-22 | Paper |
| Learning Poisson binomial distributions | 2014-05-13 | Paper |
| Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces | 2014-05-13 | Paper |
| Deterministic Approximate Counting for Degree-$2$ Polynomial Threshold Functions | 2013-11-27 | Paper |
| Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions | 2013-11-27 | Paper |
| Improved approximation of linear threshold functions | 2013-09-30 | Paper |
| The inverse Shapley value problem | 2013-08-12 | Paper |
| A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry | 2013-08-06 | Paper |
| Efficiency-revenue trade-offs in auctions | 2012-11-01 | Paper |
| On the Distribution of the Fourier Spectrum of Halfspaces | 2012-02-29 | Paper |
| Efficiently testing sparse \(\text{GF}(2)\) polynomials | 2011-11-07 | Paper |
| Bounded Independence Fools Halfspaces | 2011-04-04 | Paper |
| Small approximate Pareto sets for biobjective shortest paths and other problems | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579439 | 2010-08-06 | Paper |
| Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems | 2009-02-17 | Paper |
| Efficiently Testing Sparse GF(2) Polynomials | 2008-08-28 | Paper |
