Using Java to design and test hardware circuits over a classroom network. - Michael J. Jipping; Steve Marlowe; Alexander A. Sherstov (SIGCSE, 2002)

Distributed visualization of graph algorithms. - Alexander A. Sherstov (SIGCSE, 2003)

Three Automated Stock-Trading Agents: A Comparative Study. - Alexander A. Sherstov; Peter Stone 001 (AMEC, 2004)

Improving Action Selection in MDP's via Knowledge Transfer. - Alexander A. Sherstov; Peter Stone 001 (AAAI, 2005)

Function Approximation via Tile Coding: Automating Parameter Choice. - Alexander A. Sherstov; Peter Stone 001 (SARA, 2005)

Improved Lower Bounds for Learning Intersections of Halfspaces. - Adam R. Klivans; Alexander A. Sherstov (COLT, 2006)

Cryptographic Hardness Results for Learning Intersections of Halfspaces. - Adam R. Klivans; Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2006)

A Lower Bound for Agnostically Learning Disjunctions. - Adam R. Klivans; Alexander A. Sherstov (COLT, 2007)

Separating AC0 from depth-2 majority circuits. - Alexander A. Sherstov (STOC, 2007)

The Pattern Matrix Method for Lower Bounds on Quantum Communication. - Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2007)

Unbounded-Error Communication Complexity of Symmetric Functions. - Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2007)

Powering requires threshold depth 3. - Alexander A. Sherstov (Inf. Process. Lett., 2007)

Unconditional lower bounds for learning intersections of halfspaces. - Adam R. Klivans; Alexander A. Sherstov (Mach. Learn., 2007)

The Sign-Rank of AC^O. - Alexander A. Razborov; Alexander A. Sherstov (FOCS, 2008)

Halfspace Matrices. - Alexander A. Sherstov (Comput. Complex., 2008)

The Sign-Rank of AC^0. - Alexander A. Razborov; Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2008)

Communication Lower Bounds Using Dual Polynomials. - Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2008)

Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions. - Alexander A. Sherstov (Comput. Complex., 2009)

The Pattern Matrix Method (Journal Version) - Alexander A. Sherstov (CoRR, 2009)

Cryptographic hardness for learning intersections of halfspaces. - Adam R. Klivans; Alexander A. Sherstov (J. Comput. Syst. Sci., 2009)

SeparatingAC0 from Depth-2 Majority Circuits. - Alexander A. Sherstov (SIAM J. Comput., 2009)

Lower Bounds for Agnostic Learning via Approximate Rank. - Adam R. Klivans; Alexander A. Sherstov (Comput. Complex., 2010)

Communication Complexity Under Product and Nonproduct Distributions. - Alexander A. Sherstov (Comput. Complex., 2010)

A Separation of NP and coNP in Multiparty Communication Complexity. - Dmitry Gavinsky; Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2010)

Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. - Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2010)

On quantum-classical equivalence for composed communication problems. - Alexander A. Sherstov (Quantum Inf. Comput., 2010)

The Sign-Rank of AC0. - Alexander A. Razborov; Alexander A. Sherstov (SIAM J. Comput., 2010)

The Communication Complexity of Gap Hamming Distance. - Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2011)

The Pattern Matrix Method. - Alexander A. Sherstov (SIAM J. Comput., 2011)

Making Polynomials Robust to Noise. - Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2012)

Strong Direct Product Theorems for Quantum Communication and Query Complexity. - Alexander A. Sherstov (SIAM J. Comput., 2012)

Communication Lower Bounds Using Directional Derivatives. - Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2013)

Approximating the AND-OR Tree. - Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2013)

The Intersection of Two Halfspaces Has High Threshold Degree. - Alexander A. Sherstov (SIAM J. Comput., 2013)

Communication Complexity Theory: Thirty-Five Years of Set Disjointness. - Alexander A. Sherstov (MFCS (1), 2014)

Bounded-Communication Leakage Resilience via Parity-Resilient Circuits. - Vipul Goyal; Yuval Ishai; Hemanta K. Maji; Amit Sahai; Alexander A. Sherstov (FOCS, 2016)

On multiparty communication with large versus unbounded error. - Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2016)

The Multiparty Communication Complexity of Set Disjointness. - Alexander A. Sherstov (SIAM J. Comput., 2016)

Inner Product and Set Disjointness: Beyond Logarithmically Many Parties. - Vladimir V. Podolskii; Alexander A. Sherstov (Electron. Colloquium Comput. Complex., 2017)

Optimal Interactive Coding for Insertions, Deletions, and Substitutions. - Alexander A. Sherstov; Pei Wu (Electron. Colloquium Comput. Complex., 2017)

Compressing Interactive Communication Under Product Distributions. - Alexander A. Sherstov (SIAM J. Comput., 2018)

Breaking the Minsky-Papert Barrier for Constant-Depth Circuits. - Alexander A. Sherstov (SIAM J. Comput., 2018)

The Power of Asymmetry in Constant-Depth Circuits. - Alexander A. Sherstov (SIAM J. Comput., 2018)

Near-optimal lower bounds on the threshold degree and sign-rank of AC0. - Alexander A. Sherstov; Pei Wu (STOC, 2019)

Vanishing-Error Approximate Degree and QMA Complexity. - Alexander A. Sherstov; Justin Thaler (Electron. Colloquium Comput. Complex., 2019)

Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$. - Alexander A. Sherstov; Pei Wu (SIAM J. Comput., 2019)

Algorithmic Polynomials. - Alexander A. Sherstov (SIAM J. Comput., 2020)

The hardest halfspace. - Alexander A. Sherstov (Comput. Complex., 2021)

Quantum communication complexity of distribution testing. - Aleksandrs Belovs; Arturo Castellanos 002; Francois Le Gall; Guillaume Malod; Alexander A. Sherstov (Quantum Inf. Comput., 2021)

An Optimal Separation of Randomized and Quantum Query Complexity. - Alexander A. Sherstov; Andrey A. Storozhenko; Pei Wu (SIAM J. Comput., 2023)

The Communication Complexity of Approximating Matrix Rank. - Alexander A. Sherstov; Andrey A. Storozhenko (Electron. Colloquium Comput. Complex., 2024)

The Approximate Degree of DNF and CNF Formulas. - Alexander A. Sherstov (SIAM J. Comput., 2025)