Sherstov A. A., “Separating $\mathsf{AC}^0$ from depth-2 majority circuits”, SIAM J. Comput., 38:6 (2009), 2113–2129
Lee Troy, Shraibman Adi, “Disjointness is hard in the multiparty number-on-the-forehead model”, Comput. Complexity, 18:2 (2009), 309–336
Tani S., Nakanishi M., Yamashita Sh., “Multi-party quantum communication complexity with routed messages”, IEICE Transactions on Information and Systems, E92D:2 (2009), 191–199
Zhang Zhiqiang, Shi Yaoyun, “Communication complexities of symmetric XOR functions”, Quantum Inf. Comput., 9:3-4 (2009), 255–263
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