| Publication | Date of Publication | Type |
|---|
| Mildly exponential lower bounds on tolerant testers for monotonicity, unateness, and juntas | 2024-11-28 | Paper |
| Near-optimal average-case approximate trace reconstruction from few traces | 2024-07-19 | Paper |
| Approximating sumset size | 2024-07-19 | Paper |
| Approximate trace reconstruction from a single trace | 2024-05-14 | Paper |
| Nearly tight bounds for discrete search under outlier noise | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788343 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Robust testing of low dimensional functions
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Robust testing of low dimensional functions
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Gaussian Approximation of Convex Sets by Intersections of Halfspaces | 2023-11-14 | Paper |
| Testing Convex Truncation | 2023-05-04 | Paper |
| Simple and efficient pseudorandom generators from gaussian processes | 2022-07-27 | Paper |
Density estimation for shift-invariant multidimensional distributions
(available as arXiv preprint) | 2022-07-18 | Paper |
Quantitative correlation inequalities via extremal power series
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2022-05-20 | Paper |
| Approximating Sumset Size | 2021-07-26 | Paper |
scientific article; zbMATH DE number 7307484 (Why is no real title available?)
(available as arXiv preprint) | 2021-02-08 | Paper |
| scientific article; zbMATH DE number 7307484 (Why is no real title available?) | 2021-02-08 | Paper |
Reconstruction under outliers for Fourier-sparse functions
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Learning from satisfying assignments under continuous distributions
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Testing noisy linear functions for sparsity
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| Quantitative Correlation Inequalities via Semigroup Interpolation | 2020-12-22 | Paper |
Sharp bounds for population recovery
Theory of Computing | 2020-12-17 | Paper |
| Reconstructing weighted voting schemes from partial information about their power indices | 2020-07-19 | Paper |
| Noise stability is computable and approximately low-dimensional | 2020-05-26 | Paper |
scientific article; zbMATH DE number 7140483 (Why is no real title available?)
Theory of Computing | 2019-12-05 | Paper |
| Kruskal-Katona for convex sets, with applications | 2019-10-31 | Paper |
A polynomial-time approximation scheme for fault-tolerant distributed storage
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Optimal mean-based algorithms for trace reconstruction
The Annals of Applied Probability | 2019-04-24 | Paper |
A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2018-08-10 | Paper |
Learning Sums of Independent Random Variables with Sparse Collective Support
(available as arXiv preprint) | 2018-07-18 | Paper |
| Non interactive simulation of correlated distributions is decidable | 2018-03-15 | Paper |
Non interactive simulation of correlated distributions is decidable
(available as arXiv preprint) | 2018-03-15 | Paper |
| Boolean function analysis meets stochastic optimization: an approximation scheme for stochastic knapsack | 2018-03-15 | Paper |
Boolean function analysis meets stochastic optimization: an approximation scheme for stochastic knapsack
(available as arXiv preprint) | 2018-03-15 | Paper |
The inverse Shapley value problem
Games and Economic Behavior | 2017-10-24 | Paper |
Learning from satisfying assignments
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
A size-free CLT for Poisson multinomials and its applications
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Optimal mean-based algorithms for trace reconstruction
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Noise Stability is computable and low dimensional | 2017-01-05 | Paper |
Majority is stablest: discrete and SoS
Theory of Computing | 2016-07-29 | Paper |
A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry
SIAM Journal on Discrete Mathematics | 2016-05-26 | Paper |
Explicit optimal hardness via Gaussian stability results
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Boolean function monotonicity testing requires (almost) \(n^{1/2}\) non-adaptive queries
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Efficient deterministic approximate counting for low-degree polynomial threshold functions
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces
Journal of the ACM | 2014-09-12 | Paper |
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Majority is stablest: discrete and SoS
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Nearly optimal solutions for the Chow parameters problem and low-weight approximation of halfspaces
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 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 |
The inverse Shapley value problem
Lecture Notes in Computer Science | 2013-08-12 | Paper |
A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Fast integer multiplication using modular arithmetic
SIAM Journal on Computing | 2013-07-24 | Paper |
Trevisan's extractor in the presence of quantum side information
SIAM Journal on Computing | 2012-11-29 | Paper |
Lower bounds in differential privacy
Theory of Cryptography | 2012-06-15 | Paper |
Improved pseudorandom generators for depth 2 circuits
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Time space tradeoffs for attacks against one-way functions and PRGs
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Single magnetic particle dynamics in a microchannel
Physics of Fluids | 2010-03-18 | Paper |
Extractors Using Hardness Amplification
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
| scientific article; zbMATH DE number 5485562 (Why is no real title available?) | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 1143937 (Why is no real title available?) | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 954471 (Why is no real title available?) | 1997-03-23 | Paper |
