Sherstov A.A., “The Unbounded-Error Communication Complexity of Symmetric Functions”, Combinatorica, 31:5 (2011), 583–614
Jukna S., Schnitger G., “Min-Rank Conjecture for Log-Depth Circuits”, J. Comput. Syst. Sci., 77:6, SI (2011), 1023–1038
Saraf Sh., Yekhanin S., “Noisy Interpolation of Sparse Polynomials, and Applications”, 2011 IEEE 26th Annual Conference on Computational Complexity (Ccc), Annual IEEE Conference on Computational Complexity, IEEE Computer Soc, 2011, 86–92
Klivans A.R., Sherstov A.A., “Lower Bounds for Agnostic Learning via Approximate Rank”, Comput. Complex., 19:4 (2010), 581–604
Linial N., Shraibman A., “Learning complexity vs. communication complexity”, Combin. Probab. Comput., 18:1-2 (2009), 227–245
Alon N., Panigrahy R., Yakhanin S., “Deterministic Approximation Algorithms for the Nearest Codeword Problem”, Approximation, Randomization, and Combinatorial Optimization, Lecture Notes in Computer Science, 5687, eds. Dinur I., Jansen K., Naor J., Rolim J., Springer-Verlag Berlin, 2009, 339–351
Keevash P., “Shadows and intersections: stability and new proofs”, Adv. Math., 218:5 (2008), 1685–1703
Linial N., Shraibman A., “Learning Complexity Vs. Communication Complexity”, Twenty-Third Annual IEEE Conference on Computational Complexity, Proceedings, Annual IEEE Conference on Computational Complexity, IEEE Computer Soc, 2008, 53–63
Linial N., Mendelson Sh., Schechtman G., Shraibman A., “Complexity measures of sign matrices”, Combinatorica, 27:4 (2007), 439–463
Klivans A.R., Sherstov A.A., “A Lower Bound for Agnostically Learning Disjunctions”, Learning Theory, Proceedings, Lecture Notes in Computer Science, 4539, eds. Bshouty N., Gentile C., Springer-Verlag Berlin, 2007, 409–423