| Matrix completion from a few entries RH Keshavan, A Montanari, S Oh IEEE transactions on information theory 56 (6), 2980-2998, 2010 | 1441 | 2010 |
| Matrix completion from noisy entries R Keshavan, A Montanari, S Oh Advances in neural information processing systems 22, 2009 | 834 | 2009 |
| A gradient descent algorithm on the grassman manifold for matrix completion RH Keshavan, S Oh arXiv preprint arXiv:0910.5260, 2009 | 142 | 2009 |
| Efficient algorithms for collaborative filtering RH Keshavan Stanford University, 2012 | 67 | 2012 |
| Low-rank matrix completion with noisy observations: a quantitative comparison RH Keshavan, A Montanari, S Oh 2009 47th Annual Allerton Conference on Communication, Control, and …, 2009 | 45 | 2009 |
| Regularization for matrix completion RH Keshavan, A Montanari 2010 IEEE International Symposium on Information Theory, 1503-1507, 2010 | 26 | 2010 |
| Learning low rank matrices from O (n) entries RH Keshavan, A Montanari, S Oh 2008 46th Annual Allerton Conference on Communication, Control, and …, 2008 | 17 | 2008 |
| Matrix completion from noisy entries. 2009 RH Keshavan, A Montanari, S Oh Preprint available at http://arxiv. org/abs/0906.2027, 0 | 6 | |
| Matrix completion from a few entries. 2009 RH Keshavan, A Montanari, S Oh Preprint available at http://arxiv. org/abs/0901.3150, 0 | 3 | |
| Generating random Tanner-graphs with large girth M Bayati, R Keshavan, A Montanari, S Oh, A Saberi 2009 IEEE Information Theory Workshop, 154-157, 2009 | 2 | 2009 |
| Optspace: a matrix completion algorithm RH Keshavan, A Montanari, S Oh | 2 | |
