| Efficient Approximation Algorithms for the Inverse Semivalue Problem. | 0 | 0.34 | 2022 |
| Outlier-Robust Learning of Ising Models Under Dobrushin's Condition. | 0 | 0.34 | 2021 |
| A verifiably secure and proportional committee election rule. | 1 | 0.37 | 2021 |
| Testing Bayesian Networks | 0 | 0.34 | 2020 |
| Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations | 0 | 0.34 | 2020 |
| Efficient Algorithms and Lower Bounds for Robust Linear Regression. | 6 | 0.47 | 2019 |
| Poster: GRANDPA Finality Gadget | 0 | 0.34 | 2019 |
| A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families | 0 | 0.34 | 2019 |
| Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering | 0 | 0.34 | 2019 |
| Robust Estimators in High-Dimensions Without the Computational Intractability | 1 | 0.36 | 2019 |
| Robustly Learning a Gaussian: Getting Optimal Error, Efficiently. | 7 | 0.46 | 2018 |
| List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussians. | 10 | 0.53 | 2018 |
| Reachability for Branching Concurrent Stochastic Games. | 0 | 0.34 | 2018 |
| Robust Learning of Fixed-Structure Bayesian Networks | 0 | 0.34 | 2018 |
| Testing conditional independence of discrete distributions | 2 | 0.36 | 2018 |
| Sever: A Robust Meta-Algorithm for Stochastic Optimization. | 10 | 0.53 | 2018 |
| A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities. | 1 | 0.37 | 2018 |
| Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities. | 1 | 0.37 | 2018 |
| Being Robust (in High Dimensions) Can Be Practical. | 16 | 0.67 | 2017 |
| Learning Multivariate Log-concave Distributions. | 6 | 0.58 | 2017 |
| Learning geometric concepts with nasty noise | 8 | 0.60 | 2017 |
| Fourier-Based Testing for Families of Distributions. | 3 | 0.39 | 2017 |
| A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes. | 1 | 0.36 | 2017 |
| Sharp Bounds for Generalized Uniformity Testing. | 0 | 0.34 | 2017 |
| Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures | 24 | 1.03 | 2016 |
| Efficient Robust Proper Learning of Log-concave Distributions. | 2 | 0.40 | 2016 |
| Playing anonymous games using simple strategies | 0 | 0.34 | 2016 |
| Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables | 13 | 0.60 | 2016 |
| Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes. | 1 | 0.36 | 2015 |
| Properly Learning Poisson Binomial Distributions in Almost Polynomial Time | 11 | 0.61 | 2015 |
| Nearly Optimal Learning and Sparse Covers for Sums of Independent Integer Random Variables. | 6 | 0.48 | 2015 |
| The Fourier Transform of Poisson Multinomial Distributions and its Algorithmic Applications | 14 | 0.62 | 2015 |
| Upper bounds for newton's method on monotone polynomial systems, and p-time model checking of probabilistic one-counter automata | 0 | 0.34 | 2013 |
| A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing | 0 | 0.34 | 2013 |
| Stochastic context-free grammars, regular languages, and newton's method | 0 | 0.34 | 2013 |
| Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars | 23 | 1.20 | 2012 |
| Polynomial time algorithms for branching markov decision processes and probabilistic min(max) polynomial bellman equations | 8 | 0.61 | 2012 |
