About Me

I am currently a postdoc at the Institute for Advanced Study. I am broadly interested in pseudorandomness and its application to computational complexity, as well as its application to extremal combinatorics and number theory.

Publications

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka
STOC, 2024
Explicit Separations Between Randomized and Deterministic Number-on-Forehead Communication
Zander Kelley, Shachar Lovett, Raghu Meka
STOC, 2024
Strong Bounds for 3-Progressions
Zander Kelley, Raghu Meka
FOCS, 2023 (Best Paper Award)
Random Restrictions and PRGs for PTFs in Gaussian Space
Zander Kelley, Raghu Meka
CCC, 2022
An Improved Derandomization of the Switching Lemma
Zander Kelley
STOC, 2021
Pseudorandom Generators for Read-once Branching Programs, in Any Order
Michael Forbes, Zander Kelley
FOCS, 2018

Undergraduate Work

Estimating the Number of Roots of Trinomials Over Finite Fields
Zander Kelley, Sean W. Owen
Journal of Symbolic Computation, 2017
Roots of Sparse Polynomials Over a Finite Field
Zander Kelley
LMS Journal of Computation and Mathematics, 2016