Full spark frames B Alexeev, J Cahill, DG Mixon Journal of Fourier Analysis and Applications 18, 1167-1194, 2012 | 174 | 2012 |
Phase retrieval with polarization B Alexeev, AS Bandeira, M Fickus, DG Mixon SIAM Journal on Imaging Sciences 7 (1), 35-66, 2014 | 166 | 2014 |
Tensor rank: Some lower and upper bounds B Alexeev, MA Forbes, J Tsimerman 2011 IEEE 26th Annual Conference on Computational Complexity, 283-291, 2011 | 80 | 2011 |
Minimal DFA for testing divisibility B Alexeev Journal of Computer and System Sciences 69 (2), 235-243, 2004 | 24 | 2004 |
On the complexity of Mumford–Shah-type regularization, viewed as a relaxed sparsity constraint B Alexeev, R Ward IEEE transactions on image processing 19 (10), 2787-2789, 2010 | 18 | 2010 |
Equations resolving a conjecture of Rado on partition regularity B Alexeev, J Tsimerman Journal of Combinatorial Theory, Series A 117 (7), 1008-1010, 2010 | 16 | 2010 |
On minimal colorings without monochromatic solutions to a linear equation B Alexeev, J Fox, R Graham Integers: Electronic Journal of Combinatorial Number Theory 7 (2), A01, 2007 | 10 | 2007 |
On lengths of rainbow cycles B Alexeev arXiv preprint math/0507456, 2005 | 9 | 2005 |
Forbidden induced subgraphs of double-split graphs B Alexeev, A Fradkin, I Kim SIAM Journal on Discrete Mathematics 26 (1), 1-14, 2012 | 5 | 2012 |
A direct proof of Mulmuley’s weak# P versus NC result B Alexeev, J Tsimerman manuscript, 2009 | 3* | 2009 |
Note on a War-like Card Game B Alexeev, J Tsimerman The American Mathematical Monthly 119 (9), 793-795, 2012 | 2* | 2012 |
An assortment of results in combinatorics and compressed sensing B Alexeev Princeton, NJ: Princeton University, 2013 | | 2013 |
A rearrangement step with potential uses in priority queues B Alexeev, MB Jacokes arXiv preprint arXiv:1203.0259, 2012 | | 2012 |