Anindya De - RankMe

140 papers A* 39A 10B 4Journal 81Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Halfspaces are hard to test with relative error. SODA Xi Chen, Anindya De, Yizhi Huang, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
2025	J	`jnl`	Halfspaces are hard to test with relative error. CoRR Xi Chen, Anindya De, Yizhi Huang, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
2025	A*	`conf`	Lower Bounds for Convexity Testing. SODA Xi Chen, Anindya De, Shivam Nadimpalli, Rocco A. Servedio, Erik Waingarten
2025	J	`jnl`	Model-agnostic super-resolution in high dimensions. CoRR Xi Chen, Anindya De, Yizhi Huang, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
2025	J	`jnl`	Polynomial-time Trace Reconstruction in the Smoothed Complexity Model. ACM Trans. Algorithms Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2025	A*	`conf`	Relative-error monotonicity testing. SODA Xi Chen, Anindya De, Yizhi Huang, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
2025	A*	`conf`	Stochastic Knapsack without Relaxing the Capacity. FOCS Anindya De, Sanjeev Khanna, Nathan White
2025	J	`jnl`	Testing noisy low-degree polynomials for sparsity. CoRR Yiqiao Bao, Anindya De, Shivam Nadimpalli, Rocco A. Servedio, Nathan White
2024	A*	`conf`	Detecting Low-Degree Truncation. STOC Anindya De, Huan Li, Shivam Nadimpalli, Rocco A. Servedio
2024	J	`jnl`	Detecting Low-Degree Truncation. CoRR Anindya De, Huan Li, Shivam Nadimpalli, Rocco A. Servedio
2024	A*	`conf`	Gaussian Approximation of Convex Sets by Intersections of Halfspaces. FOCS Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2024	J	`jnl`	Lower Bounds for Convexity Testing. CoRR Xi Chen, Anindya De, Shivam Nadimpalli, Rocco A. Servedio, Erik Waingarten
2024	A*	`conf`	Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. SODA Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio
2024	J	`jnl`	Relative-error monotonicity testing. CoRR Xi Chen, Anindya De, Yizhi Huang, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
2024	J	`jnl`	Sparsifying Suprema of Gaussian Processes. CoRR Anindya De, Shivam Nadimpalli, Ryan O'Donnell, Rocco A. Servedio
2024	A	`conf`	Testing Intersecting and Union-Closed Families. ITCS Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio
2024	A	`conf`	Trace Reconstruction from Local Statistical Queries. APPROX/RANDOM Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio
2024	J	`jnl`	Trace reconstruction from local statistical queries. CoRR Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio
2023	A*	`conf`	Approximate Trace Reconstruction from a Single Trace. SODA Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2023	J	`jnl`	Gaussian Approximation of Convex Sets by Intersections of Halfspaces. CoRR Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2023	J	`jnl`	Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas. CoRR Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio
2023	B	`conf`	Reconstructing Ultrametric Trees from Noisy Experiments. ALT Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan
2023	A*	`conf`	Testing Convex Truncation. SODA Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2023	J	`jnl`	Testing Convex Truncation. CoRR Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2023	J	`jnl`	Testing Intersecting and Union-Closed Families. CoRR Xi Chen, Anindya De, Yuhao Li, Shivam Nadimpalli, Rocco A. Servedio
2022	B	`conf`	Algorithms for learning a mixture of linear classifiers. ALT Aidao Chen, Anindya De, Aravindan Vijayaraghavan
2022	J	`jnl`	Approximate Trace Reconstruction from a Single Trace. CoRR Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2022	A*	`conf`	Approximating Sumset Size. SODA Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2022	A	`conf`	Convex Influences. ITCS Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2022	A*	`conf`	Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. SODA Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2022	—	`conf`	Nearly Tight Bounds for Discrete Search under Outlier Noise. SOSA Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey
2022	J	`jnl`	Reconstructing Ultrametric Trees from Noisy Experiments. CoRR Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan
2021	A*	`conf`	Approximate optimization of convex functions with outlier noise. NeurIPS Anindya De, Sanjeev Khanna, Huan Li, MohammadHesam NikpeySalekde
2021	J	`jnl`	Approximating Sumset Size. CoRR Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2021	J	`jnl`	Convex Influences. CoRR Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2021	B	`conf`	Learning a mixture of two subspaces over finite fields. ALT Aidao Chen, Anindya De, Aravindan Vijayaraghavan
2021	A*	`conf`	Learning sparse mixtures of permutations from noisy information. COLT Anindya De, Ryan O'Donnell, Rocco A. Servedio
2021	J	`jnl`	Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces. CoRR Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2021	A	`conf`	Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime. ITCS Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2021	A*	`conf`	Polynomial-time trace reconstruction in the smoothed complexity model. SODA Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2021	A	`conf`	Quantitative Correlation Inequalities via Semigroup Interpolation. ITCS Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2021	A*	`conf`	Reconstructing weighted voting schemes from partial information about their power indices. COLT Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis
2021	A*	`conf`	Robust testing of low dimensional functions. STOC Anindya De, Elchanan Mossel, Joe Neeman
2021	J	`jnl`	Robust testing of low-dimensional functions. Electron. Colloquium Comput. Complex. Anindya De, Elchanan Mossel, Joe Neeman
2021	A*	`conf`	Weak learning convex sets under normal distributions. COLT Anindya De, Rocco A. Servedio
2020	A*	`conf`	An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. ICALP Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey
2020	J	`jnl`	An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. CoRR Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey
2020	J	`jnl`	Learning a mixture of two subspaces over finite fields. CoRR Aidao Chen, Anindya De, Aravindan Vijayaraghavan
2020	A*	`conf`	Learning from satisfying assignments under continuous distributions. SODA Clément L. Canonne, Anindya De, Rocco A. Servedio
2020	J	`jnl`	Polynomial-time trace reconstruction in the low deletion rate regime. CoRR Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2020	J	`jnl`	Polynomial-time trace reconstruction in the smoothed complexity model. CoRR Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
2020	J	`jnl`	Quantitative Correlation Inequalities via Semigroup Interpolation. CoRR Anindya De, Shivam Nadimpalli, Rocco A. Servedio
2020	J	`jnl`	Reconstructing weighted voting schemes from partial information about their power indices. CoRR Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis
2020	A*	`conf`	Reconstruction under outliers for Fourier-sparse functions. SODA Xue Chen, Anindya De
2020	J	`jnl`	Robust testing of low-dimensional functions. CoRR Anindya De, Elchanan Mossel, Joe Neeman
2020	J	`jnl`	Sharp Bounds for Population Recovery. Theory Comput. Anindya De, Ryan O'Donnell, Rocco A. Servedio
2020	A*	`conf`	Testing noisy linear functions for sparsity. STOC Xue Chen, Anindya De, Rocco A. Servedio
2019	A	`conf`	Density Estimation for Shift-Invariant Multidimensional Distributions. ITCS Anindya De, Philip M. Long, Rocco A. Servedio
2019	A*	`conf`	Is your function low dimensional? COLT Anindya De, Elchanan Mossel, Joe Neeman
2019	A*	`conf`	Junta Correlation is Testable. FOCS Anindya De, Elchanan Mossel, Joe Neeman
2019	J	`jnl`	Junta correlation is testable. CoRR Anindya De, Elchanan Mossel, Joe Neeman
2019	J	`jnl`	Kruskal-Katona for convex sets, with applications. CoRR Anindya De, Rocco A. Servedio
2019	J	`jnl`	Learning from satisfying assignments under continuous distributions. CoRR Clément L. Canonne, Anindya De, Rocco A. Servedio
2019	J	`jnl`	Noise Stability is Computable and Approximately Low-Dimensional. Theory Comput. Anindya De, Elchanan Mossel, Joe Neeman
2019	J	`jnl`	Reconstruction under outliers for Fourier-sparse functions. CoRR Xue Chen, Anindya De
2019	A	`conf`	Simple and Efficient Pseudorandom Generators from Gaussian Processes. CCC Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
2019	J	`jnl`	Testing noisy linear functions for sparsity. CoRR Xue Chen, Anindya De, Rocco A. Servedio
2018	A*	`conf`	Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. SODA Anindya De
2018	J	`jnl`	Density estimation for shift-invariant multidimensional distributions. CoRR Anindya De, Philip M. Long, Rocco A. Servedio
2018	J	`jnl`	Is your data low-dimensional? CoRR Anindya De, Elchanan Mossel, Joe Neeman
2018	A*	`conf`	Learning Sums of Independent Random Variables with Sparse Collective Support. FOCS Anindya De, Philip M. Long, Rocco A. Servedio
2018	J	`jnl`	Learning Sums of Independent Random Variables with Sparse Collective Support. CoRR Anindya De, Philip M. Long, Rocco A. Servedio
2018	J	`jnl`	Learning sparse mixtures of rankings from noisy information. CoRR Anindya De, Ryan O'Donnell, Rocco A. Servedio
2018	A*	`conf`	Non interactive simulation of correlated distributions is decidable. SODA Anindya De, Elchanan Mossel, Joe Neeman
2018	J	`jnl`	Simple and efficient pseudorandom generators from Gaussian processes. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, Anindya De, Rocco A. Servedio
2017	J	`jnl`	Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack. CoRR Anindya De
2017	A	`conf`	Noise Stability Is Computable and Approximately Low-Dimensional. CCC Anindya De, Elchanan Mossel, Joe Neeman
2017	J	`jnl`	Noise Stability is computable and low dimensional. CoRR Anindya De, Elchanan Mossel, Joe Neeman
2017	J	`jnl`	Non interactive simulation of correlated distributions is decidable. CoRR Anindya De, Elchanan Mossel, Joe Neeman
2017	A*	`conf`	Optimal mean-based algorithms for trace reconstruction. STOC Anindya De, Ryan O'Donnell, Rocco A. Servedio
2017	J	`jnl`	Sharp bounds for population recovery. CoRR Anindya De, Ryan O'Donnell, Rocco A. Servedio
2017	J	`jnl`	The Inverse Shapley value problem. Games Econ. Behav. Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2016	J	`jnl`	A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. SIAM J. Discret. Math. Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2016	A*	`conf`	A size-free CLT for poisson multinomials and its applications. STOC Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos
2016	J	`jnl`	Majority is Stablest: Discrete and SoS. Theory Comput. Anindya De, Elchanan Mossel, Joe Neeman
2016	A*	`conf`	Noisy Population Recovery in Polynomial Time. FOCS Anindya De, Michael E. Saks, Sijian Tang
2016	J	`jnl`	Noisy population recovery in polynomial time. CoRR Anindya De, Michael E. Saks, Sijian Tang
2016	J	`jnl`	Noisy population recovery in polynomial time. Electron. Colloquium Comput. Complex. Anindya De, Michael E. Saks, Sijian Tang
2016	J	`jnl`	Optimal mean-based algorithms for trace reconstruction. CoRR Anindya De, Ryan O'Donnell, Rocco A. Servedio
2015	J	`jnl`	A Size-Free CLT for Poisson Multinomials and its Applications. CoRR Constantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos
2015	A*	`conf`	Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial Sums. FOCS Anindya De
2015	A*	`conf`	Boolean Function Monotonicity Testing Requires (Almost) n STOC Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan
2015	A*	`conf`	Learning from satisfying assignments. SODA Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2014	A*	`conf`	A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. SODA Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio
2014	J	`jnl`	Beyond the Central Limit Theorem: asymptotic expansions and pseudorandomness for combinatorial sums. Electron. Colloquium Comput. Complex. Anindya De
2014	J	`jnl`	Boolean function monotonicity testing requires (almost) n CoRR Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan
2014	A	`conf`	Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. CCC Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2014	A*	`conf`	Efficient deterministic approximate counting for low-degree polynomial threshold functions. STOC Anindya De, Rocco A. Servedio
2014	J	`jnl`	Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces. J. ACM Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio
2013	J	`jnl`	A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. CoRR Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio
2013	—	`conf`	A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. ICALP (1) Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2013	J	`jnl`	Deterministic Approximate Counting for Degree-$2$ Polynomial Threshold Functions. CoRR Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2013	J	`jnl`	Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions. Electron. Colloquium Comput. Complex. Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2013	J	`jnl`	Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions. CoRR Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2013	J	`jnl`	Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. Electron. Colloquium Comput. Complex. Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2013	J	`jnl`	Efficient deterministic approximate counting for low degree polynomial threshold functions. Electron. Colloquium Comput. Complex. Anindya De, Rocco A. Servedio
2013	J	`jnl`	Efficient deterministic approximate counting for low-degree polynomial threshold functions. CoRR Anindya De, Rocco A. Servedio
2013	J	`jnl`	Explicit Optimal Hardness via Gaussian Stability Results. ACM Trans. Comput. Theory Anindya De, Elchanan Mossel
2013	J	`jnl`	Fast Integer Multiplication Using Modular Arithmetic. SIAM J. Comput. Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
2013	A*	`conf`	Majority is stablest: discrete and SoS. STOC Anindya De, Elchanan Mossel, Joe Neeman
2012	J	`jnl`	A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry. CoRR Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2012	J	`jnl`	Explicit Optimal Hardness via Gaussian stability results CoRR Anindya De, Elchanan Mossel
2012	J	`jnl`	Explicit Optimal hardness via Gaussian stability results. Electron. Colloquium Comput. Complex. Anindya De, Elchanan Mossel
2012	J	`jnl`	Extractors and Lower Bounds for Locally Samplable Sources. ACM Trans. Comput. Theory Anindya De, Thomas Watson
2012	J	`jnl`	Inverse Problems in Approximate Uniform Generation. Electron. Colloquium Comput. Complex. Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2012	J	`jnl`	Inverse problems in approximate uniform generation CoRR Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2012	B	`conf`	Lower Bounds in Differential Privacy. TCC Anindya De
2012	J	`jnl`	Majority is Stablest : Discrete and SoS CoRR Anindya De, Elchanan Mossel, Joe Neeman
2012	J	`jnl`	Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces CoRR Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio
2012	J	`jnl`	Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces. Electron. Colloquium Comput. Complex. Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio
2012	A*	`conf`	Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. STOC Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio
2012	J	`jnl`	The Inverse Shapley Value Problem CoRR Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2012	—	`conf`	The Inverse Shapley Value Problem. ICALP (1) Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2012	J	`jnl`	The Inverse Shapley Value Problem. Electron. Colloquium Comput. Complex. Anindya De, Ilias Diakonikolas, Rocco A. Servedio
2012	J	`jnl`	Trevisan's Extractor in the Presence of Quantum Side Information. SIAM J. Comput. Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner
2011	—	`conf`	Extractors and Lower Bounds for Locally Samplable Sources. APPROX-RANDOM Anindya De, Thomas Watson
2011	J	`jnl`	Extractors and Lower Bounds for Locally Samplable Sources. Electron. Colloquium Comput. Complex. Anindya De, Thomas Watson
2011	J	`jnl`	Lower bounds in differential privacy CoRR Anindya De
2011	A	`conf`	Pseudorandomness for Permutation and Regular Branching Programs. CCC Anindya De
2010	—	`conf`	Improved Pseudorandom Generators for Depth 2 Circuits. APPROX-RANDOM Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani
2010	A*	`conf`	Near-optimal extractors against quantum storage. STOC Anindya De, Thomas Vidick
2010	A*	`conf`	Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. CRYPTO Anindya De, Luca Trevisan, Madhur Tulsiani
2009	—	`conf`	Extractors Using Hardness Amplification. APPROX-RANDOM Anindya De, Luca Trevisan
2009	J	`jnl`	Improved Pseudorandom Generators for Depth 2 Circuits. Electron. Colloquium Comput. Complex. Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani
2009	J	`jnl`	Near-optimal extractors against quantum storage. Electron. Colloquium Comput. Complex. Anindya De, Thomas Vidick
2009	J	`jnl`	Non-uniform attacks against one-way functions and PRGs. Electron. Colloquium Comput. Complex. Anindya De, Luca Trevisan, Madhur Tulsiani
2009	J	`jnl`	Trevisan's extractor in the presence of quantum side information CoRR Anindya De, Christopher Portmann, Thomas Vidick, Renato Renner
2008	J	`jnl`	Fast Integer Multiplication using Modular Arithmetic CoRR Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
2008	J	`jnl`	Fast Integer Multiplication using Modular Arithmetic. Electron. Colloquium Comput. Complex. Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
2008	A*	`conf`	Fast integer multiplication using modular arithmetic. STOC Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi