1. Adaptive protocols for interactive communication
2. A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
3. Towards coding for maximum errors in interactive communication
4. Gil Cohen and Shahar Samocha. 2019. Capacity-Approaching Deterministic Interactive Coding Schemes Against Adversarial Errors. Electronic Colloquium on Computational Complexity: ECCC 147. Gil Cohen and Shahar Samocha. 2019. Capacity-Approaching Deterministic Interactive Coding Schemes Against Adversarial Errors. Electronic Colloquium on Computational Complexity: ECCC 147.
5. Klim Efremenko , Elad Haramaty , and Yael Tauman Kalai . 2020 . Interactive Coding with Constant Round and Communication Blowup. In Innovations in Theoretical Computer Science Conference (ITCS), Thomas Vidick (Ed.). 151 , 7:1–7:34. Klim Efremenko, Elad Haramaty, and Yael Tauman Kalai. 2020. Interactive Coding with Constant Round and Communication Blowup. In Innovations in Theoretical Computer Science Conference (ITCS), Thomas Vidick (Ed.). 151, 7:1–7:34.