| 2024 | FOCS | The Communication Complexity of Approximating Matrix Rank. | Alexander A. Sherstov, Andrey A. Storozhenko |
| 2022 | STOC | The approximate degree of DNF and CNF formulas. | Alexander A. Sherstov |
| 2021 | STOC | An optimal separation of randomized and Quantum query complexity. | Alexander A. Sherstov, Andrey A. Storozhenko, Pei Wu |
| 2019 | STOC | Near-optimal lower bounds on the threshold degree and sign-rank of AC | Alexander A. Sherstov, Pei Wu |
| 2018 | STOC | Algorithmic polynomials. | Alexander A. Sherstov |
| 2017 | FOCS | Optimal Interactive Coding for Insertions, Deletions, and Substitutions. | Alexander A. Sherstov, Pei Wu |
| 2016 | FOCS | Bounded-Communication Leakage Resilience via Parity-Resilient Circuits. | Vipul Goyal, Yuval Ishai, Hemanta K. Maji, Amit Sahai, Alexander A. Sherstov |
| 2016 | FOCS | Compressing Interactive Communication under Product Distributions. | Alexander A. Sherstov |
| 2015 | FOCS | The Power of Asymmetry in Constant-Depth Circuits. | Alexander A. Sherstov |
| 2014 | MFCS | Communication Complexity Theory: Thirty-Five Years of Set Disjointness. | Alexander A. Sherstov |
| 2014 | STOC | Breaking the minsky-papert barrier for constant-depth circuits. | Alexander A. Sherstov |
| 2013 | STOC | Communication lower bounds using directional derivatives. | Alexander A. Sherstov |
| 2012 | STOC | The multiparty communication complexity of set disjointness. | Alexander A. Sherstov |
| 2012 | STOC | Making polynomials robust to noise. | Alexander A. Sherstov |
| 2011 | STOC | Strong direct product theorems for quantum communication and query complexity. | Alexander A. Sherstov |
| 2010 | STOC | Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. | Alexander A. Sherstov |
| 2009 | FOCS | The Intersection of Two Halfspaces Has High Threshold Degree. | Alexander A. Sherstov |
| 2008 | FOCS | The Sign-Rank of AC^O. | Alexander A. Razborov, Alexander A. Sherstov |
| 2008 | FOCS | The Unbounded-Error Communication Complexity of Symmetric Functions. | Alexander A. Sherstov |
| 2008 | STOC | The pattern matrix method for lower bounds on quantum communication. | Alexander A. Sherstov |
| 2007 | COLT | A Lower Bound for Agnostically Learning Disjunctions. | Adam R. Klivans, Alexander A. Sherstov |
| 2007 | STOC | Separating AC | Alexander A. Sherstov |
| 2006 | COLT | Improved Lower Bounds for Learning Intersections of Halfspaces. | Adam R. Klivans, Alexander A. Sherstov |
| 2006 | FOCS | Cryptographic Hardness for Learning Intersections of Halfspaces. | Adam R. Klivans, Alexander A. Sherstov |
| 2005 | AAAI | Improving Action Selection in MDP's via Knowledge Transfer. | Alexander A. Sherstov, Peter Stone |
| 2003 | SIGCSE | Distributed visualization of graph algorithms. | Alexander A. Sherstov |
| 2002 | SIGCSE | Using Java to design and test hardware circuits over a classroom network. | Michael J. Jipping, Steve Marlowe, Alexander A. Sherstov |