default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGillat Kol
Person information
SPARQL queries 
🛈 Please note that only 56% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c46]Mark Braverman, Klim Efremenko
, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang:
Round-Vs-Resilience Tradeoffs for Binary Feedback Channels. ITCS 2025: 22:1-22:23- [i40]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh Saxena:
Information Dissemination via Broadcasts in the Presence of Adversarial Noise. Electron. Colloquium Comput. Complex. TR25 (2025) - 2024
- [c45]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh R. Saxena:
Information Dissemination via Broadcasts in the Presence of Adversarial Noise. CCC 2024: 19:1-19:33 - [c44]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Optimal Multi-pass Lower Bounds for MST in Dynamic Streams. STOC 2024: 835-846 - [i39]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena:
The Rate of Interactive Codes is Bounded Away from 1. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c43]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena:
Protecting Single-Hop Radio Networks from Message Drops. ICALP 2023: 53:1-53:20 - [c42]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena:
Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds. ITCS 2023: 46:1-46:20 - [c41]Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Huacheng Yu:
Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly. ITCS 2023: 80:1-80:15 - [c40]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. SODA 2023: 878-924 - [c39]Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena:
Interactive Coding with Small Memory. SODA 2023: 3587-3613 - [c38]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena:
The Rate of Interactive Codes Is Bounded Away from 1. STOC 2023: 1424-1437 - [i38]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams. CoRR abs/2312.04674 (2023) - [i37]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams. Electron. Colloquium Comput. Complex. TR23 (2023) - [i36]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena:
Protecting Single-Hop Radio Networks from Message Drops. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c37]Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang:
Binary Codes with Resilience Beyond 1/4 via Interaction. FOCS 2022: 1-12 - [c36]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs Communication Tradeoffs for Maximal Independent Sets. FOCS 2022: 1193-1204 - [c35]Aviv Bick, Gillat Kol, Rotem Oshman:
Distributed Zero-Knowledge Proofs Over Networks. SODA 2022: 2426-2458 - [c34]Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena:
Circuits resilient to short-circuit errors. STOC 2022: 582-594 - [i35]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs Communication Tradeoffs for Maximal Independent Sets. CoRR abs/2209.09049 (2022) - [i34]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. Electron. Colloquium Comput. Complex. TR22 (2022) - [i33]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs Communication Tradeoffs for Maximal Independent Sets. Electron. Colloquium Comput. Complex. TR22 (2022) - [i32]Mark Braverman, Klim Efremenko, Gillat Kol, Raghuvansh Saxena, Zhijun Zhang:
Round-vs-Resilience Tradeoffs for Binary Feedback Channels. Electron. Colloquium Comput. Complex. TR22 (2022) - [i31]Klim Efremenko, Bernhard Haeupler, Yael Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh Saxena:
Circuits Resilient to Short-Circuit Errors. Electron. Colloquium Comput. Complex. TR22 (2022) - [i30]Klim Efremenko, Bernhard Haeupler, Gillat Kol, Nicolas Resch, Raghuvansh Saxena, Yael Tauman Kalai:
Interactive Coding with Small Memory. Electron. Colloquium Comput. Complex. TR22 (2022) - [i29]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena:
Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds. Electron. Colloquium Comput. Complex. TR22 (2022) - [i28]Klim Efremenko, Gillat Kol, Raghuvansh Saxena, Zhijun Zhang:
Binary Codes with Resilience Beyond 1/4 via Interaction. Electron. Colloquium Comput. Complex. TR22 (2022) - [i27]Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Huacheng Yu:
Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j7]Anat Ganor, Gillat Kol, Ran Raz:
Exponential Separation of Communication and External Information. SIAM J. Comput. 50(3) (2021) - [c33]Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena:
Near Optimal Distributed Learning of Halfspaces with Two Parties. COLT 2021: 724-758 - [c32]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena:
Tight Bounds for General Computation in Noisy Broadcast Networks. FOCS 2021: 634-645 - [c31]Olivier Bousquet, Mark Braverman, Gillat Kol, Klim Efremenko, Shay Moran:
Statistically Near-Optimal Hypothesis Selection. FOCS 2021: 909-919 - [c30]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. ICALP 2021: 52:1-52:19 - [c29]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena:
Computation over the Noisy Broadcast Channel with Malicious Parties. ITCS 2021: 82:1-82:19 - [c28]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Almost optimal super-constant-pass streaming lower bounds for reachability. STOC 2021: 570-583 - [c27]Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena:
Optimal error resilience of adaptive message exchange. STOC 2021: 1235-1247 - [i26]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. CoRR abs/2102.11251 (2021) - [i25]Olivier Bousquet, Mark Braverman, Klim Efremenko, Gillat Kol, Shay Moran:
Statistically Near-Optimal Hypothesis Selection. CoRR abs/2108.07880 (2021) - [i24]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability. Electron. Colloquium Comput. Complex. TR21 (2021) - [i23]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena:
Computation Over the Noisy Broadcast Channel with Malicious Parties. Electron. Colloquium Comput. Complex. TR21 (2021) - [i22]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena:
Tight Bounds for General Computation in Noisy Broadcast Networks. Electron. Colloquium Comput. Complex. TR21 (2021) - [i21]Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Binary Interactive Error Resilience Beyond $1/8$ (or why $(1/2)^3 > 1/8$). Electron. Colloquium Comput. Complex. TR21 (2021) - [i20]Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Optimal Error Resilience of Adaptive Message Exchange. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c26]Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu:
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. FOCS 2020: 354-364 - [c25]Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena:
Binary Interactive Error Resilience Beyond ${{}^{1}}\!/\!_{8}$ (or why $({{}^{1}}\!/\!_{2})^{3} > {{}^{1}}\!/\!_{8})$. FOCS 2020: 470-481 - [c24]Sepehr Assadi, Gillat Kol, Rotem Oshman:
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. PODC 2020: 79-88 - [c23]Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena:
Noisy Beeps. PODC 2020: 418-427 - [c22]Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena:
Interactive error resilience beyond 2/7. STOC 2020: 565-578 - [i19]Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu:
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. CoRR abs/2009.03038 (2020) - [i18]Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Interactive Error Resilience Beyond 2/7. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j6]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound. Comput. Complex. 28(1): 1-25 (2019) - [c21]Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Radio Network Coding Requires Logarithmic Overhead. FOCS 2019: 348-369 - [c20]Mark Braverman, Gillat Kol, Rotem Oshman, Avishay Tal:
On the Computational Power of Radio Channels. DISC 2019: 8:1-8:17 - [i17]Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena:
Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility. CoRR abs/1909.03547 (2019) - [i16]Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Noisy Beeps. Electron. Colloquium Comput. Complex. TR19 (2019) - [i15]Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Radio Network Coding Requires Logarithmic Overhead. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j5]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Explicit Capacity Approaching Coding for Interactive Communication. IEEE Trans. Inf. Theory 64(10): 6546-6560 (2018) - [c19]Mark Braverman, Anat Ganor, Gillat Kol, Ran Raz:
A Candidate for a Strong Separation of Information and Communication. ITCS 2018: 11:1-11:13 - [c18]Gillat Kol, Rotem Oshman, Raghuvansh R. Saxena:
Interactive Distributed Proofs. PODC 2018: 255-264 - [c17]Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Interactive coding over the noisy broadcast channel. STOC 2018: 507-520 - [c16]Mark Braverman, Gillat Kol:
Interactive compression to external information. STOC 2018: 964-977 - 2017
- [c15]Gillat Kol, Ran Raz, Avishay Tal:
Time-space hardness of learning sparse parities. STOC 2017: 1067-1080 - [c14]Gillat Kol, Rotem Oshman, Dafna Sadeh:
Interactive Compression for Multi-Party Protocol. DISC 2017: 31:1-31:15 - [i14]Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Interactive Coding Over the Noisy Broadcast Channel. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j4]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Direct Sum Fails for Zero-Error Average Communication. Algorithmica 76(3): 782-795 (2016) - [j3]Gillat Kol, Ran Raz:
Bounds on 2-query Locally Testable Codes with affine tests. Inf. Process. Lett. 116(8): 521-525 (2016) - [j2]Anat Ganor, Gillat Kol, Ran Raz:
Exponential Separation of Information and Communication for Boolean Functions. J. ACM 63(5): 46:1-46:31 (2016) - [c13]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. SODA 2016: 1922-1936 - [c12]Anat Ganor, Gillat Kol, Ran Raz:
Exponential separation of communication and external information. STOC 2016: 977-986 - [c11]Gillat Kol:
Interactive compression for product distributions. STOC 2016: 987-998 - [i13]Gillat Kol, Ran Raz, Avishay Tal:
Time-Space Hardness of Learning Sparse Parities. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c10]Anat Ganor, Gillat Kol, Ran Raz:
Exponential Separation of Information and Communication for Boolean Functions. STOC 2015: 557-566 - [i12]Anat Ganor, Gillat Kol, Ran Raz:
Exponential Separation of Communication and External Information. Electron. Colloquium Comput. Complex. TR15 (2015) - [i11]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. Electron. Colloquium Comput. Complex. TR15 (2015) - [i10]Gillat Kol:
Interactive Compression for Product Distributions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j1]Gillat Kol, Ran Raz:
Competing-Provers Protocols for Circuit Evaluation. Theory Comput. 10: 107-131 (2014) - [c9]Anat Ganor, Gillat Kol, Ran Raz:
Exponential Separation of Information and Communication. FOCS 2014: 176-185 - [c8]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound. ICALP (1) 2014: 701-712 - [c7]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Direct sum fails for zero error average communication. ITCS 2014: 517-522 - [i9]Anat Ganor, Gillat Kol, Ran Raz:
Exponential Separation of Information and Communication. Electron. Colloquium Comput. Complex. TR14 (2014) - [i8]Anat Ganor, Gillat Kol, Ran Raz:
Exponential Separation of Information and Communication for Boolean Functions. Electron. Colloquium Comput. Complex. TR14 (2014) - [i7]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c6]Irit Dinur, Gillat Kol:
Covering CSPs. CCC 2013: 207-218 - [c5]Gillat Kol, Ran Raz:
Competing provers protocols for circuit evaluation. ITCS 2013: 473-484 - [c4]Gillat Kol, Ran Raz:
Interactive channel capacity. STOC 2013: 715-724 - [i6]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Direct Sum Fails for Zero Error Average Communication. Electron. Colloquium Comput. Complex. TR13 (2013) - [i5]Gillat Kol, Ran Raz:
Interactive Channel Capacity. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c3]Gillat Kol, Ran Raz:
Bounds on locally testable codes with unique tests. ITCS 2012: 190-202 - [i4]Irit Dinur, Gillat Kol:
Covering CSPs. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i3]Gillat Kol, Ran Raz:
Competing Provers Protocols for Circuit Evaluation. Electron. Colloquium Comput. Complex. TR11 (2011)
2000 – 2009
- 2009
- [i2]Gillat Kol, Ran Raz:
Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist. Electron. Colloquium Comput. Complex. TR09 (2009) - [i1]Gillat Kol, Ran Raz:
Bounds on 2-Query Locally Testable Codes with Affine Tests. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c2]Gillat Kol, Moni Naor:
Games for exchanging information. STOC 2008: 423-432 - [c1]Gillat Kol, Moni Naor:
Cryptography and Game Theory: Designing Protocols for Exchanging Information. TCC 2008: 320-339
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-01 00:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
