Quantum Computer Science , Quantum computing: fault-tolerance, communication, and classical spin-offs
IARCS Annual Conference on the Foundations of Software Technology and Theoretical Computer Science
Algorithms and Complexity

Ivanyos, G, Klauck, H, Lee, T. J, Santha, M, & de Wolf, R.M. (2012). New bounds on the classical and quantum communication complexity of some graph properties. In Proceedings of FSTTCS 2012 (32) (pp. 148–159). doi:10.4230/LIPIcs.FSTTCS.2012.148