Joshua Brody, Amit Chakrabarti, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 358
Shi Yaoyun, Zhu Yufan, “Tensor norms and the classical communication complexity of nonlocal quantum measurement”, SIAM J. Comput., 38:3 (2008), 753–766
Sherstov A.A., “The Pattern Matrix Method for Lower Bounds on Quantum Communication”, STOC'08: Proceedings of the 2008 Acm International Symposium on Theory of Computing, 2008, 85–94
Aaronson S., Wigderson A., “Algebrization: A New Barrier in Complexity Theory”, STOC'08: Proceedings of the 2008 Acm International Symposium on Theory of Computing, 2008, 731–740
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