Zander Kelley

According to our database, Zander Kelley authored at least 9 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

More efficient sifting for grid norms, and applications to multiparty communication complexity.

Zander Kelley, Xin Lyu

CoRR, May, 2025

2024

Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication.

Zander Kelley, Shachar Lovett, Raghu Meka

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms.

Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

Strong Bounds for 3-Progressions.

Zander Kelley, Raghu Meka

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Random Restrictions and PRGs for PTFs in Gaussian Space.

Zander Kelley, Raghu Meka

Proceedings of the 37th Computational Complexity Conference, 2022

2021

An improved derandomization of the switching lemma.

Zander Kelley

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2018

Pseudorandom Generators for Read-Once Branching Programs, in Any Order.

Michael A. Forbes, Zander Kelley

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Estimating the number of roots of trinomials over finite fields.

Zander Kelley, Sean W. Owen

J. Symb. Comput., 2017

2016

Roots of sparse polynomials over a finite field.

Zander Kelley

LMS J. Comput. Math., 2016