Name
Affiliation
Papers
ANINDYA DE
Computer Science Division, University of California, Berkeley, USA
53
Collaborators
Citations 
PageRank 
46
239
24.77
Referers 
Referees 
References 
376
459
505
Search Limit
100459
Title
Citations
PageRank
Year
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces00.342022
Algorithms for learning a mixture of linear classifiers00.342022
Approximating Sumset Size00.342022
Approximate optimization of convex functions with outlier noise.00.342021
Robust testing of low dimensional functions00.342021
Reconstructing weighted voting schemes from partial information about their power indices.00.342021
Quantitative Correlation Inequalities via Semigroup Interpolation00.342021
Polynomial-time trace reconstruction in the low deletion rate regime00.342021
Learning sparse mixtures of permutations from noisy information.00.342021
Weak learning convex sets under normal distributions.00.342021
Polynomial-time trace reconstruction in the smoothed complexity model20.382021
Sharp Bounds for Population Recovery.00.342020
Testing noisy linear functions for sparsity00.342020
Learning from satisfying assignments under continuous distributions.00.342020
An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs00.342020
Optimal mean-based algorithms for trace reconstruction.40.492019
Density estimation for shift-invariant multidimensional distributions.00.342019
Noise Stability is Computable and Approximately Low-Dimensional.00.342019
Is your function low dimensional?00.342019
Junta Correlation is Testable00.342019
Is your data low-dimensional?00.342018
Non interactive simulation of correlated distributions is decidable.00.342018
Learning Sums of Independent Random Variables with Sparse Collective Support20.382018
Simple and efficient pseudorandom generators from Gaussian processes.00.342018
Learning sparse mixtures of rankings from noisy information.00.342018
Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack.10.352017
Noise Stability is computable and low dimensional.20.422017
Noise Stability Is Computable and Approximately Low-Dimensional.00.342017
Noisy Population Recovery in Polynomial Time20.392016
Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries120.742015
A Size-Free CLT for Poisson Multinomials and its Applications110.562015
Learning from satisfying assignments60.482015
Beyond the Central Limit Theorem: asymptotic expansions and pseudorandomness for combinatorial sums.60.482014
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces130.672014
A polynomial-time approximation scheme for fault-tolerant distributed storage30.382013
Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions.20.362013
A robust khintchine inequality, and algorithms for computing optimal constants in fourier analysis and high-dimensional geometry20.372013
Efficient deterministic approximate counting for low-degree polynomial threshold functions50.462013
Fast Integer Multiplication Using Modular Arithmetic.10.352013
Majority is stablest: discrete and SoS80.482013
Inverse problems in approximate uniform generation10.392012
The inverse shapley value problem100.652012
Lower bounds in differential privacy462.272012
Trevisan's extractor in the presence of quantum side information281.062012
A robust Khintchine-Kahane 00.342012
Explicit Optimal Hardness via Gaussian Stability Results10.352012
Pseudorandomness for Permutation and Regular Branching Programs170.692011
Extractors and Lower Bounds for Locally Samplable Sources.00.342011
Time space tradeoffs for attacks against one-way functions and PRGs180.702010
Near-optimal extractors against quantum storage110.642010
  • 1
  • 2