Obserwuj
Anindya De
Anindya De
University of Pennsylvania
Zweryfikowany adres z seas.upenn.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Trevisan's extractor in the presence of quantum side information
A De, C Portmann, T Vidick, R Renner
SIAM Journal on Computing 41 (4), 915-940, 2012
1512012
Fast integer multiplication using modular arithmetic
A De, PP Kurur, C Saha, R Saptharishi
SIAM Journal on Computing 42 (2), 685-699, 2013
1112013
Time space tradeoffs for attacks against one-way functions and prgs
A De, L Trevisan, M Tulsiani
Advances in Cryptology–CRYPTO 2010, 649-665, 2010
84*2010
Improved pseudorandom generators for depth 2 circuits
A De, O Etesami, L Trevisan, M Tulsiani
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010
712010
Optimal mean-based algorithms for trace reconstruction
A De, R O’Donnell, RA Servedio
The Annals of Applied Probability 29 (2), 851-874, 2019
602019
Boolean function monotonicity testing requires (almost) n 1/2 non-adaptive queries
X Chen, A De, RA Servedio, LY Tan
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
592015
Lower bounds in differential privacy
A De
Theory of Cryptography, 321-338, 2012
542012
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
A De, I Diakonikolas, V Feldman, RA Servedio
Journal of the ACM (JACM) 61 (2), 11, 2014
482014
Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces
A De, I Diakonikolas, V Feldman, RA Servedio
Journal of the ACM (JACM) 61 (2), 11, 2014
482014
The inverse Shapley value problem
A De, I Diakonikolas, R Servedio
Automata, Languages, and Programming, 266-277, 2012
38*2012
A size-free CLT for poisson multinomials and its applications
C Daskalakis, A De, G Kamath, C Tzamos
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
362016
Near-optimal extractors against quantum storage
A De, T Vidick
Proceedings of the forty-second ACM symposium on Theory of computing, 161-170, 2010
362010
Learning from satisfying assignments
A De, I Diakonikolas, RA Servedio
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
352014
Extractors and lower bounds for locally samplable sources
A De, T Watson
ACM Transactions on Computation Theory (TOCT) 4 (1), 3, 2012
312012
Majority is stablest: discrete and SoS
A De, E Mossel, J Neeman
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
252013
Pseudorandomness for permutation and regular branching programs
A De
Computational Complexity (CCC), 2011 IEEE 26th Annual Conference on, 221-231, 2011
252011
Non interactive simulation of correlated distributions is decidable
A De, E Mossel, J Neeman
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
242018
Computation of optimal break point set of relays—an integer linear programming approach
RK Gajbhiye, A De, SA Soman
IEEE Transactions on Power Delivery 22 (4), 2087-2098, 2007
222007
Polynomial-time trace reconstruction in the smoothed complexity model
X Chen, A De, CH Lee, RA Servedio, S Sinha
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 54-73, 2021
192021
A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting
A De, RA Servedio
Probability Theory and Related Fields, 1-64, 2017
19*2017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20