Funder
Russian Foundation for Basic Research (RU)
President's of Russian Federation grant
Russian Academic Excellence Project
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference11 articles.
1. Bauer, B., Moran, S., Yehudayoff, A.: Internal compression of protocols to entropy. Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques, p. 481 (2015)
2. Braverman, M., Garg, A.: Public vs private coin in bounded-round information. In: Automata, Languages, and Programming, pp. 502–513. Springer (2014)
3. Braverman, M., Rao, A.: Information equals amortized communication. In: IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), 2011 , IEEE, pp. 748–757 (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: IEEE Conference on Computational Complexity (CCC), 2013, IEEE, pp. 24–33 (2013)
5. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献