Extractors Using Hardness Amplification. - Anindya De; Luca Trevisan 001 (APPROX-RANDOM, 2009)

Improved Pseudorandom Generators for Depth 2 Circuits. - Anindya De; Omid Etesami; Luca Trevisan 001; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2009)

Non-uniform attacks against one-way functions and PRGs. - Anindya De; Luca Trevisan 001; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2009)

Near-optimal extractors against quantum storage. - Anindya De; Thomas Vidick (Electron. Colloquium Comput. Complex., 2009)

Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. - Anindya De; Luca Trevisan 001; Madhur Tulsiani (CRYPTO, 2010)

Pseudorandomness for Permutation and Regular Branching Programs. - Anindya De (CCC, 2011)

Extractors and Lower Bounds for Locally Samplable Sources. - Anindya De; Thomas Watson 001 (Electron. Colloquium Comput. Complex., 2011)

Lower Bounds in Differential Privacy. - Anindya De (TCC, 2012)

Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces. - Anindya De; Ilias Diakonikolas; Vitaly Feldman; Rocco A. Servedio (Electron. Colloquium Comput. Complex., 2012)

Inverse Problems in Approximate Uniform Generation. - Anindya De; Ilias Diakonikolas; Rocco A. Servedio (Electron. Colloquium Comput. Complex., 2012)

The Inverse Shapley Value Problem. - Anindya De; Ilias Diakonikolas; Rocco A. Servedio (Electron. Colloquium Comput. Complex., 2012)

Explicit Optimal hardness via Gaussian stability results. - Anindya De; Elchanan Mossel (Electron. Colloquium Comput. Complex., 2012)

Trevisan's Extractor in the Presence of Quantum Side Information. - Anindya De; Christopher Portmann; Thomas Vidick; Renato Renner (SIAM J. Comput., 2012)

Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. - Anindya De; Ilias Diakonikolas; Rocco A. Servedio (Electron. Colloquium Comput. Complex., 2013)

Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions. - Anindya De; Ilias Diakonikolas; Rocco A. Servedio (Electron. Colloquium Comput. Complex., 2013)

Efficient deterministic approximate counting for low degree polynomial threshold functions. - Anindya De; Rocco A. Servedio (Electron. Colloquium Comput. Complex., 2013)

Fast Integer Multiplication Using Modular Arithmetic. - Anindya De; Piyush P. Kurur; Chandan Saha 001; Ramprasad Saptharishi (SIAM J. Comput., 2013)

A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. - Constantinos Daskalakis; Anindya De; Ilias Diakonikolas; Ankur Moitra; Rocco A. Servedio (SODA, 2014)

Beyond the Central Limit Theorem: asymptotic expansions and pseudorandomness for combinatorial sums. - Anindya De (Electron. Colloquium Comput. Complex., 2014)

Learning from satisfying assignments. - Anindya De; Ilias Diakonikolas; Rocco A. Servedio (SODA, 2015)

Boolean Function Monotonicity Testing Requires (Almost) n1/2 Non-adaptive Queries. - Xi Chen 001; Anindya De; Rocco A. Servedio; Li-Yang Tan (STOC, 2015)

A size-free CLT for poisson multinomials and its applications. - Constantinos Daskalakis; Anindya De; Gautam Kamath 001; Christos Tzamos (STOC, 2016)

Noisy population recovery in polynomial time. - Anindya De; Michael E. Saks; Sijian Tang (Electron. Colloquium Comput. Complex., 2016)

A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. - Anindya De; Ilias Diakonikolas; Rocco A. Servedio (SIAM J. Discret. Math., 2016)

Majority is Stablest: Discrete and SoS. - Anindya De; Elchanan Mossel; Joe Neeman (Theory Comput., 2016)

Optimal mean-based algorithms for trace reconstruction. - Anindya De; Ryan O'Donnell; Rocco A. Servedio (STOC, 2017)

Noise Stability is computable and low dimensional. - Anindya De; Elchanan Mossel; Joe Neeman (CoRR, 2017)

Learning Sums of Independent Random Variables with Sparse Collective Support. - Anindya De; Philip M. Long; Rocco A. Servedio (FOCS, 2018)

Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. - Anindya De (SODA, 2018)

Non interactive simulation of correlated distributions is decidable. - Anindya De; Elchanan Mossel; Joe Neeman (SODA, 2018)

Is your data low-dimensional? - Anindya De; Elchanan Mossel; Joe Neeman (CoRR, 2018)

Learning sparse mixtures of rankings from noisy information. - Anindya De; Ryan O'Donnell; Rocco A. Servedio (CoRR, 2018)

Simple and efficient pseudorandom generators from Gaussian processes. - Eshan Chattopadhyay; Anindya De; Rocco A. Servedio (Electron. Colloquium Comput. Complex., 2018)

Is your function low dimensional? - Anindya De; Elchanan Mossel; Joe Neeman (COLT, 2019)

