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
Shengyu Zhang, “On the power of Ambainis lower bounds”, Theoretical Computer Science, 339:2-3 (2005), 241
Klauck H., “Quantum and approximate privacy”, Theory Comput. Syst., 37:1 (2004), 221–246
Lowe B., Piwinger B., Rasch T., “Classical and New Paradigms of Computation and Their Complexity Hierarchies - Papers of the Conference “Foundations of the Formal Sciences III” - Preface”, Classical and New Paradigms of Computation and their Complexity Hierarchies, Trends in Logic - Studia Logica Library, 23, 2004, VII
Ran Raz, A. Shpilka, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004., 2004, 260
A. Ambainis, Ke Yang, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004., 2004, 305
H. Klauck, R. Spalek, R. de Wolf, 45th Annual IEEE Symposium on Foundations of Computer Science, 2004, 12
Ambainis A., Schulman L.J., Ta-Shma A., Vazirani U., Wigderson A., “The quantum communication complexity of sampling”, SIAM J. Comput., 32:6 (2003), 1570–1585
Buhrman H., Rohrig H., “Distributed quantum computing”, Mathematical foundations of computer science, Lecture Notes in Comput. Sci., 2747, Springer, Berlin, 2003, 1–20