| 2026 | ICALP | White-Box Adversarial Streaming Lower Bounds Beyond Two-Party Communication. | Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang |
| 2025 | FOCS | Constant Rate Codes for Adaptive Broadcasts Do Not Exist. | Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena |
| 2024 | STOC | Optimal Multi-pass Lower Bounds for MST in Dynamic Streams. | Sepehr Assadi, Gillat Kol, Zhijun Zhang |
| 2023 | ICALP | Protecting Single-Hop Radio Networks from Message Drops. | Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena |
| 2023 | SODA | Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2023 | SODA | Interactive Coding with Small Memory. | Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena |
| 2023 | STOC | The Rate of Interactive Codes Is Bounded Away from 1. | Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena |
| 2022 | FOCS | Rounds vs Communication Tradeoffs for Maximal Independent Sets. | Sepehr Assadi, Gillat Kol, Zhijun Zhang |
| 2022 | FOCS | Binary Codes with Resilience Beyond 1/4 via Interaction. | Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang |
| 2022 | SODA | Distributed Zero-Knowledge Proofs Over Networks. | Aviv Bick, Gillat Kol, Rotem Oshman |
| 2022 | STOC | Circuits resilient to short-circuit errors. | Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena |
| 2021 | COLT | Near Optimal Distributed Learning of Halfspaces with Two Parties. | Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena |
| 2021 | FOCS | Statistically Near-Optimal Hypothesis Selection. | Olivier Bousquet, Mark Braverman, Gillat Kol, Klim Efremenko, Shay Moran |
| 2021 | FOCS | Tight Bounds for General Computation in Noisy Broadcast Networks. | Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena |
| 2021 | ICALP | Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2021 | STOC | Almost optimal super-constant-pass streaming lower bounds for reachability. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2021 | STOC | Optimal error resilience of adaptive message exchange. | Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena |
| 2020 | FOCS | Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. | Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu |
| 2020 | FOCS | Binary Interactive Error Resilience Beyond ${{}^{1}}\!/\!_{8}$ (or why $({{}^{1}}\!/\!_{2})^{3} > {{}^{1}}\!/\!_{8})$. | Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena |
| 2020 | PODC | Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. | Sepehr Assadi, Gillat Kol, Rotem Oshman |
| 2020 | PODC | Noisy Beeps. | Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena |
| 2020 | STOC | Interactive error resilience beyond 2/7. | Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena |
| 2019 | FOCS | Radio Network Coding Requires Logarithmic Overhead. | Klim Efremenko, Gillat Kol, Raghuvansh Saxena |
| 2018 | PODC | Interactive Distributed Proofs. | Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena |
| 2018 | STOC | Interactive compression to external information. | Mark Braverman, Gillat Kol |
| 2018 | STOC | Interactive coding over the noisy broadcast channel. | Klim Efremenko, Gillat Kol, Raghuvansh Saxena |
| 2017 | STOC | Time-space hardness of learning sparse parities. | Gillat Kol, Ran Raz, Avishay Tal |
| 2016 | SODA | Towards Optimal Deterministic Coding for Interactive Communication. | Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson |
| 2016 | STOC | Exponential separation of communication and external information. | Anat Ganor, Gillat Kol, Ran Raz |
| 2016 | STOC | Interactive compression for product distributions. | Gillat Kol |
| 2015 | STOC | Exponential Separation of Information and Communication for Boolean Functions. | Anat Ganor, Gillat Kol, Ran Raz |
| 2014 | FOCS | Exponential Separation of Information and Communication. | Anat Ganor, Gillat Kol, Ran Raz |
| 2014 | ICALP | Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound. | Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff |
| 2013 | STOC | Interactive channel capacity. | Gillat Kol, Ran Raz |
| 2008 | STOC | Games for exchanging information. | Gillat Kol, Moni Naor |
| 2008 | TCC | Cryptography and Game Theory: Designing Protocols for Exchanging Information. | Gillat Kol, Moni Naor |