default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael B. Cohen
Person information
- affiliation: Massachusetts Institute of Technology, EECS, Cambridge, MA, USA
Other persons with the same name
- Michael Cohen — disambiguation page
- Michael Cohen 0002
![[0000-0001-8941-1575]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-8941-1575")
— University of Aizu, Aizuwakamatsu, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Michael B. Cohen, Yin Tat Lee, Zhao Song:
Solving Linear Programs in the Current Matrix Multiplication Time. J. ACM 68(1): 3:1-3:39 (2021)- [j2]Sébastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee:
Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing. SIAM J. Comput. 50(3): 909-923 (2021) - [c27]Michael B. Cohen, Aaron Sidford, Kevin Tian:
Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration. ITCS 2021: 62:1-62:18 - 2020
- [j1]Michael B. Cohen, Cameron Musco, Jakub Pachocki:
Online Row Sampling. Theory Comput. 16: 1-25 (2020) - [i26]Michael B. Cohen, Aaron Sidford, Kevin Tian:
Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration. CoRR abs/2011.06572 (2020)
2010 – 2019
- 2019
- [c26]Michael B. Cohen, Ben Cousins, Yin Tat Lee, Xin Yang:
A near-optimal algorithm for approximating the John Ellipsoid. COLT 2019: 849-873 - [c25]Sébastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee:
Metrical task systems on trees via mirror descent and unfair gluing. SODA 2019: 89-97 - [c24]C. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee:
A Nearly-Linear Bound for Chasing Nested Convex Bodies. SODA 2019: 117-122 - [c23]Michael B. Cohen, Yin Tat Lee, Zhao Song:
Solving linear programs in the current matrix multiplication time. STOC 2019: 938-942 - [i25]Michael B. Cohen, Ben Cousins, Yin Tat Lee, Xin Yang:
A near-optimal algorithm for approximating the John Ellipsoid. CoRR abs/1905.11580 (2019) - 2018
- [b1]Michael Benjamin Cohen:
Sparse approximations, iterative methods, and faster algorithms for matrices and graphs. Massachusetts Institute of Technology, Cambridge, USA, 2018 - [c22]Sébastien Bubeck, Michael B. Cohen, Yuanzhi Li:
Sparsity, variance and curvature in multi-armed bandits. ALT 2018: 111-127 - [c21]Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford:
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. FOCS 2018: 898-909 - [c20]Michael Cohen, Jelena Diakonikolas, Lorenzo Orecchia:
On Acceleration with Noise-Corrupted Gradients. ICML 2018: 1018-1027 - [c19]Michael B. Cohen, T. S. Jayram, Jelani Nelson:
Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. SOSA 2018: 15:1-15:9 - [c18]Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, James R. Lee, Aleksander Madry:
k-server via multiscale entropic regularization. STOC 2018: 3-16 - [c17]Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, Yuanzhi Li:
An homotopy method for lp regression provably beyond self-concordance and in input-sparsity time. STOC 2018: 1130-1137 - [i24]Michael B. Cohen, Jelena Diakonikolas, Lorenzo Orecchia:
On Acceleration with Noise-Corrupted Gradients. CoRR abs/1805.12591 (2018) - [i23]C. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee:
A Nearly-Linear Bound for Chasing Nested Convex Bodies. CoRR abs/1806.08865 (2018) - [i22]Sébastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee:
Metrical task systems on trees via mirror descent and unfair gluing. CoRR abs/1807.04404 (2018) - [i21]Timothy Chu, Michael B. Cohen, Jakub W. Pachocki, Richard Peng:
Constant Arboricity Spectral Sparsifiers. CoRR abs/1808.05662 (2018) - [i20]Michael B. Cohen, Yin Tat Lee, Zhao Song:
Solving Linear Programs in the Current Matrix Multiplication Time. CoRR abs/1810.07896 (2018) - [i19]Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford:
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. CoRR abs/1811.10722 (2018) - 2017
- [c16]Michael B. Cohen, Aleksander Madry, Dimitris Tsipras, Adrian Vladu:
Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods. FOCS 2017: 902-913 - [c15]Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu:
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract). SODA 2017: 752-771 - [c14]Michael B. Cohen, Cameron Musco, Christopher Musco:
Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling. SODA 2017: 1758-1777 - [c13]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu:
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. STOC 2017: 410-419 - [i18]Michael B. Cohen, Aleksander Madry, Dimitris Tsipras, Adrian Vladu:
Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods. CoRR abs/1704.02310 (2017) - [i17]Sébastien Bubeck, Michael B. Cohen, Yuanzhi Li:
Sparsity, variance and curvature in multi-armed bandits. CoRR abs/1711.01037 (2017) - [i16]Sébastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee, Aleksander Madry:
k-server via multiscale entropic regularization. CoRR abs/1711.01085 (2017) - [i15]Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, Yuanzhi Li:
An homotopy method for 𝓵p regression provably beyond self-concordance and in input-sparsity time. CoRR abs/1711.01328 (2017) - 2016
- [c12]Michael B. Cohen, Cameron Musco, Jakub Pachocki:
Online Row Sampling. APPROX-RANDOM 2016: 7:1-7:18 - [c11]Michael B. Cohen:
Ramanujan Graphs in Polynomial Time. FOCS 2016: 276-281 - [c10]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu:
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. FOCS 2016: 583-592 - [c9]Michael B. Cohen, Jelani Nelson, David P. Woodruff:
Optimal Approximate Matrix Product in Terms of Stable Rank. ICALP 2016: 11:1-11:14 - [c8]Michael B. Cohen:
Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities. SODA 2016: 278-287 - [c7]Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Geometric median in nearly linear time. STOC 2016: 9-21 - [i14]Michael B. Cohen:
Ramanujan Graphs in Polynomial Time. CoRR abs/1604.03544 (2016) - [i13]Michael B. Cohen, Cameron Musco, Jakub Pachocki:
Online Row Sampling. CoRR abs/1604.05448 (2016) - [i12]Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu:
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m10/7 log W) Time. CoRR abs/1605.01717 (2016) - [i11]Michael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Geometric Median in Nearly Linear Time. CoRR abs/1606.05225 (2016) - [i10]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu:
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. CoRR abs/1608.03270 (2016) - [i9]Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu:
Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs. CoRR abs/1611.00755 (2016) - 2015
- [c6]Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, Aaron Sidford:
Uniform Sampling for Matrix Approximation. ITCS 2015: 181-190 - [c5]Michael B. Cohen, Sam Elder, Cameron Musco, Christopher Musco, Madalina Persu:
Dimensionality Reduction for k-Means Clustering and Low Rank Approximation. STOC 2015: 163-172 - [c4]Michael B. Cohen, Richard Peng:
Lp Row Sampling by Lewis Weights. STOC 2015: 183-192 - [c3]Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker:
Approximating Nearest Neighbor Distances. WADS 2015: 200-211 - [i8]Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker:
Approximating Nearest Neighbor Distances. CoRR abs/1502.08048 (2015) - [i7]Michael B. Cohen, Jelani Nelson, David P. Woodruff:
Optimal approximate matrix product in terms of stable rank. CoRR abs/1507.02268 (2015) - [i6]Michael B. Cohen, Cameron Musco, Christopher Musco:
Ridge Leverage Scores for Low-Rank Approximation. CoRR abs/1511.07263 (2015) - 2014
- [c2]Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, Noel Walkington:
Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball. SODA 2014: 204-216 - [c1]Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu:
Solving SDD linear systems in nearly mlog1/2n time. STOC 2014: 343-352 - [i5]Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Shen Chen Xu:
Stretching Stretch. CoRR abs/1401.2454 (2014) - [i4]Michael B. Cohen, Rasmus Kyng, Jakub W. Pachocki, Richard Peng, Anup B. Rao:
Preconditioning in Expectation. CoRR abs/1401.6236 (2014) - [i3]Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, Aaron Sidford:
Uniform Sampling for Matrix Approximation. CoRR abs/1408.5099 (2014) - [i2]Michael B. Cohen, Sam Elder, Cameron Musco, Christopher Musco, Madalina Persu:
Dimensionality Reduction for k-Means Clustering and Low Rank Approximation. CoRR abs/1410.6801 (2014) - [i1]Michael B. Cohen, Richard Peng:
ℓp Row Sampling by Lewis Weights. CoRR abs/1412.0588 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
