Author:
Franklin Matthew,Gelles Ran,Ostrovsky Rafail,Schulman Leonard J.
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Bonsall, C.: The case of the hungry stranger. HarperCollins (1963)
2. Brakerski, Z., Kalai, Y.T.: Efficient interactive coding against adversarial noise. In: IEEE Annual Symposium on Foundations of Computer Science, pp. 160–166 (2012)
3. Brakerski, Z., Naor, M.: Fast algorithms for interactive coding. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, pp. 443–456 (2013)
4. Braverman, M.: Towards deterministic tree code constructions. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 161–167. ACM (2012)
5. Braverman, M., Rao, A.: Towards coding for maximum errors in interactive communication. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 159–166. ACM, New York (2011)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献