Junta Correlation is Testable. - Anindya De; Elchanan Mossel; Joe Neeman (FOCS, 2019)

Density Estimation for Shift-Invariant Multidimensional Distributions. - Anindya De; Philip M. Long; Rocco A. Servedio (ITCS, 2019)

Kruskal-Katona for convex sets, with applications. - Anindya De; Rocco A. Servedio (CoRR, 2019)

Noise Stability is Computable and Approximately Low-Dimensional. - Anindya De; Elchanan Mossel; Joe Neeman (Theory Comput., 2019)

An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. - Anindya De; Sanjeev Khanna; Huan Li 002; Hesam Nikpey (ICALP, 2020)

Learning from satisfying assignments under continuous distributions. - Clément L. Canonne; Anindya De; Rocco A. Servedio (SODA, 2020)

Reconstruction under outliers for Fourier-sparse functions. - Xue Chen 001; Anindya De (SODA, 2020)

Testing noisy linear functions for sparsity. - Xue Chen 001; Anindya De; Rocco A. Servedio (STOC, 2020)

Sharp Bounds for Population Recovery. - Anindya De; Ryan O'Donnell; Rocco A. Servedio (Theory Comput., 2020)

Learning a mixture of two subspaces over finite fields. - Aidao Chen; Anindya De; Aravindan Vijayaraghavan (ALT, 2021)

Reconstructing weighted voting schemes from partial information about their power indices. - Huck Bennett; Anindya De; Rocco A. Servedio; Emmanouil-Vasileios Vlatakis-Gkaragkounis (COLT, 2021)

Learning sparse mixtures of permutations from noisy information. - Anindya De; Ryan O'Donnell; Rocco A. Servedio (COLT, 2021)

Weak learning convex sets under normal distributions. - Anindya De; Rocco A. Servedio (COLT, 2021)

Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (ITCS, 2021)

Quantitative Correlation Inequalities via Semigroup Interpolation. - Anindya De; Shivam Nadimpalli; Rocco A. Servedio (ITCS, 2021)

Approximate optimization of convex functions with outlier noise. - Anindya De; Sanjeev Khanna; Huan Li 002; MohammadHesam NikpeySalekde (NeurIPS, 2021)

Robust testing of low-dimensional functions. - Anindya De; Elchanan Mossel; Joe Neeman (Electron. Colloquium Comput. Complex., 2021)

Algorithms for learning a mixture of linear classifiers. - Aidao Chen; Anindya De; Aravindan Vijayaraghavan (ALT, 2022)

Convex Influences. - Anindya De; Shivam Nadimpalli; Rocco A. Servedio (ITCS, 2022)

Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (SODA, 2022)

Approximating Sumset Size. - Anindya De; Shivam Nadimpalli; Rocco A. Servedio (SODA, 2022)

Nearly Tight Bounds for Discrete Search under Outlier Noise. - Anindya De; Sanjeev Khanna; Huan Li 002; Hesam Nikpey (SOSA, 2022)

Reconstructing Ultrametric Trees from Noisy Experiments. - Eshwar Ram Arunachaleswaran; Anindya De; Sampath Kannan (ALT, 2023)

Approximate Trace Reconstruction from a Single Trace. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (SODA, 2023)

Testing Convex Truncation. - Anindya De; Shivam Nadimpalli; Rocco A. Servedio (SODA, 2023)

Trace Reconstruction from Local Statistical Queries. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio (APPROX/RANDOM, 2024)

Gaussian Approximation of Convex Sets by Intersections of Halfspaces. - Anindya De; Shivam Nadimpalli; Rocco A. Servedio (FOCS, 2024)

Testing Intersecting and Union-Closed Families. - Xi Chen 001; Anindya De; Yuhao Li 002; Shivam Nadimpalli; Rocco A. Servedio (ITCS, 2024)

Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. - Xi Chen 001; Anindya De; Yuhao Li 002; Shivam Nadimpalli; Rocco A. Servedio (SODA, 2024)

Detecting Low-Degree Truncation. - Anindya De; Huan Li 002; Shivam Nadimpalli; Rocco A. Servedio (STOC, 2024)

Sparsifying Suprema of Gaussian Processes. - Anindya De; Shivam Nadimpalli; Ryan O'Donnell; Rocco A. Servedio (CoRR, 2024)

Relative-error monotonicity testing. - Xi Chen 001; Anindya De; Yizhi Huang; Yuhao Li 002; Shivam Nadimpalli; Rocco A. Servedio; Tianqi Yang (SODA, 2025)

Lower Bounds for Convexity Testing. - Xi Chen 001; Anindya De; Shivam Nadimpalli; Rocco A. Servedio; Erik Waingarten (SODA, 2025)

Polynomial-time Trace Reconstruction in the Smoothed Complexity Model. - Xi Chen 001; Anindya De; Chin Ho Lee; Rocco A. Servedio; Sandip Sinha (ACM Trans. Algorithms, 2025)