Roots of sparse polynomials over a finite field. - Zander Kelley (LMS J. Comput. Math., 2016)

Estimating the number of roots of trinomials over finite fields. - Zander Kelley; Sean W. Owen (J. Symb. Comput., 2017)

Pseudorandom Generators for Read-Once Branching Programs, in any Order. - Michael A. Forbes 001; Zander Kelley (Electron. Colloquium Comput. Complex., 2018)

An Improved Derandomization of the Switching Lemma. - Zander Kelley (Electron. Colloquium Comput. Complex., 2020)

Random restrictions and PRGs for PTFs in Gaussian Space. - Zander Kelley; Raghu Meka (Electron. Colloquium Comput. Complex., 2021)

Strong Bounds for 3-Progressions. - Zander Kelley; Raghu Meka (FOCS, 2023)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. - Amir Abboud; Nick Fischer; Zander Kelley; Shachar Lovett; Raghu Meka (Electron. Colloquium Comput. Complex., 2023)

Explicit separations between randomized and deterministic Number-on-Forehead communication. - Zander Kelley; Shachar Lovett; Raghu Meka (Electron. Colloquium Comput. Complex., 2023)

More efficient sifting for grid norms, and applications to multiparty communication complexity. - Zander Kelley; Xin Lyu (CoRR, 2025)