< prev | up | next >

Boris Alexeev's papers

General information

arXiv logo13 papers appearing on the arXiv online preprint server.
MathSciNet logo9 papers reviewed by Math Reviews (MathSciNet).
ECCC logo1 paper appearing in the Electronic Colloquium on Computational Complexity (ECCC).
Computing Reviews logo1 paper reviewed by Computing Reviews.
BiBTeX logo14 papers' bibliographic information in a single BiBTeX file.


Each paper title below links to more detailed information.

PDF logoThe base measure problem and its solution
(with Alexey Radul)
PDF logoPartisan gerrymandering with geographically compact districts
(with Dustin G. Mixon)
PDF logoAn impossibility theorem for gerrymandering
(with Dustin G. Mixon)
PDF logoPhase retrieval with polarization
(with Afonso S. Bandeira, Matthew Fickus, and Dustin G. Mixon)
PDF logoFull spark frames
(with Jameson Cahill and Dustin G. Mixon)
PDF logoAn analysis of a war-like card game
(with Jacob Tsimerman)
PDF logoA rearrangement step with potential uses in priority queues
(with M. Brian Jacokes)
PDF logoForbidden induced subgraphs of double-split graphs
(with Alexandra Fradkin and Ilhee Kim)
PDF logoTensor rank: some lower and upper bounds
(with Michael Forbes and Jacob Tsimerman)
PDF logoOn the complexity of Mumford-Shah type regularization, viewed as a relaxed sparsity constraint
(with Rachel Ward)
PDF logoA direct proof of Mulmuley's weak #P versus NC result
(with Jacob Tsimerman)
PDF logoEquations resolving a conjecture of Rado on partition regularity
(with Jacob Tsimerman)
PDF logoOn minimal colorings without monochromatic solutions to a linear equation
(with Jacob Fox and Ron Graham)
PDF logoOn lengths of rainbow cycles
PDF logoMinimal DFA for testing divisibility
< prev | up | next >