Alexander A. Sherstov, “The unbounded-error communication complexity of symmetric functions”, Combinatorica, 2011
Alexander A. Sherstov, “The Pattern Matrix Method”, SIAM J. Comput, 40:6 (2011), 1969
M. V. Shaleev, A. V. Novikov, N. A. Baydakova, A. N. Yablonskiy, O. A. Kuznetsov, D. N. Lobanov, Z. F. Krasilnik, “Photoluminescence line width of self-assembled Ge(Si) islands arranged between strained Si layers”, Semiconductors, 45:2 (2011), 198
Shengyu Zhang, Lecture Notes in Computer Science, 6755, Automata, Languages and Programming, 2011, 49
Hartmut Klauck, 2011 IEEE 26th Annual Conference on Computational Complexity, 2011, 189
Alexander A. Razborov, An Invitation to Mathematics, 2011, 97
Buhrman H., Cleve R., Massar S., de Wolf R., “Nonlocality and communication complexity”, Reviews of Modern Physics, 82:1 (2010), 665–698
Sherstov A.A., “On quantum-classical equivalence for composed communication problems”, Quantum Information & Computation, 10:5-6 (2010), 435–455
Klivans A.R., Sherstov A.A., “Lower Bounds for Agnostic Learning via Approximate Rank”, Computational Complexity, 19:4 (2010), 581–604
Marc Kaplan, Sophie Laplante, “Kolmogorov complexity and combinatorial methods in communication complexity”, Theoretical Computer Science, 2010