scientific article; zbMATH DE number 7564410
From MaRDI portal
Publication:5091761
DOI10.4230/LIPIcs.CCC.2019.10MaRDI QIDQ5091761
Mark Braverman, Ran Gelles, Klim Efremenko, Michael A. Yitayew
Publication date: 27 July 2022
Full work available at URL: https://arxiv.org/abs/1807.05014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- On the design of reliable Boolean circuits that contain partially unreliable gates
- A coding theorem for distributed computation
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
- Toward Coding for Maximum Errors in Interactive Communication
- Efficient Coding for Interactive Communication
- Coding for interactive communication
- Automata Studies. (AM-34)
- Monotone Circuits for Connectivity Require Super-Logarithmic Depth
- Sequential transmission using noiseless feedback
- Coding for Interactive Communication Correcting Insertions and Deletions
- Coding for Interactive Communication: A Survey
- Explicit Capacity Approaching Coding for Interactive Communication
- Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
- Optimal error rates for interactive coding I
- Communication with Partial Noiseless Feedback
- Interactive channel capacity
- Fast Interactive Coding against Adversarial Noise
- Optimal Coding for Streaming Authentication and Interactive Communication
This page was built for publication:
