Anindya De

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 80

Top Venues

Publications

Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio
Testing Intersecting and Union-Closed Families. ITCS (2024)
Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. SODA (2024)
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio
Trace reconstruction from local statistical queries. CoRR (2024)
Anindya De, Huan Li, Shivam Nadimpalli, Rocco A. Servedio
Detecting Low-Degree Truncation. CoRR (2024)
Anindya De, Huan Li, Shivam Nadimpalli, Rocco A. Servedio
Detecting Low-Degree Truncation. STOC (2024)
Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio
Testing Intersecting and Union-Closed Families. CoRR (2023)
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
Testing Convex Truncation. SODA (2023)
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
Gaussian Approximation of Convex Sets by Intersections of Halfspaces. CoRR (2023)
Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan
Reconstructing Ultrametric Trees from Noisy Experiments. ALT (2023)
Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. CoRR (2023)
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
Approximate Trace Reconstruction from a Single Trace. SODA (2023)
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
Testing Convex Truncation. CoRR (2023)
Aidao Chen, Anindya De, Aravindan Vijayaraghavan
Algorithms for learning a mixture of linear classifiers. ALT (2022)
Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey
Nearly Tight Bounds for Discrete Search under Outlier Noise. SOSA (2022)
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
Approximate Trace Reconstruction from a Single Trace. CoRR (2022)
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
Approximating Sumset Size. SODA (2022)
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
Convex Influences. ITCS (2022)
Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan
Reconstructing Ultrametric Trees from Noisy Experiments. CoRR (2022)
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. SODA (2022)
Aidao Chen, Anindya De, Aravindan Vijayaraghavan
Learning a mixture of two subspaces over finite fields. ALT (2021)
Anindya De, Ryan O'Donnell, Rocco A. Servedio
Learning sparse mixtures of permutations from noisy information. COLT (2021)
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
Convex Influences. CoRR (2021)
Anindya De, Sanjeev Khanna, Huan Li, MohammadHesam NikpeySalekde
Approximate optimization of convex functions with outlier noise. NeurIPS (2021)
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
Approximating Sumset Size. CoRR (2021)
Anindya De, Rocco A. Servedio
Weak learning convex sets under normal distributions. COLT (2021)
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. CoRR (2021)
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
Polynomial-time trace reconstruction in the smoothed complexity model. SODA (2021)
Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis
Reconstructing weighted voting schemes from partial information about their power indices. COLT (2021)
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
Quantitative Correlation Inequalities via Semigroup Interpolation. ITCS (2021)
Anindya De, Elchanan Mossel, Joe Neeman
Robust testing of low-dimensional functions. Electron. Colloquium Comput. Complex. 28 (2021)
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime. ITCS (2021)
Anindya De, Elchanan Mossel, Joe Neeman
Robust testing of low dimensional functions. STOC (2021)
Aidao Chen, Anindya De, Aravindan Vijayaraghavan
Learning a mixture of two subspaces over finite fields. CoRR (2020)
Anindya De, Elchanan Mossel, Joe Neeman
Robust testing of low-dimensional functions. CoRR (2020)
Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. ICALP (2020)
Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. CoRR (2020)
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
Polynomial-time trace reconstruction in the low deletion rate regime. CoRR (2020)
Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
Polynomial-time trace reconstruction in the smoothed complexity model. CoRR (2020)
Xue Chen, Anindya De
Reconstruction under outliers for Fourier-sparse functions. SODA (2020)
Anindya De, Ryan O'Donnell, Rocco A. Servedio
Sharp Bounds for Population Recovery. Theory Comput. 16 (2020)
Xue Chen, Anindya De, Rocco A. Servedio
Testing noisy linear functions for sparsity. STOC (2020)
Clément L. Canonne, Anindya De, Rocco A. Servedio
Learning from satisfying assignments under continuous distributions. SODA (2020)
Anindya De, Shivam Nadimpalli, Rocco A. Servedio
Quantitative Correlation Inequalities via Semigroup Interpolation. CoRR (2020)
Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis
Reconstructing weighted voting schemes from partial information about their power indices. CoRR (2020)
Anindya De, Rocco A. Servedio
Kruskal-Katona for convex sets, with applications. CoRR (2019)
Anindya De, Elchanan Mossel, Joe Neeman
Junta correlation is testable. CoRR (2019)
Anindya De, Elchanan Mossel, Joe Neeman
Noise Stability is Computable and Approximately Low-Dimensional. Theory Comput. 15 (2019)
Clément L. Canonne, Anindya De, Rocco A. Servedio
Learning from satisfying assignments under continuous distributions. CoRR (2019)
Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
Simple and Efficient Pseudorandom Generators from Gaussian Processes. Computational Complexity Conference (2019)
Xue Chen, Anindya De, Rocco A. Servedio
Testing noisy linear functions for sparsity. CoRR (2019)
Xue Chen, Anindya De
Reconstruction under outliers for Fourier-sparse functions. CoRR (2019)
Anindya De, Philip M. Long, Rocco A. Servedio
Density Estimation for Shift-Invariant Multidimensional Distributions. ITCS (2019)
Anindya De, Elchanan Mossel, Joe Neeman
Junta Correlation is Testable. FOCS (2019)
Anindya De, Elchanan Mossel, Joe Neeman
Is your function low dimensional? COLT (2019)
Anindya De, Elchanan Mossel, Joe Neeman
Non interactive simulation of correlated distributions is decidable. SODA (2018)
Anindya De, Philip M. Long, Rocco A. Servedio
Density estimation for shift-invariant multidimensional distributions. CoRR (2018)
Anindya De, Philip M. Long, Rocco A. Servedio
Learning Sums of Independent Random Variables with Sparse Collective Support. FOCS (2018)
Anindya De, Philip M. Long, Rocco A. Servedio
Learning Sums of Independent Random Variables with Sparse Collective Support. CoRR (2018)
Anindya De, Ryan O'Donnell, Rocco A. Servedio
Learning sparse mixtures of rankings from noisy information. CoRR (2018)
Anindya De
Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. SODA (2018)
Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
Simple and efficient pseudorandom generators from Gaussian processes. Electron. Colloquium Comput. Complex. 25 (2018)
Anindya De, Elchanan Mossel, Joe Neeman
Is your data low-dimensional? CoRR (2018)
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
The Inverse Shapley value problem. Games Econ. Behav. 105 (2017)
Anindya De, Ryan O'Donnell, Rocco A. Servedio
Sharp bounds for population recovery. CoRR (2017)
Anindya De, Elchanan Mossel, Joe Neeman
Noise Stability is computable and low dimensional. CoRR (2017)
Anindya De, Elchanan Mossel, Joe Neeman
Noise Stability Is Computable and Approximately Low-Dimensional. Computational Complexity Conference (2017)
Anindya De
Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. CoRR (2017)
Anindya De, Elchanan Mossel, Joe Neeman
Non interactive simulation of correlated distributions is decidable. CoRR (2017)
Anindya De, Ryan O'Donnell, Rocco A. Servedio
Optimal mean-based algorithms for trace reconstruction. STOC (2017)
Anindya De, Michael E. Saks, Sijian Tang
Noisy population recovery in polynomial time. Electron. Colloquium Comput. Complex. 23 (2016)
Anindya De, Elchanan Mossel, Joe Neeman
Majority is Stablest: Discrete and SoS. Theory Comput. 12 (1) (2016)
Anindya De, Michael E. Saks, Sijian Tang
Noisy population recovery in polynomial time. CoRR (2016)
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. SIAM J. Discret. Math. 30 (2) (2016)
Anindya De, Michael E. Saks, Sijian Tang
Noisy Population Recovery in Polynomial Time. FOCS (2016)
Anindya De, Ryan O'Donnell, Rocco A. Servedio
Optimal mean-based algorithms for trace reconstruction. CoRR (2016)
Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos
A size-free CLT for poisson multinomials and its applications. STOC (2016)
Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos
A Size-Free CLT for Poisson Multinomials and its Applications. CoRR (2015)
Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan
Non-adaptive Queries. STOC (2015)
Anindya De
Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial Sums. FOCS (2015)
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
Learning from satisfying assignments. SODA (2015)
Anindya De
Beyond the Central Limit Theorem: asymptotic expansions and pseudorandomness for combinatorial sums. Electron. Colloquium Comput. Complex. 21 (2014)
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces. J. ACM 61 (2) (2014)
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. Computational Complexity Conference (2014)
Anindya De, Rocco A. Servedio
Efficient deterministic approximate counting for low-degree polynomial threshold functions. STOC (2014)
Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. SODA (2014)
Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan
non-adaptive queries. CoRR (2014)
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
Fast Integer Multiplication Using Modular Arithmetic. SIAM J. Comput. 42 (2) (2013)
Anindya De, Elchanan Mossel
Explicit Optimal Hardness via Gaussian Stability Results. ACM Trans. Comput. Theory 5 (4) (2013)
Anindya De, Elchanan Mossel, Joe Neeman
Majority is stablest: discrete and SoS. STOC (2013)
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. ICALP (1) (2013)
Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. CoRR (2013)
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
Deterministic Approximate Counting for Degree-$2$ Polynomial Threshold Functions. CoRR (2013)
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. Electron. Colloquium Comput. Complex. 20 (2013)
Anindya De, Rocco A. Servedio
Efficient deterministic approximate counting for low-degree polynomial threshold functions. CoRR (2013)
Anindya De, Rocco A. Servedio
Efficient deterministic approximate counting for low degree polynomial threshold functions. Electron. Colloquium Comput. Complex. 20 (2013)
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions. CoRR (2013)
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions. Electron. Colloquium Comput. Complex. 20 (2013)
Anindya De, Elchanan Mossel
Explicit Optimal Hardness via Gaussian stability results CoRR (2012)
Anindya De, Thomas Watson
Extractors and Lower Bounds for Locally Samplable Sources. ACM Trans. Comput. Theory 4 (1) (2012)
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
The Inverse Shapley Value Problem CoRR (2012)

Anindya De.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Anindya De