Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball. - Michael B. Cohen; Brittany Terese Fasy; Gary L. Miller; Amir Nayyeri; Richard Peng; Noel Walkington (SODA, 2014)

Solving SDD linear systems in nearly mlog1/2n time. - Michael B. Cohen; Rasmus Kyng; Gary L. Miller; Jakub W. Pachocki; Richard Peng; Anup B. Rao; Shen Chen Xu (STOC, 2014)

Preconditioning in Expectation. - Michael B. Cohen; Rasmus Kyng; Jakub W. Pachocki; Richard Peng; Anup B. Rao (CoRR, 2014)

Stretching Stretch. - Michael B. Cohen; Gary L. Miller; Jakub W. Pachocki; Richard Peng; Shen Chen Xu (CoRR, 2014)

Uniform Sampling for Matrix Approximation. - Michael B. Cohen; Yin Tat Lee; Cameron Musco; Christopher Musco; Richard Peng; Aaron Sidford (ITCS, 2015)

Dimensionality Reduction for k-Means Clustering and Low Rank Approximation. - Michael B. Cohen; Sam Elder; Cameron Musco; Christopher Musco; Madalina Persu (STOC, 2015)

Lp Row Sampling by Lewis Weights. - Michael B. Cohen; Richard Peng (STOC, 2015)

Approximating Nearest Neighbor Distances. - Michael B. Cohen; Brittany Terese Fasy; Gary L. Miller; Amir Nayyeri; Donald R. Sheehy; Ameya Velingker (WADS, 2015)

Ridge Leverage Scores for Low-Rank Approximation. - Michael B. Cohen; Cameron Musco; Christopher Musco (CoRR, 2015)

Ramanujan Graphs in Polynomial Time. - Michael B. Cohen (FOCS, 2016)

Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. - Michael B. Cohen; Jonathan A. Kelner; John Peebles; Richard Peng; Aaron Sidford; Adrian Vladu (FOCS, 2016)

Optimal Approximate Matrix Product in Terms of Stable Rank. - Michael B. Cohen; Jelani Nelson; David P. Woodruff (ICALP, 2016)

Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities. - Michael B. Cohen (SODA, 2016)

Geometric median in nearly linear time. - Michael B. Cohen; Yin Tat Lee; Gary L. Miller; Jakub Pachocki; Aaron Sidford (STOC, 2016)

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m10/7 log W) Time. - Michael B. Cohen; Aleksander Madry; Piotr Sankowski; Adrian Vladu (CoRR, 2016)

Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods. - Michael B. Cohen; Aleksander Madry; Dimitris Tsipras; Adrian Vladu (FOCS, 2017)

Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling. - Michael B. Cohen; Cameron Musco; Christopher Musco (SODA, 2017)

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract). - Michael B. Cohen; Aleksander Madry; Piotr Sankowski; Adrian Vladu (SODA, 2017)

Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. - Michael B. Cohen; Jonathan A. Kelner; John Peebles; Richard Peng; Anup B. Rao; Aaron Sidford; Adrian Vladu (STOC, 2017)

Sparsity, variance and curvature in multi-armed bandits. - Sébastien Bubeck; Michael B. Cohen; Yuanzhi Li (ALT, 2018)

Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. - Michael B. Cohen; Jonathan A. Kelner; Rasmus Kyng; John Peebles; Richard Peng; Anup B. Rao; Aaron Sidford (FOCS, 2018)

On Acceleration with Noise-Corrupted Gradients. - Michael Cohen 001; Jelena Diakonikolas; Lorenzo Orecchia (ICML, 2018)

Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. - Michael B. Cohen; T. S. Jayram; Jelani Nelson (SOSA, 2018)

An homotopy method for lp regression provably beyond self-concordance and in input-sparsity time. - Sébastien Bubeck; Michael B. Cohen; Yin Tat Lee; Yuanzhi Li (STOC, 2018)

k-server via multiscale entropic regularization. - Sébastien Bubeck; Michael B. Cohen; Yin Tat Lee; James R. Lee; Aleksander Madry (STOC, 2018)

Constant Arboricity Spectral Sparsifiers. - Timothy Chu; Michael B. Cohen; Jakub W. Pachocki; Richard Peng (CoRR, 2018)

Sparse approximations, iterative methods, and faster algorithms for matrices and graphs. - Michael Benjamin Cohen (2018)

A near-optimal algorithm for approximating the John Ellipsoid. - Michael B. Cohen; Ben Cousins; Yin Tat Lee; Xin Yang 017 (COLT, 2019)

A Nearly-Linear Bound for Chasing Nested Convex Bodies. - C. J. Argue; Sébastien Bubeck; Michael B. Cohen; Anupam Gupta 001; Yin Tat Lee (SODA, 2019)

Online Row Sampling. - Michael B. Cohen; Cameron Musco; Jakub Pachocki (Theory Comput., 2020)

Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration. - Michael B. Cohen; Aaron Sidford; Kevin Tian (ITCS, 2021)

Solving Linear Programs in the Current Matrix Multiplication Time. - Michael B. Cohen; Yin Tat Lee; Zhao Song 002 (J. ACM, 2021)

Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing. - Sébastien Bubeck; Michael B. Cohen; James R. Lee; Yin Tat Lee (SIAM J. Comput., 2021)