Zander Kelley

Generating author description...

All published works

Action	Title	Year	Authors
+	Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication	2024	Zander Kelley Shachar Lovett Raghu Meka
+	New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms	2024	Amir Abboud Nick Fischer Zander Kelley Shachar Lovett Raghu Meka
+ PDF Chat	Strong Bounds for 3-Progressions	2023	Zander Kelley Raghu Meka
+	Strong Bounds for 3-Progressions	2023	Zander Kelley Raghu Meka
+	Explicit separations between randomized and deterministic Number-on-Forehead communication	2023	Zander Kelley Shachar Lovett Raghu Meka
+	New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms	2023	Amir Abboud Nick Fischer Zander Kelley Shachar Lovett Raghu Meka
+	Random restrictions and PRGs for PTFs in Gaussian Space	2021	Zander Kelley Raghu Meka
+	Random restrictions and PRGs for PTFs in Gaussian Space.	2021	Zander Kelley Raghu Meka
+	Random restrictions and PRGs for PTFs in Gaussian Space	2021	Zander Kelley Raghu Meka
+ PDF Chat	Pseudorandom Generators for Read-Once Branching Programs, in Any Order	2018	Michael A. Forbes Zander Kelley
+	Pseudorandom Generators for Read-Once Branching Programs, in any Order	2018	Michael A. Forbes Zander Kelley
+	Pseudorandom Generators for Read-Once Branching Programs, in any Order	2018	Michael A. Forbes Zander Kelley
+	Doppelgangers: the Ur-Operation and Posets of Bounded Height	2017	Thomas Browning Max Hopkins Zander Kelley
+	Estimating the number of roots of trinomials over finite fields	2016	Zander Kelley Sean W. Owen
+ PDF Chat	Roots of sparse polynomials over a finite field	2016	Zander Kelley
+	Estimating the Number Of Roots of Trinomials over Finite Fields	2015	Zander Kelley Sean W. Owen
+	Estimating the Number Of Roots of Trinomials over Finite Fields	2015	Zander Kelley Sean W. Owen
+	Estimating the Number Of Roots of Trinomials over Finite Fields	2015	Zander Kelley Sean Owen

Common Coauthors

