Boris Alexeev

According to our database, Boris Alexeev authored at least 15 papers between 2003 and 2025.

Collaborative distances:

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

2025

Rewinding the byte trail of the White Whale.

Boris Alexeev, Dustin G. Mixon

CoRR, February, 2025

2021

The Base Measure Problem and its Solution.

Alexey Radul, Boris Alexeev

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2018

An Impossibility Theorem for Gerrymandering.

Boris Alexeev, Dustin G. Mixon

Am. Math. Mon., 2018

Partisan gerrymandering with geographically compact districts.

Boris Alexeev, Dustin G. Mixon

J. Appl. Probab., 2018

2014

Phase Retrieval with Polarization.

Boris Alexeev, Afonso S. Bandeira, Matthew Fickus, Dustin G. Mixon

SIAM J. Imaging Sci., 2014

2012

Note on a War-like Card Game.

Boris Alexeev, Jacob Tsimerman

Am. Math. Mon., 2012

Forbidden Induced Subgraphs of Double-split Graphs.

Boris Alexeev, Alexandra Ovetsky Fradkin, Ilhee Kim

SIAM J. Discret. Math., 2012

A rearrangement step with potential uses in priority queues

Boris Alexeev, M. Brian Jacokes

CoRR, 2012

2011

Tensor Rank: Some Lower and Upper Bounds.

Boris Alexeev, Michael A. Forbes, Jacob Tsimerman

Electron. Colloquium Comput. Complex., 2011

2010

On the Complexity of Mumford-Shah-Type Regularization, Viewed as a Relaxed Sparsity Constraint.

Boris Alexeev, Rachel A. Ward

IEEE Trans. Image Process., 2010

Equations resolving a conjecture of Rado on partition regularity.

Boris Alexeev, Jacob Tsimerman

J. Comb. Theory A, 2010

An analysis of a war-like card game

Boris Alexeev, Jacob Tsimerman

CoRR, 2010

2006

On Lengths of Rainbow Cycles.

Boris Alexeev

Electron. J. Comb., 2006

2004

Minimal DFA for testing divisibility.

Boris Alexeev

J. Comput. Syst. Sci., 2004

2003

Minimal DFAs for Testing Divisibility

Boris Alexeev

CoRR, 2003