Skip to content
cs-conference-ranking.org

Anindya De

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

47

Venues

8

Active years

2008–2026

Best venue rank

A*

Where they publish

Papers

47 indexed papers, newest first.

YearVenueTitleAuthors
2026ICALPSublinear-Query Relative-Error Testing of Halfspaces.Xi Chen, Anindya De, Yizhi Huang, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
2026SODAHalfspaces are hard to test with relative error.Xi Chen, Anindya De, Yizhi Huang, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
2026STOCTesting Noisy Low-Degree Polynomials for Sparsity.Yiqiao Bao, Anindya De, Shivam Nadimpalli, Rocco A. Servedio, Nathan White
2026STOCSparsifying Suprema of Gaussian Processes.Anindya De, Shivam Nadimpalli, Ryan O'Donnell, Rocco A. Servedio
2025FOCSStochastic Knapsack without Relaxing the Capacity.Anindya De, Sanjeev Khanna, Nathan White
2025SODARelative-error monotonicity testing.Xi Chen, Anindya De, Yizhi Huang, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
2025SODALower Bounds for Convexity Testing.Xi Chen, Anindya De, Shivam Nadimpalli, Rocco A. Servedio, Erik Waingarten
2024FOCSGaussian Approximation of Convex Sets by Intersections of Halfspaces.Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2024SODAMildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas.Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio
2024STOCDetecting Low-Degree Truncation.Anindya De, Huan Li, Shivam Nadimpalli, Rocco A. Servedio
2023ALTReconstructing Ultrametric Trees from Noisy Experiments.Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan
2023SODAApproximate Trace Reconstruction from a Single Trace.Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2023SODATesting Convex Truncation.Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2022ALTAlgorithms for learning a mixture of linear classifiers.Aidao Chen, Anindya De, Aravindan Vijayaraghavan
2022SODANear-Optimal Average-Case Approximate Trace Reconstruction from Few Traces.Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2022SODAApproximating Sumset Size.Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2021ALTLearning a mixture of two subspaces over finite fields.Aidao Chen, Anindya De, Aravindan Vijayaraghavan
2021COLTReconstructing weighted voting schemes from partial information about their power indices.Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis
2021COLTLearning sparse mixtures of permutations from noisy information.Anindya De, Ryan O'Donnell, Rocco A. Servedio
2021COLTWeak learning convex sets under normal distributions.Anindya De, Rocco A. Servedio
2021SODAPolynomial-time trace reconstruction in the smoothed complexity model.Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2021STOCRobust testing of low dimensional functions.Anindya De, Elchanan Mossel, Joe Neeman
2020ICALPAn Efficient PTAS for Stochastic Load Balancing with Poisson Jobs.Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey
2020SODALearning from satisfying assignments under continuous distributions.Clment L. Canonne, Anindya De, Rocco A. Servedio
2020SODAReconstruction under outliers for Fourier-sparse functions.Xue Chen, Anindya De
2020STOCTesting noisy linear functions for sparsity.Xue Chen, Anindya De, Rocco A. Servedio
2019COLTIs your function low dimensional?Anindya De, Elchanan Mossel, Joe Neeman
2019FOCSJunta Correlation is Testable.Anindya De, Elchanan Mossel, Joe Neeman
2018FOCSLearning Sums of Independent Random Variables with Sparse Collective Support.Anindya De, Philip M. Long, Rocco A. Servedio
2018SODABoolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack.Anindya De
2018SODANon interactive simulation of correlated distributions is decidable.Anindya De, Elchanan Mossel, Joe Neeman
2017STOCOptimal mean-based algorithms for trace reconstruction.Anindya De, Ryan O'Donnell, Rocco A. Servedio
2016FOCSNoisy Population Recovery in Polynomial Time.Anindya De, Michael E. Saks, Sijian Tang
2016STOCA size-free CLT for poisson multinomials and its applications.Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos
2015FOCSBeyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial Sums.Anindya De
2015SODALearning from satisfying assignments.Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2015STOCBoolean Function Monotonicity Testing Requires (Almost) nXi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan
2014SODAA Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage.Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio
2014STOCEfficient deterministic approximate counting for low-degree polynomial threshold functions.Anindya De, Rocco A. Servedio
2013ICALPA Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry.Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2013STOCMajority is stablest: discrete and SoS.Anindya De, Elchanan Mossel, Joe Neeman
2012ICALPThe Inverse Shapley Value Problem.Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2012STOCNearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces.Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio
2012TCCLower Bounds in Differential Privacy.Anindya De
2010CRYPTOTime Space Tradeoffs for Attacks against One-Way Functions and PRGs.Anindya De, Luca Trevisan, Madhur Tulsiani
2010STOCNear-optimal extractors against quantum storage.Anindya De, Thomas Vidick
2008STOCFast integer multiplication using modular arithmetic.Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi