1. Z. Bar-Yossef, T.S. Jayram, R. Kumar and D. Sivakumar, An information statistics approach to data stream and communication complexity, J. Comput. System Sci., 68 (2004), 702–732.
2. B. Barak, M. Braverman, X. Chen and A. Rao, How to compress interactive communication, SIAM J. Comput., 42 (2013), 1327–1363.
3. R. Beigel and J. Tarui, On ACC, In: 32nd Annual Symposium on Foundations of Computer Science, IEEE Computer Soc., Los Alamitos, CA, 1991, pp. 783–792.
4. M. Ben-Or, S. Goldwasser, J. Kilian and A. Wigderson, Multi-prover interactive proofs: how to remove intractability assumptions, In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, ACM, New York, NY, 1988, pp. 113–131.
5. M. Braverman, A hard-to-compress interactive task?, In: 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), IEEE Computer Soc., Los Alamitos, CA, 2013, pp. 8–12.