1. Yao, A.C.-C.: Some complexity questions related to distributed computing. In: Proceedings of the 11th Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 209–213 (1979)
2. Huang, W., Shi, Y., Zhang, S., et al.: The communication complexity of the Hamming distance problem. Inf. Process. Lett. 99(4), 149–153 (2006)
3. Jain, R.: Communication complexity of remote state preparation with entanglement. Quantum Inf. Comput. 6(4–5), 461–464 (2006)
4. Gavinsky, D., Kempe J., Kerenidis, I., et al.: Exponential separations for one-way quantum communication complexity with applications to cryptography. In: STOC 2007: Proceedings of the 39th Annual ACM Symposium on Theory of Computing: 11–13 June 2007, San Diego, California, USA, pp. 516–525 (2007)
5. Montanaro, A.: A new exponential separation between quantum and classical one-way communication complexity. Quantum Inf. Comput. 11(7–8), 574–591 (2011)