Gillat Kol

From MaRDI portal
Person:280941

Available identifiers

zbMath Open kol.gillatMaRDI QIDQ280941

List of research outcomes





PublicationDate of PublicationType
Protecting single-hop radio networks from message drops2024-11-14Paper
Noisy radio network lower bounds via noiseless beeping lower bounds2024-09-25Paper
Characterizing the multi-pass streaming complexity for solving Boolean CSPs exactly2024-09-25Paper
Distributed zero-knowledge proofs over networks2024-07-19Paper
Towards multi-pass streaming lower bounds for optimal approximation of \textsf{Max-Cut}2024-05-14Paper
Interactive coding with small memory2024-05-14Paper
The rate of interactive codes is bounded away from 12024-05-08Paper
Circuits resilient to short-circuit errors2023-12-08Paper
Optimal error resilience of adaptive message exchange2023-11-14Paper
Almost optimal super-constant-pass streaming lower bounds for reachability2023-11-14Paper
Interactive compression for multi-party protocol2023-02-03Paper
On the computational power of radio channels2023-02-03Paper
Exponential Separation of Communication and External Information2021-06-29Paper
https://portal.mardi4nfdi.de/entity/Q49932742021-06-15Paper
Noisy Beeps2021-03-15Paper
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets2021-03-15Paper
Interactive error resilience beyond 2/72021-01-19Paper
Interactive Distributed Proofs2019-09-19Paper
Interactive coding over the noisy broadcast channel2019-08-22Paper
Interactive compression to external information2019-08-22Paper
Approximate nonnegative rank is equivalent to the smooth rectangle bound2019-06-20Paper
Explicit Capacity Approaching Coding for Interactive Communication2018-09-19Paper
Exponential Separation of Information and Communication for Boolean Functions2018-08-02Paper
Towards Optimal Deterministic Coding for Interactive Communication2018-07-16Paper
Exponential separation of communication and external information2017-09-29Paper
Interactive compression for product distributions2017-09-29Paper
Time-space hardness of learning sparse parities2017-08-17Paper
Direct sum fails for zero error average communication2017-05-19Paper
Competing provers protocols for circuit evaluation2017-05-16Paper
Direct sum fails for zero-error average communication2016-11-29Paper
Bounds on locally testable codes with unique tests2016-10-07Paper
Bounds on 2-query locally testable codes with affine tests2016-05-10Paper
Exponential Separation of Information and Communication for Boolean Functions2015-08-21Paper
https://portal.mardi4nfdi.de/entity/Q31916082014-10-06Paper
Interactive channel capacity2014-08-07Paper
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound2014-07-01Paper
https://portal.mardi4nfdi.de/entity/Q35497272009-01-05Paper
Cryptography and Game Theory: Designing Protocols for Exchanging Information2008-03-05Paper

Research outcomes over time

This page was built for person: Gillat Kol