1. Aaronson, S.: Limitations of quantum advice and one-way communication. In: Proceedings of the 19th IEEE Conference on Computational Complexity, pp. 320–332 (2004)
2. Aaronson, S.: QMA/qpoly
$$\subseteq $$
pspace/poly: de-merlinizing quantum protocols. In: Proceedings of 21st IEEE Conference on Computational Complexity (2006)
3. Ambainis, A.: Communication complexity in a 3-computer model. Algorithmica 16(3), 298–301 (1996)
4. Babai, L., Kimmel, P.: Randomized simultaneous messages: solution of a problem of yao in communication complexity. In: Proceedings of the 12th Annual IEEE Conference on Computational Complexity, p. 239 (1997)
5. Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum Fingerprinting. Phys. Rev. Lett. 87(16), 167902 (2001)