Montanaro A., Nishimura H., Raymond R., “Unbounded-Error Quantum Query Complexity”, Algorithms and Computation, Proceedings, Lecture Notes in Computer Science, 5369, 2008, 919–930
Aaronson S., “The Polynomial Method in Quantum and Classical Computing”, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, Annual IEEE Symposium on Foundations of Computer Science, 2008, 3–3
Sherstov A.A., “The Unbounded-Error Communication Complexity of Symmetric Functions”, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, Annual IEEE Symposium on Foundations of Computer Science, 2008, 384–393
David M., Pitassi T., Viola E., “Improved Separations between Nondeterministic and Randomized Multiparty Communication”, Approximation Randomization and Combinatorial Optimization: Algorithms and Techniques, Proceedings, Lecture Notes in Computer Science, 5171, 2008, 371–384
Lee T., Shraibman A., “Disjointness is hard in the multi-party number-on-the-forehead model”, Twenty-Third Annual IEEE Conference on Computational Complexity, Proceedings, Annual IEEE Conference on Computational Complexity, 2008, 81–91
Sherstov A.A., “Approximate inclusion-exclusion for arbitrary symmetric functions”, Twenty-Third Annual IEEE Conference on Computational Complexity, Proceedings, Annual IEEE Conference on Computational Complexity, 2008, 112–123
Tani S., Nakanishi M., Yamashita Sh., “Multi-party quantum communication complexity with routed messages”, Computing and Combinatorics, Proceedings, Lecture Notes in Computer Science, 5092, 2008, 180–190
Scott Aaronson, Avi Wigderson, Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, 731
Andris Ambainis, Encyclopedia of Algorithms, 2008, 696
Avraham Ben-Aroya, Oded Regev, Ronald de Wolf, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, 477