Boris Alexeev's papers
General information
13 papers appearing on the arXiv online preprint server.
9 papers reviewed by Math Reviews (MathSciNet).
1 paper appearing in the Electronic Colloquium on Computational Complexity (ECCC).
1 paper reviewed by Computing Reviews.
14 papers' bibliographic information in a single BiBTeX file.
Papers
Each paper title below links to more detailed information.
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
< prev |
up
|
next >
