Boris
next magic explained

Boris Alexeev

I am a graduate student in mathematics at Princeton interested in computational complexity theory and combinatorics. I am supported by the NSF Graduate Research Fellowship.

I co-organize the annual UGA high school math tournament in Athens, Georgia.

Contact info

Email: bale...@math.princeton.edu (username is first initial and last name)
Office: 1106 Fine Hall, Washington Rd, Princeton NJ 08544.

Coauthors

Jacob Fox, Ron Graham, Jacob Tsimerman, and Rachel Ward

Papers

arXiv logo MathSciNet logo Computing Reviews logo BiBTeX logo All of my papers available on the particular site.
PDF logo arXiv logo BiBTeX logo On the complexity of Mumford-Shah type regularization, viewed as a relaxed sparsity constraint
(with Rachel Ward)
Submitted, Nov 2009.
PDF logo arXiv logo BiBTeX logo Equations resolving a conjecture of Rado on partition regularity
(with Jacob Tsimerman)
Journal of Combinatorial Theory, Series A, to appear.
PDF logo MathSciNet logo BiBTeX logo On minimal colorings without monochromatic solutions to a linear equation
(with Jacob Fox and Ron Graham)
Combinatorial number theory, de Gruyter, Berlin, 2007, pp. 1–22.
PDF logo arXiv logo MathSciNet logo BiBTeX logo On lengths of rainbow cycles
Electronic Journal of Combinatorics 13 (2006), no. 1, R105, 14 pp.
PDF logo arXiv logo MathSciNet logo Computing Reviews logo BiBTeX logo Minimal DFA for testing divisibility
Journal of Computer and System Sciences 69 (2004), no. 2, 235–243.

Notes

PDF logo arXiv logo BiBTeX logo An analysis of a war-like card game
(with Jacob Tsimerman)
Note, Jan 2010.
PDF logo BiBTeX logo A direct proof of Mulmuley's weak #P versus NC result
(with Jacob Tsimerman)
Note, Feb 2009.