Anindya De

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Trace Reconstruction from Local Statistical Queries.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

2023

Testing Convex Truncation.

[BibT_eX]

[DOI]

Eshwar Ram Arunachaleswaran

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Approximate Trace Reconstruction from a Single Trace.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Reconstructing Ultrametric Trees from Noisy Experiments.

[BibT_eX]

[DOI]

Sampath Kannan

Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022

Nearly Tight Bounds for Discrete Search under Outlier Noise.

[BibT_eX]

[DOI]

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Approximating Sumset Size.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Convex Influences.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Algorithms for learning a mixture of linear classifiers.

[BibT_eX]

[DOI]

Aidao Chen

Aravindan Vijayaraghavan

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021

Robust testing of low dimensional functions.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Polynomial-time trace reconstruction in the smoothed complexity model.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Approximate optimization of convex functions with outlier noise.

[BibT_eX]

[DOI]

MohammadHesam NikpeySalekde

Sanjeev Khanna

Huan Li

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Quantitative Correlation Inequalities via Semigroup Interpolation.

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime.

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Weak learning convex sets under normal distributions.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

Learning sparse mixtures of permutations from noisy information.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

Reconstructing weighted voting schemes from partial information about their power indices.

[BibT_eX]

[DOI]

Huck Bennett

Emmanouil-Vasileios Vlatakis-Gkaragkounis

Proceedings of the Conference on Learning Theory, 2021

Learning a mixture of two subspaces over finite fields.

[BibT_eX]

[DOI]

Aidao Chen

Aravindan Vijayaraghavan

Proceedings of the Algorithmic Learning Theory, 2021

2020

Sharp Bounds for Population Recovery.

[BibT_eX]

[DOI]

Theory Comput., 2020

Testing noisy linear functions for sparsity.

[BibT_eX]

[DOI]

Xue Chen

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Reconstruction under outliers for Fourier-sparse functions.

[BibT_eX]

[DOI]

Xue Chen

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Learning from satisfying assignments under continuous distributions.

[BibT_eX]

[DOI]

Clément L. Canonne

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Kruskal-Katona for convex sets, with applications.

[BibT_eX]

[DOI]

CoRR, 2019

Density Estimation for Shift-Invariant Multidimensional Distributions.

[BibT_eX]

[DOI]

Philip M. Long

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Junta Correlation is Testable.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Is your function low dimensional?

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

Simple and Efficient Pseudorandom Generators from Gaussian Processes.

[BibT_eX]

[DOI]

Eshan Chattopadhyay

Proceedings of the 34th Computational Complexity Conference, 2019

2018

Learning sparse mixtures of rankings from noisy information.

[BibT_eX]

[DOI]

CoRR, 2018

Is your data low-dimensional?

[BibT_eX]

[DOI]

CoRR, 2018

Non interactive simulation of correlated distributions is decidable.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Learning Sums of Independent Random Variables with Sparse Collective Support.

[BibT_eX]

[DOI]

Philip M. Long

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Noise Stability is computable and low dimensional.

[BibT_eX]

[DOI]

CoRR, 2017

Optimal mean-based algorithms for trace reconstruction.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Noise Stability Is Computable and Approximately Low-Dimensional.

[BibT_eX]

[DOI]

Proceedings of the 32nd Computational Complexity Conference, 2017

2016

A size-free CLT for poisson multinomials and its applications.

[BibT_eX]

[DOI]

Constantinos Daskalakis

Gautam Kamath

Christos Tzamos

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Noisy Population Recovery in Polynomial Time.

[BibT_eX]

[DOI]

Michael E. Saks

Sijian Tang

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Boolean Function Monotonicity Testing Requires (Almost) n<sup>1/2</sup> Non-adaptive Queries.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Learning from satisfying assignments.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial Sums.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Efficient deterministic approximate counting for low-degree polynomial threshold functions.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing, 2014

A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage.

[BibT_eX]

[DOI]

Constantinos Daskalakis

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions.

[BibT_eX]

[DOI]

Proceedings of the IEEE 29th Conference on Computational Complexity, 2014

2013

Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

Majority is stablest: discrete and SoS.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Trevisan's Extractor in the Presence of Quantum Side Information.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Explicit Optimal hardness via Gaussian stability results.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Inverse Problems in Approximate Uniform Generation.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Lower Bounds in Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

The Inverse Shapley Value Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Pseudorandomness for Permutation and Regular Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011

Extractors and Lower Bounds for Locally Samplable Sources.

[BibT_eX]

[DOI]

Thomas Watson

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Near-optimal extractors against quantum storage.

[BibT_eX]

[DOI]

Thomas Vidick

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Time Space Tradeoffs for Attacks against One-Way Functions and PRGs.

[BibT_eX]

[DOI]

Luca Trevisan

Madhur Tulsiani

Proceedings of the Advances in Cryptology, 2010

Improved Pseudorandom Generators for Depth 2 Circuits.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2010

2009

Non-uniform attacks against one-way functions and PRGs.

[BibT_eX]

[DOI]

Luca Trevisan

Madhur Tulsiani

Electron. Colloquium Comput. Complex., 2009

Extractors Using Hardness Amplification.

[BibT_eX]

[DOI]

Luca Trevisan

Proceedings of the Approximation, 2009

2008

Fast integer multiplication using modular arithmetic.

[BibT_eX]

[DOI]