Coauthor	Papers Together
Raghu Meka	9
Shachar Lovett	4
Michael A. Forbes	3
Sean W. Owen	3
Amir Abboud	2
Nick Fischer	2
Thomas Browning	1
Sean Owen	1
Max Hopkins	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	A new proof of Szemerédi's theorem	2001	W. T. Gowers	3
+ PDF Chat	Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields	2013	Jingguo Bi Qi Cheng J. Maurice Rojas	3
+ PDF Chat	The Galois group of a polynomial with two indeterminate coefficients	1980	Stephen D. Cohen	2
+ PDF Chat	Graph norms and Sidorenko’s conjecture	2010	Hamed Hatami	2
+	Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs	2014	Thomas Steinke Salil Vadhan Andrew Wan	2
+	History of the Theory of Numbers	1919	L. E. Dickson	2
+ PDF Chat	Prime polynomials in short intervals and in arithmetic progressions	2015	Efrat Bank Lior Bary‐Soroker Lior Rosenzweig	2
+ PDF Chat	A note on Poisson maxima	1983	Alan Kimber	2
+	Sparse Univariate Polynomials with Many Roots Over Finite Fields	2014	Qi Cheng Shuhong Gao J. Maurice Rojas Daqing Wan	2
+	Roots of random polynomials over a finite field	2006	В. К. Леонтьев	2
+	Derangements and Applications	2003	Mehdi Hassani	2
+	Multi-party protocols	1983	Ashok Chandra Merrick L. Furst Richard J. Lipton	2
+	On Sets of Integers Which Contain No Three Terms in Arithmetical Progression	1946	Felix Behrend	2
+ PDF Chat	Simple Constructions of Almost k‐wise Independent Random Variables	1992	Noga Alon Oded Goldreich Johan Håstad René Peralta	2
+	A note on the distribution of the maximum of a set of Poisson random variables	2009	Keith Briggs Li Song Thomas Prellberg	2
+ PDF Chat	Strong Bounds for 3-Progressions	2023	Zander Kelley Raghu Meka	2
+	Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs	2006	W. T. Gowers	2
+ PDF Chat	Better Pseudorandom Generators from Milder Pseudorandom Restrictions	2012	Parikshit Gopalan Raghu Meka Omer Reingold Luca Trevisan Salil Vadhan	1
+	On subsets of finite abelian groups with no 3-term arithmetic progressions	1995	Roy Meshulam	1
+	On Triples in Arithmetic Progression	1999	Jean Bourgain	1
+ PDF Chat	Linear extension sums as valuations on cones	2011	Adrien Boussicault Valentin Féray Alain Lascoux Victor Reiner	1
+	New bounds in Balog-Szemerédi-Gowers theorem	2014	Tomasz Schoen	1
+ PDF Chat	The Correct Exponent for the Gotsman-Linial Conjecture	2013	Daniel M. Kane	1
+	Mean, Median and Mode in Binomial Distributions	1980	R. Kaas J.M. Buhrman	1
+	Galois Groups of Trinomials	1999	Stephen D. Cohen A. Movahhedi Alain Salinier	1
+	Quick Approximation to Matrices and Applications	1999	Alan Frieze Ravi Kannan	1
+	A polynomial bound in Freiman's theorem	2002	Mei-Chu Chang	1
+	Counting linear extensions is #P-complete	1991	Graham Brightwell Peter Winkler	1
+	A Note on Elkin’s Improvement of Behrend’s Construction	2010	Ben Green Julia Wolf	1
+ PDF Chat	A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length	2014	Daniel M. Kane	1
+	On the computational complexity of the order polynomial	1986	Ulrich Faigle Rainer Schräder	1
+ PDF Chat	Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems	2014	Amir Abboud Virginia Vassilevska Williams	1
+ PDF Chat	On the number of solutions of exponential congruences	2011	Antal Balog Kevin Broughan Igor E. Shparlinski	1
+	Integer Sets Containing No Arithmetic Progressions	1987	D. R. Heath‐Brown	1
+	On the singularity of generalised Vandermonde matrices over finite fields	2004	Igor E. Shparlinski	1
+	None	1999	John Friedlander Michael Larsen Daniel Lieman Igor E. Shparlinski	1
+ PDF Chat	A Small PRG for Polynomial Threshold Functions of Gaussians	2011	Daniel M. Kane	1
+ PDF Chat	Fast context-free grammar parsing requires fast boolean matrix multiplication	2002	Lillian Lee	1
+	On Certain Sets of Integers	1953	K. F. Roth	1
+	Hellinger volume and number-on-the-forehead communication complexity	2016	Troy Lee Nikos Leonardos Michael Saks Fengming Wang	1
+	Notions of Weak Pseudorandomness and GF (2 n )-Polynomials	2009	Yoav Tzur	1
+ PDF Chat	Bounded Independence Fools Degree-2 Threshold Functions	2010	Ilias Diakonikolas Daniel M. Kane Jelani Nelson	1
+ PDF Chat	Equality of P-Partition Generating Functions	2014	Peter R. W. McNamara Ryan Ward	1
+ PDF Chat	Pseudorandomness for Regular Branching Programs via Fourier Analysis	2013	Omer Reingold Thomas Steinke Salil Vadhan	1
+ PDF Chat	k-Independent Gaussians Fool Polynomial Threshold Functions	2011	Daniel M. Kane	1
+ PDF Chat	Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture	2015	Monika Henzinger Sebastian Krinninger Danupon Nanongkai Thatchaphol Saranurak	1
+	Roth’s theorem on progressions revisited	2008	Jean Bourgain	1
+ PDF Chat	A Probabilistic Technique for Finding Almost-Periods of Convolutions	2010	Ernie Croot Olof Sisask	1
+	Lower bounds of tower type for Szemerédi's uniformity lemma	1997	W. T. Gowers	1
+ PDF Chat	A Structure Theorem for Poorly Anticoncentrated Gaussian Chaoses and Applications to the Study of Polynomial Threshold Functions	2012	Daniel M. Kane	1