| Nonmalleable extractors with short seeds and applications to privacy amplification G Cohen, R Raz, G Segev SIAM Journal on Computing 43 (2), 450-476, 2014 | 70 | 2014 |
| Local correlation breakers and applications to three-source extractors and mergers G Cohen SIAM Journal on Computing 45 (4), 1297-1338, 2016 | 58 | 2016 |
| Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs G Cohen Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 56 | 2016 |
| The complexity of DNF of parities G Cohen, I Shinkar Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016 | 43 | 2016 |
| Efficient multiparty protocols via log-depth threshold formulae G Cohen, IB Damgård, Y Ishai, J Kölker, PB Miltersen, R Raz, ... Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013 | 43 | 2013 |
| Two structural results for low degree polynomials and applications G Cohen, A Tal arXiv preprint arXiv:1404.0654, 2014 | 42 | 2014 |
| Making the most of advice: New correlation breakers and their applications G Cohen 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 41 | 2016 |
| Non-malleable extractors-new tools and improved constructions G Cohen 31st Conference on Computational Complexity (CCC 2016), 2016 | 41 | 2016 |
| Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs M Braverman, G Cohen, S Garg SIAM Journal on Computing 49 (5), STOC18-242-STOC18-299, 2019 | 37* | 2019 |
| Extractors for near logarithmic min-entropy G Cohen, LJ Schulman 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 30 | 2016 |
| Two-source extractors for quasi-logarithmic min-entropy and improved privacy amplification protocols G Cohen Electronic Colloquium on Computational Complexity (ECCC) 23, 114, 2016 | 25 | 2016 |
| Towards optimal two-source extractors and Ramsey graphs G Cohen Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 23 | 2017 |
| Explicit binary tree codes with polylogarithmic size alphabet G Cohen, B Haeupler, LJ Schulman Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 21 | 2018 |
| Two sides of the coin problem G Cohen, A Ganor, R Raz Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014 | 19 | 2014 |
| Error reduction for weighted PRGs against read once branching programs G Cohen, D Doron, O Renard, O Sberlo, A Ta-Shma Leibniz international proceedings in informatics 200 (22), 2021 | 17 | 2021 |
| Pseudorandom generators for low degree polynomials from algebraic geometry codes G Cohen, A Ta-Shma Electronic Colloquium on Computational Complexity: ECCC 20 (155), 13, 2013 | 17 | 2013 |
| Expander random walks: A fourier-analytic approach G Cohen, N Peri, A Ta-Shma Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 16 | 2021 |
| Two-source condensers with low error and small entropy gap via entropy-resilient functions A Ben-Aroya, G Cohen, D Doron, A Ta-Shma Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2019 | 13 | 2019 |
| Bi-Lipschitz bijection between the Boolean cube and the Hamming ball I Benjamini, G Cohen, I Shinkar Israel Journal of Mathematics 212 (2), 677-703, 2016 | 13 | 2016 |
| Non-malleable extractors with logarithmic seeds G Cohen Electronic Colloquium on Computational Complexity (ECCC) 23, 30, 2016 | 13 | 2016 |
Ran RazPrinceton University在 princeton.edu 的电子邮件经过验证
