Hartmut Klauck, Robert Špalek, Ronald de Wolf, “Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs”, SIAM J. Comput., 36:5 (2007), 1472
Hartmut Klauck, “Lower Bounds for Quantum Communication Complexity”, SIAM J. Comput., 37:1 (2007), 20
Adam R. Klivans, Alexander A. Sherstov, Lecture Notes in Computer Science, 4539, Learning Theory, 2007, 409
Rusins Freivalds, Liva Garkaje, 37th International Symposium on Multiple-Valued Logic (ISMVL'07), 2007, 17
Harry Buhrman, Nikolay Vereshchagin, Ronald de Wolf, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007, 24
Huang Wei, Shi Yaoyun, Zhang Shengyu, Zhu Yufan, “The communication complexity of the Hamming distance problem”, Inform. Process. Lett., 99:4 (2006), 149–153
Nayak A., Salzman J., “Limits on the ability of quantum states to convey classical messages”, J. ACM, 53:1 (2006), 184–206
François Le Gall, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, 2006, 67
D. Gavinsky, J. Kempe, R. de Wolf, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006, 288
Zhang Shengyu, “Promised and distributed quantum search”, Computing and combinatorics, Lecture Notes in Comput. Sci., 3595, Springer, Berlin, 2005, 430–439