default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGillat Kol
- > Home > Persons > Gillat Kol
Publications
- 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- [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 - [c38]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena:
The Rate of Interactive Codes Is Bounded Away from 1. STOC 2023: 1424-1437 - [i36]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena:
Protecting Single-Hop Radio Networks from Message Drops. Electron. Colloquium Comput. Complex. TR23 (2023) - 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) - [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) - [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
- [c32]Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena:
Tight Bounds for General Computation in Noisy Broadcast Networks. FOCS 2021: 634-645 - [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 - [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) - [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)
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 2024-08-10 01:21 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:
