Author:
Filmus Yuval,Hatami Hamed,Li Yaqiao,You Suzin
Publisher
Springer International Publishing
Reference14 articles.
1. Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication [extended abstract]. In: STOC 2010, pp. 67–76. ACM, New York (2010)
2. Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: From information to exact communication (extended abstract). In: STOC 2013, pp. 151–160. ACM, New York (2013)
3. Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: Information lower bounds via self-reducibility. Theory Comput. Syst. 59(2), 377–396 (2016)
4. Braverman, M., Rao, A.: Information equals amortized communication. IEEE Trans. Inform. Theory 60(10), 6058–6069 (2014)
5. Braverman, M., Schneider, J.: Information complexity is computable, arXiv preprint arXiv:1502.02971 (2015)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Lower Bound for Sampling Disjoint Sets;ACM Transactions on Computation Theory;2020-07-23
2. Trading Information Complexity for Error;Theory of Computing;2018