The following pages link to Anindya De (Q1656544):
Displaying 44 items.
- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
- Optimal mean-based algorithms for trace reconstruction (Q1737958) (← links)
- Quantitative correlation inequalities via extremal power series (Q2140009) (← links)
- The inverse Shapley value problem (Q2411521) (← links)
- A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry (Q2808162) (← links)
- Fast Integer Multiplication Using Modular Arithmetic (Q2840990) (← links)
- Near-optimal extractors against quantum storage (Q2875142) (← links)
- Lower Bounds in Differential Privacy (Q2891492) (← links)
- Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries (Q2941544) (← links)
- Explicit Optimal Hardness via Gaussian Stability Results (Q2947585) (← links)
- Trevisan's Extractor in the Presence of Quantum Side Information (Q3143297) (← links)
- Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces (Q3189646) (← links)
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs (Q3582782) (← links)
- Improved Pseudorandom Generators for Depth 2 Circuits (Q3588430) (← links)
- Extractors Using Hardness Amplification (Q3638898) (← links)
- (Q4384065) (← links)
- (Q4607972) (← links)
- Non interactive simulation of correlated distributions is decidable (Q4608069) (← links)
- (Q4718555) (← links)
- Optimal mean-based algorithms for trace reconstruction (Q4978045) (← links)
- (Q5090402) (← links)
- Simple and efficient pseudorandom generators from gaussian processes (Q5091754) (← links)
- (Q5111140) (← links)
- Sharp bounds for population recovery (Q5140840) (← links)
- Testing noisy linear functions for sparsity (Q5144948) (← links)
- Learning from satisfying assignments under continuous distributions (Q5146766) (← links)
- Reconstruction under outliers for Fourier-sparse functions (Q5146910) (← links)
- (Q5149248) (← links)
- (Q5204824) (← links)
- Efficient deterministic approximate counting for low-degree polynomial threshold functions (Q5259619) (← links)
- (Q5302073) (← links)
- Single magnetic particle dynamics in a microchannel (Q5303654) (← links)
- A size-free CLT for poisson multinomials and its applications (Q5361903) (← links)
- Learning from satisfying assignments (Q5363037) (← links)
- A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage (Q5384009) (← links)
- Majority is stablest (Q5495818) (← links)
- (Q5741631) (← links)
- Testing Convex Truncation (Q6435414) (← links)
- Approximate trace reconstruction from a single trace (Q6538554) (← links)
- Nearly tight bounds for discrete search under outlier noise (Q6538774) (← links)
- Near-optimal average-case approximate trace reconstruction from few traces (Q6575106) (← links)
- Approximating sumset size (Q6575168) (← links)
- Mildly exponential lower bounds on tolerant testers for monotonicity, unateness, and juntas (Q6645520) (← links)
- Sparsifying Suprema of Gaussian Processes (Q6754580) (← links)
