| 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 | 185 | 2012 |
| Fast integer multiplication using modular arithmetic A De, PP Kurur, C Saha, R Saptharishi Proceedings of the fortieth annual ACM symposium on Theory of computing, 499-506, 2008 | 129 | 2008 |
| 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 | 119* | 2010 |
| Optimal mean-based algorithms for trace reconstruction A De, R O’Donnell, RA Servedio The Annals of Applied Probability 29 (2), 851-874, 2019 | 79 | 2019 |
| Improved pseudorandom generators for depth 2 circuits A De, O Etesami, L Trevisan, M Tulsiani Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 75 | 2010 |
| 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 | 74 | 2015 |
| Lower bounds in differential privacy A De Theory of Cryptography, 321-338, 2012 | 61 | 2012 |
| 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 | 53 | 2014 |
| 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 | 53 | 2014 |
| Learning from satisfying assignments A De, I Diakonikolas, RA Servedio Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014 | 45 | 2014 |
| The inverse Shapley value problem A De, I Diakonikolas, R Servedio Automata, Languages, and Programming, 266-277, 2012 | 42* | 2012 |
| Extractors and lower bounds for locally samplable sources A De, T Watson ACM Transactions on Computation Theory (TOCT) 4 (1), 3, 2012 | 39 | 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 | 38 | 2016 |
| Near-optimal extractors against quantum storage A De, T Vidick Proceedings of the forty-second ACM symposium on Theory of computing, 161-170, 2010 | 37 | 2010 |
| 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 | 31 | 2018 |
| 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 | 29 | 2013 |
| Pseudorandomness for permutation and regular branching programs A De Computational Complexity (CCC), 2011 IEEE 26th Annual Conference on, 221-231, 2011 | 28 | 2011 |
| 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 | 26 | 2021 |
| 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 | 25* | 2017 |
| A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry A De, I Diakonikolas, RA Servedio SIAM Journal on Discrete Mathematics 30 (2), 1058-1094, 2016 | 24 | 2016 |
Ilias DiakonikolasUniversity of Wisconsin-MadisonVerified email at wisc.edu
