Games for exchanging information. - Gillat Kol; Moni Naor (STOC, 2008)

Cryptography and Game Theory: Designing Protocols for Exchanging Information. - Gillat Kol; Moni Naor (TCC, 2008)

Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist. - Gillat Kol; Ran Raz (Electron. Colloquium Comput. Complex., 2009)

Competing Provers Protocols for Circuit Evaluation. - Gillat Kol; Ran Raz (Electron. Colloquium Comput. Complex., 2011)

Bounds on locally testable codes with unique tests. - Gillat Kol; Ran Raz (ITCS, 2012)

Covering CSPs. - Irit Dinur; Gillat Kol (Electron. Colloquium Comput. Complex., 2012)

Direct Sum Fails for Zero Error Average Communication. - Gillat Kol; Shay Moran; Amir Shpilka; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2013)

Interactive Channel Capacity. - Gillat Kol; Ran Raz (Electron. Colloquium Comput. Complex., 2013)

Exponential Separation of Information and Communication. - Anat Ganor; Gillat Kol; Ran Raz (Electron. Colloquium Comput. Complex., 2014)

Exponential Separation of Information and Communication for Boolean Functions. - Anat Ganor; Gillat Kol; Ran Raz (Electron. Colloquium Comput. Complex., 2014)

Towards Optimal Deterministic Coding for Interactive Communication. - Ran Gelles; Bernhard Haeupler; Gillat Kol; Noga Ron-Zewi; Avi Wigderson (Electron. Colloquium Comput. Complex., 2015)

Interactive Compression for Product Distributions. - Gillat Kol (Electron. Colloquium Comput. Complex., 2015)

Time-Space Hardness of Learning Sparse Parities. - Gillat Kol; Ran Raz; Avishay Tal (Electron. Colloquium Comput. Complex., 2016)

Bounds on 2-query Locally Testable Codes with affine tests. - Gillat Kol; Ran Raz (Inf. Process. Lett., 2016)

Interactive Compression for Multi-Party Protocol. - Gillat Kol; Rotem Oshman; Dafna Sadeh (DISC, 2017)

Interactive Coding Over the Noisy Broadcast Channel. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2017)

A Candidate for a Strong Separation of Information and Communication. - Mark Braverman; Anat Ganor; Gillat Kol; Ran Raz (ITCS, 2018)

Interactive Distributed Proofs. - Gillat Kol; Rotem Oshman; Raghuvansh R. Saxena (PODC, 2018)

Interactive compression to external information. - Mark Braverman; Gillat Kol (STOC, 2018)

Explicit Capacity Approaching Coding for Interactive Communication. - Ran Gelles; Bernhard Haeupler; Gillat Kol; Noga Ron-Zewi; Avi Wigderson (IEEE Trans. Inf. Theory, 2018)

On the Computational Power of Radio Channels. - Mark Braverman; Gillat Kol; Rotem Oshman; Avishay Tal (DISC, 2019)

Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound. - Gillat Kol; Shay Moran; Amir Shpilka; Amir Yehudayoff (Comput. Complex., 2019)

Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility. - Mark Braverman; Gillat Kol; Shay Moran; Raghuvansh R. Saxena (CoRR, 2019)

Noisy Beeps. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2019)

Radio Network Coding Requires Logarithmic Overhead. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2019)

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 (FOCS, 2020)

Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. - Sepehr Assadi; Gillat Kol; Rotem Oshman (PODC, 2020)

Interactive Error Resilience Beyond 2/7. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2020)

Near Optimal Distributed Learning of Halfspaces with Two Parties. - Mark Braverman; Gillat Kol; Shay Moran; Raghuvansh R. Saxena (COLT, 2021)

Statistically Near-Optimal Hypothesis Selection. - Olivier Bousquet; Mark Braverman; Gillat Kol; Klim Efremenko; Shay Moran (FOCS, 2021)

Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. - Lijie Chen 001; Gillat Kol; Dmitry Paramonov; Raghuvansh R. Saxena; Zhao Song 002; Huacheng Yu (ICALP, 2021)

Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability. - Lijie Chen 001; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena; Zhao Song 002; Huacheng Yu (Electron. Colloquium Comput. Complex., 2021)

Computation Over the Noisy Broadcast Channel with Malicious Parties. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2021)

Tight Bounds for General Computation in Noisy Broadcast Networks. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2021)

Binary Interactive Error Resilience Beyond $1/8$ (or why $(1/2)^3 > 1/8$). - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2021)

Optimal Error Resilience of Adaptive Message Exchange. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2021)

Exponential Separation of Communication and External Information. - Anat Ganor; Gillat Kol; Ran Raz (SIAM J. Comput., 2021)

Distributed Zero-Knowledge Proofs Over Networks. - Aviv Bick; Gillat Kol; Rotem Oshman (SODA, 2022)

Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. - Lijie Chen 001; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena; Zhao Song 002; Huacheng Yu (Electron. Colloquium Comput. Complex., 2022)

Rounds vs Communication Tradeoffs for Maximal Independent Sets. - Sepehr Assadi; Gillat Kol; Zhijun Zhang 007 (Electron. Colloquium Comput. Complex., 2022)

Round-vs-Resilience Tradeoffs for Binary Feedback Channels. - Mark Braverman; Klim Efremenko; Gillat Kol; Raghuvansh Saxena; Zhijun Zhang 007 (Electron. Colloquium Comput. Complex., 2022)

Circuits Resilient to Short-Circuit Errors. - Klim Efremenko; Bernhard Haeupler; Yael Kalai; Pritish Kamath; Gillat Kol; Nicolas Resch; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2022)

Interactive Coding with Small Memory. - Klim Efremenko; Bernhard Haeupler; Gillat Kol; Nicolas Resch; Raghuvansh Saxena; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2022)

Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2022)

Binary Codes with Resilience Beyond 1/4 via Interaction. - Klim Efremenko; Gillat Kol; Raghuvansh Saxena; Zhijun Zhang 007 (Electron. Colloquium Comput. Complex., 2022)

Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly. - Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena; Huacheng Yu (Electron. Colloquium Comput. Complex., 2022)

Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams. - Sepehr Assadi; Gillat Kol; Zhijun Zhang 007 (Electron. Colloquium Comput. Complex., 2023)

Protecting Single-Hop Radio Networks from Message Drops. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2023)

The Rate of Interactive Codes is Bounded Away from 1. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2024)

Information Dissemination via Broadcasts in the Presence of Adversarial Noise. - Klim Efremenko; Gillat Kol; Dmitry Paramonov; Ran Raz; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2025)