Publisher
Springer International Publishing
Reference11 articles.
1. Bauer, B., Moran, S., Yehudayoff, A.: Internal compression of protocols to entropy
2. Lecture Notes in Computer Science;M Braverman,2014
3. Braverman, M., Rao, A.: Information equals amortized communication. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 748–757. IEEE (2011)
4. Brody, J., Buhrman, H., Koucky, M., Loff, B., Speelman, F., Vereshchagin, N.: Towards a reverse newman’s theorem in interactive information complexity. In: 2013 IEEE Conference on Computational Complexity (CCC), pp. 24–33. IEEE (2013)
5. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (2006)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献