Cryptography and game theory: Designing protocols for exchanging information G Kol, M Naor
Theory of cryptography conference, 320-339, 2008
248 2008 Games for exchanging information G Kol, M Naor
Proceedings of the fortieth annual ACM symposium on Theory of computing, 423-432, 2008
158 2008 Exponential separation of information and communication A Ganor, G Kol, R Raz
2014 ieee 55th annual symposium on foundations of computer science, 176-185, 2014
105 * 2014 Interactive channel capacity G Kol, R Raz
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
91 2013 Exponential separation of information and communication for boolean functions A Ganor, G Kol, R Raz
Journal of the ACM (JACM) 63 (5), 1-31, 2016
61 2016 Time-space hardness of learning sparse parities G Kol, R Raz, A Tal
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
56 2017 Interactive distributed proofs G Kol, R Oshman, RR Saxena
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
50 2018 Exponential separation of communication and external information A Ganor, G Kol, R Raz
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
39 2016 Towards optimal deterministic coding for interactive communication R Gelles, B Haeupler, G Kol, N Ron-Zewi, A Wigderson
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
33 2016 Multi-pass graph streaming lower bounds for cycle counting, max-cut, matching size, and other problems S Assadi, G Kol, RR Saxena, H Yu
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
30 2020 Interactive compression for product distributions G Kol
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
28 2016 Interactive coding over the noisy broadcast channel K Efremenko, G Kol, R Saxena
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
23 2018 Approximate nonnegative rank is equivalent to the smooth rectangle bound G Kol, S Moran, A Shpilka, A Yehudayoff
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
17 2014 Competing provers protocols for circuit evaluation G Kol, R Raz
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
17 2013 Distributed zero-knowledge proofs over networks A Bick, G Kol, R Oshman
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
15 2022 Noisy beeps K Efremenko, G Kol, RR Saxena
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
15 2020 Near-optimal two-pass streaming algorithm for sampling random walks over directed graphs L Chen, G Kol, D Paramonov, R Saxena, Z Song, H Yu
arXiv preprint arXiv:2102.11251, 2021
14 2021 Explicit capacity approaching coding for interactive communication R Gelles, B Haeupler, G Kol, N Ron-Zewi, A Wigderson
IEEE Transactions on Information Theory 64 (10), 6546-6560, 2018
14 2018 Almost optimal super-constant-pass streaming lower bounds for reachability L Chen, G Kol, D Paramonov, RR Saxena, Z Song, H Yu
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
12 2021 Binary Interactive Error Resilience Beyond K Efremenko, G Kol, RR Saxena
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
12 2020 
Ran RazPrinceton UniversityDirección de correo verificada de princeton.edu
