| Publication | Date of Publication | Type |
|---|
| A plausible attack on the adaptive security of threshold Schnorr signatures | 2026-01-28 | Paper |
| Statistical query lower bounds for robust estimation of high-dimensional Gaussians and Gaussian mixtures | 2025-08-06 | Paper |
| Robust estimators in high dimensions without the computational intractability | 2025-08-06 | Paper |
| Unbiasable verifiable random functions | 2024-11-13 | Paper |
scientific article; zbMATH DE number 7561608 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Outlier-Robust Learning of Ising Models Under Dobrushin's Condition | 2021-02-03 | Paper |
Testing Bayesian Networks
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
Mathematics of Operations Research | 2020-04-30 | Paper |
Efficient algorithms and lower bounds for robust linear regression
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Testing conditional independence of discrete distributions
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
List-decodable robust mean estimation and learning mixtures of spherical Gaussians
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Learning geometric concepts with nasty noise
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Robust estimators in high-dimensions without the computational intractability
SIAM Journal on Computing | 2019-05-07 | Paper |
Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata
Journal of the ACM | 2018-08-02 | Paper |
Playing anonymous games using simple strategies
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
Information and Computation | 2018-06-14 | Paper |
| Robustly learning a Gaussian: getting optimal error, efficiently | 2018-03-15 | Paper |
Robustly learning a Gaussian: getting optimal error, efficiently
(available as arXiv preprint) | 2018-03-15 | Paper |
A polynomial time algorithm for computing extinction probabilities of multitype branching processes
SIAM Journal on Computing | 2017-10-06 | Paper |
The Fourier transform of Poisson multinomial distributions and its algorithmic applications
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Fourier-Based Testing for Families of Distributions | 2017-06-18 | Paper |
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
Lecture Notes in Computer Science | 2015-11-04 | Paper |
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing
ACM Transactions on Computation Theory | 2015-09-03 | Paper |
Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
Automata, Languages, and Programming | 2013-08-12 | Paper |
Stochastic context-free grammars, regular languages, and newton's method
Automata, Languages, and Programming | 2013-08-07 | Paper |
