1. (with C. Mao and P. Rigollet) “Minimax Rates and Efficient Algorithms for Noisy Sorting.” Submitted, 2017. arXiv
  2. (with A. Perry, A. S. Bandeira, P. Rigollet, and A. Singer) “The sample complexity of multi-reference alignment.” Submitted, 2017. arXiv
  3. (with F. Bach) “Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance.” Submitted, 2017. arXiv
  4. (with A. S. Bandeira & P. Rigollet) “Optimal rates of estimation for multi-reference alignment.” Submitted, 2017. arXiv
  5. (with M. Sawhney) “Further results on arc and bar k-visibility graphs.” Submitted, 2016. arXiv

Conference papers

  1. (with J. Altschuler & P. Rigollet) “Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration.” Advances in Neural Information Processing Systems 30 (NIPS 2017), to appear (selected for spotlight presentation). arXiv
  2. (with V. Perchet & P. Rigollet) “Online learning in repeated auctions.” Proceedings of the 29th Annual Conference on Learning Theory (COLT 2016). PDF, video of presentation

Journal articles

  1. “Approximately certifying the restricted isometry property is hard.” In IEEE Transactions on Information Theory, to appear. arXiv
  2. (with S. Billey)¬†Appendix to “Permutations with Kazhdan-Lusztig polynomial P_{id,w}(q) = 1 + q^h” by Alexander Woo. In Electronic Journal of Combinatorics. 16 (2009), no. 2. PDF

Refereed book chapters

  1. “Multinational War is Hard.” In Jennifer Beineke and Jason Rosenhouse, editors, The Mathematics of Various Entertaining Subjects, Volume 2. Princeton, 2017. arXiv