I agree that this site is using cookies. You can find further informations here.
X
Kol, Gillat
49  results:
Search for persons X
?
1

Rounds vs. Communication Tradeoffs for Maximal Independent ..:

Assadi, Sepehr ; Kol, Gillat ; Zhang, Zhijun
SIAM Journal on Computing.  , 2024
Link: https://doi.org/10.1137/..
 
?
2

Optimal Multi-pass Lower Bounds for MST in Dynamic Streams:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Assadi, Sepehr ; Kol, Gillat ; Zhang, Zhijun - p. 835-846 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

The Rate of Interactive Codes Is Bounded Away from 1:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Efremenko, Klim ; Kol, Gillat ; Paramonov, Dmitry. - p. 1424-1437 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

Statistically Near-Optimal Hypothesis Selection:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Bousquet, Olivier ; Braverman, Mark ; Kol, Gillat.. - p. 909-919 , 2022
Link: https://doi.org/10.1109/..
 
?
5

Binary Codes with Resilience Beyond 1/4 via Interaction:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Efremenko, Klim ; Kol, Gillat ; Saxena, Raghuvansh R.. - p. 1-12 , 2022
Link: https://doi.org/10.1109/..
 
?
6

Circuits resilient to short-circuit errors:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Efremenko, Klim ; Haeupler, Bernhard ; Kalai, Yael Tauman... - p. 582-594 , 2022
Link: https://dl.acm.org/doi/1..
 
?
7

Rounds vs Communication Tradeoffs for Maximal Independent S..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Assadi, Sepehr ; Kol, Gillat ; Zhang, Zhijun - p. 1193-1204 , 2022
Link: https://doi.org/10.1109/..
 
?
8

Tight Bounds for General Computation in Noisy Broadcast Net..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Efremenko, Klim ; Kol, Gillat ; Paramonov, Dmitry. - p. 634-645 , 2022
Link: https://doi.org/10.1109/..
 
?
9

Almost optimal super-constant-pass streaming lower bounds f..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Chen, Lijie ; Kol, Gillat ; Paramonov, Dmitry... - p. 570-583 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

Optimal error resilience of adaptive message exchange:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Efremenko, Klim ; Kol, Gillat ; Saxena, Raghuvansh R. - p. 1235-1247 , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Interactive error resilience beyond 2/7:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Efremenko, Klim ; Kol, Gillat ; Saxena, Raghuvansh R. - p. 565-578 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

Binary Interactive Error Resilience Beyond ${{}^{1}}\!/\!_{..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Efremenko, Klim ; Kol, Gillat ; Saxena, Raghuvansh R. - p. 470-481 , 2020
Link: https://doi.org/10.1109/..
 
?
13

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting,..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Assadi, Sepehr ; Kol, Gillat ; Saxena, Raghuvansh R.. - p. 354-364 , 2020
Link: https://doi.org/10.1109/..
 
?
14

Noisy Beeps:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,
Efremenko, Klim ; Kol, Gillat ; Saxena, Raghuvansh R. - p. 418-427 , 2020
Link: https://dl.acm.org/doi/1..
 
?
15

Lower Bounds for Distributed Sketching of Maximal Matchings..:

, In: Proceedings of the 39th Symposium on Principles of Distributed Computing,
Assadi, Sepehr ; Kol, Gillat ; Oshman, Rotem - p. 79-88 , 2020
Link: https://dl.acm.org/doi/1..
 
1-15