Anindya De
Identifiers
- name variant Anindya De 0.60 · backfill
Papers (27)
- Learning from satisfying assignments under continuous distributions cs.DS · 2019 · author #2
- Junta correlation is testable cs.CC · 2019 · author #1
- Density estimation for shift-invariant multidimensional distributions cs.LG · 2018 · author #1
- Learning sparse mixtures of rankings from noisy information cs.LG · 2018 · author #1
- Is your function low-dimensional? cs.CC · 2018 · author #1
- Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack cs.DS · 2017 · author #1
- Sharp bounds for population recovery cs.DS · 2017 · author #1
- Non interactive simulation of correlated distributions is decidable cs.CC · 2017 · author #1
- Noise Stability is computable and low dimensional math.PR · 2017 · author #1
- Optimal mean-based algorithms for trace reconstruction cs.CC · 2016 · author #1
- Noisy population recovery in polynomial time cs.CC · 2016 · author #1
- A Size-Free CLT for Poisson Multinomials and its Applications cs.DS · 2015 · author #2
- Boolean function monotonicity testing requires (almost) $n^{1/2}$ non-adaptive queries cs.CC · 2014 · author #2
- Efficient deterministic approximate counting for low-degree polynomial threshold functions cs.CC · 2013 · author #1
- Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions cs.CC · 2013 · author #1
- Deterministic Approximate Counting for Degree-$2$ Polynomial Threshold Functions cs.CC · 2013 · author #1
- A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage cs.DS · 2013 · author #2
- The Inverse Shapley Value Problem cs.GT · 2012 · author #1
- Inverse problems in approximate uniform generation cs.CC · 2012 · author #1
- Majority is Stablest : Discrete and SoS cs.CC · 2012 · author #1
- A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry cs.CC · 2012 · author #1
- Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces cs.CC · 2012 · author #1
- Explicit Optimal Hardness via Gaussian stability results cs.CC · 2012 · author #1
- Lower bounds in differential privacy cs.CR · 2011 · author #1
- Trevisan's extractor in the presence of quantum side information quant-ph · 2009 · author #1
- Near-optimal extractors against quantum storage quant-ph · 2009 · author #1
- Fast Integer Multiplication using Modular Arithmetic cs.SC · 2008 · author #1
Mentions
- 0801.1416 #1 · backfill · confidence 0.70 Anindya De
Frequent Coauthors
- Rocco A. Servedio 10 shared papers
- Ilias Diakonikolas 7 shared papers
- Elchanan Mossel 6 shared papers
- Joe Neeman 5 shared papers
- Rocco Servedio 4 shared papers
- Ryan O'Donnell 3 shared papers
- Constantinos Daskalakis 2 shared papers
- Thomas Vidick 2 shared papers
- Ankur Moitra 1 shared papers
- Chandan Saha 1 shared papers
- Christopher Portmann 1 shared papers
- Christos Tzamos 1 shared papers
- Cl\'ement L. Canonne 1 shared papers
- Gautam Kamath 1 shared papers
- Li-Yang Tan 1 shared papers
- Michael Saks 1 shared papers
- Philip M. Long 1 shared papers
- Piyush P Kurur 1 shared papers
- Ramprasad Saptharishi 1 shared papers
- Renato Renner 1 shared papers