List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Protecting single-hop radio networks from message drops | 2024-11-14 | Paper |
| Noisy radio network lower bounds via noiseless beeping lower bounds | 2024-09-25 | Paper |
| Characterizing the multi-pass streaming complexity for solving Boolean CSPs exactly | 2024-09-25 | Paper |
| Distributed zero-knowledge proofs over networks | 2024-07-19 | Paper |
| Towards multi-pass streaming lower bounds for optimal approximation of \textsf{Max-Cut} | 2024-05-14 | Paper |
| Interactive coding with small memory | 2024-05-14 | Paper |
| The rate of interactive codes is bounded away from 1 | 2024-05-08 | Paper |
| Circuits resilient to short-circuit errors Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Optimal error resilience of adaptive message exchange Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Almost optimal super-constant-pass streaming lower bounds for reachability Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Interactive compression for multi-party protocol | 2023-02-03 | Paper |
| On the computational power of radio channels | 2023-02-03 | Paper |
| Exponential separation of communication and external information SIAM Journal on Computing | 2021-06-29 | Paper |
| A candidate for a strong separation of information and communication | 2021-06-15 | Paper |
| Noisy Beeps Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Interactive error resilience beyond 2/7 Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| Interactive distributed proofs Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Interactive coding over the noisy broadcast channel Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Interactive compression to external information Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Approximate nonnegative rank is equivalent to the smooth rectangle bound Computational Complexity | 2019-06-20 | Paper |
| Explicit Capacity Approaching Coding for Interactive Communication IEEE Transactions on Information Theory | 2018-09-19 | Paper |
| Exponential separation of information and communication for Boolean functions Journal of the ACM | 2018-08-02 | Paper |
| Towards optimal deterministic coding for interactive communication Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Exponential separation of communication and external information Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Interactive compression for product distributions Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Time-space hardness of learning sparse parities Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Direct sum fails for zero error average communication Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
| Competing provers protocols for circuit evaluation Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
| Direct sum fails for zero-error average communication Algorithmica | 2016-11-29 | Paper |
| Bounds on locally testable codes with unique tests Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
| Bounds on 2-query locally testable codes with affine tests Information Processing Letters | 2016-05-10 | Paper |
| Exponential Separation of Information and Communication for Boolean Functions Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| Competing-provers protocols for circuit evaluation Theory of Computing | 2014-10-06 | Paper |
| Interactive channel capacity Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
| Approximate nonnegative rank is equivalent to the smooth rectangle bound Automata, Languages, and Programming | 2014-07-01 | Paper |
| scientific article; zbMATH DE number 5485554 (Why is no real title available?) | 2009-01-05 | Paper |
| Cryptography and Game Theory: Designing Protocols for Exchanging Information Theory of Cryptography | 2008-03-05 | Paper |
Research outcomes over time
This page was built for person: Gillat Kol
