I like math.
 | Decomposing a factorial into large factors
(with Evan Conway, Matthieu Rosenfeld, Andrew V. Sutherland, Terence Tao, Markus Uhr, and Kevin Ventullo)
|
| Chunking attacks on file backup services using content-defined chunking
(with Colin Percival and Yan X Zhang)
|
| On the clustering behavior of sliding windows
(with Wenyan Luo, Dustin G. Mixon, and Yan X Zhang)
|
| Rewinding the byte trail of the White Whale
(with Dustin G. Mixon)
|
| The Erdős unit distance problem for small point sets
(with Dustin G. Mixon and Hans Parshall)
|
| The nerd snipers problem
(with Dustin G. Mixon)
|
| Compact majority-minority districts almost never exist
(with Dustin G. Mixon)
|
| The Penults of Tak: Adventures in impartial, normal-play, positional games
(with Paul Ellis, Michael Richter, and Thotsaporn "Aek" Thanatipanonda)
|
| The base measure problem and its solution
(with Alexey Radul)
|
| Partisan gerrymandering with geographically compact districts
(with Dustin G. Mixon)
|
| An impossibility theorem for gerrymandering
(with Dustin G. Mixon)
|
| Phase retrieval with polarization
(with Afonso S. Bandeira, Matthew Fickus, and Dustin G. Mixon)
|
| Full spark frames
(with Jameson Cahill and Dustin G. Mixon)
|
| An analysis of a war-like card game
(with Jacob Tsimerman)
|
| A rearrangement step with potential uses in priority queues
(with M. Brian Jacokes)
|
| Forbidden induced subgraphs of double-split graphs
(with Alexandra Fradkin and Ilhee Kim)
|
| Tensor rank: some lower and upper bounds
(with Michael Forbes and Jacob Tsimerman)
|
| On the complexity of Mumford-Shah type regularization, viewed as a relaxed sparsity constraint
(with Rachel Ward)
|
| A direct proof of Mulmuley's weak #P versus NC result
(with Jacob Tsimerman)
|
| Equations resolving a conjecture of Rado on partition regularity
(with Jacob Tsimerman)
|
| On minimal colorings without monochromatic solutions to a linear equation
(with Jacob Fox and Ron Graham)
|
| On lengths of rainbow cycles |
| Minimal DFA for testing divisibility |
