Author:
Brody Joshua,Buhrman Harry,Koucký Michal,Loff Bruno,Speelman Florian,Vereshchagin Nikolay
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. In: Proceedings of the 42nd STOC, pp. 67–76 (2010)
2. Brody, J., Buhrman, H., Koucký, M., Loff, B., Speelman, F., Vereshchagin, N.: Towards a reverse Newman’s theorem in interactive information complexity. In: Proceedings of the 28th CCC, pp. 24–33 (2013)
3. Braverman, M., Garg, A.: Public vs private coin in bounded-round information. In: Proceedings of the 41st ICALP, pp. 502–513 (2014)
4. Buhrman, H., Koucký, M., Vereshchagin, N.: Randomized individual communication complexity. In: Proceedings of the 23rd CCC, pp. 321–331 (2008)
5. Bauer, B., Moran, S., Yehudayoff, A.: Internal compression of protocols to entropy. In: Proceedings of the 19th RANDOM, pp. 481–496 (2015)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams;Theory of Computing;2023
2. The Communication Complexity of Functions with Large Outputs;Structural Information and Communication Complexity;2023
3. Index;Communication Complexity;2020-01-31
4. Bibliography;Communication Complexity;2020-01-31
5. Distributed Computing;Communication Complexity;2020-01-31