Shi Yaoyun, Zhu Yufan, “Quantum communication complexity of block-composed functions”, Quantum Inf. Comput., 9:5-6 (2009), 444–460
Zhang Sh., “On the Tightness of the Buhrman-Cleve-Wigderson Simulation”, Algorithms and Computation, Proceedings, Lecture Notes in Computer Science, 5878, 2009, 434–440
Lee T., Schechtman G., Shraibman A., “Lower bounds on quantum multiparty communication complexity”, Proceedings of the 24th Annual IEEE Conference on Computational Complexity, Annual IEEE Conference on Computational Complexity, 2009, 254–262
Lee T., Shraibman A., “An approximation algorithm for approximation rank”, Proceedings of the 24th Annual IEEE Conference on Computational Complexity, Annual IEEE Conference on Computational Complexity, 2009, 351–357
Kaplan M., Laplante S., “Kolmogorov Complexity and Combinatorial Methods in Communication Complexity”, Theory and Applications of Models of Computation, Lecture Notes in Computer Science, 5532, 2009, 261–270
Scott Aaronson, Avi Wigderson, “Algebrization”, ACM Trans. Comput. Theory, 1:1 (2009), 1
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