- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c15 |      | |
| i15 | | Ankur Moitra, Michael Saks: A Polynomial Time Algorithm for Lossy Population Recovery. CoRR abs/1302.1515 (2013) |
| 2012 | ||
| j3 | | Adam Tauman Kalai, Ankur Moitra, Gregory Valiant: Disentangling Gaussians. Commun. ACM 55(2): 113-120 (2012) |
| j2 | | Ankur Moitra, Ryan O'Donnell: Pareto Optimal Solutions for Smoothed Analysts. SIAM J. Comput. 41(5): 1266-1284 (2012) |
| c14 | | |
| c13 | | Sanjeev Arora, Rong Ge, Ankur Moitra, Sushant Sachdeva: "Provable ICA with Unknown Gaussian Noise, with Implications for Gaussian Mixtures and Autoencoders". NIPS 2012: 2384-2392 |
| c12 | | Sanjeev Arora, Rong Ge, Ravindran Kannan, Ankur Moitra: Computing a nonnegative matrix factorization - provably. STOC 2012: 145-162 |
| c11 | | Noga Alon, Ankur Moitra, Benny Sudakov: Nearly complete graphs decomposable into large induced matchings and their applications. STOC 2012: 1079-1090 |
| i14 | | Sanjeev Arora, Rong Ge, Ankur Moitra: Learning Topic Models - Going beyond SVD. CoRR abs/1204.1956 (2012) |
| i13 | | Ankur Moitra: A Singly-Exponential Time Algorithm for Computing Nonnegative Rank. CoRR abs/1205.0044 (2012) |
| i12 | | Sanjeev Arora, Rong Ge, Ankur Moitra, Sushant Sachdeva: Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders. CoRR abs/1206.5349 (2012) |
| i11 | | Moritz Hardt, Ankur Moitra: Can We Reconcile Robustness and Efficiency in Unsupervised Learning? CoRR abs/1211.1041 (2012) |
| i10 | | Sanjeev Arora, Rong Ge, Yoni Halpern, David M. Mimno, Ankur Moitra, David Sontag, Yichen Wu, Michael Zhu: A Practical Algorithm for Topic Modeling with Provable Guarantees. CoRR abs/1212.4777 (2012) |
| i9 | | Ankur Moitra: A Singly-Exponential Time Algorithm for Computing Nonnegative Rank. Electronic Colloquium on Computational Complexity (ECCC) 19: 53 (2012) |
| i8 | | Mark Braverman, Ankur Moitra: An Information Complexity Approach to Extended Formulations. Electronic Colloquium on Computational Complexity (ECCC) 19: 131 (2012) |
| 2011 | ||
| c10 | | Ran Gelles, Ankur Moitra, Amit Sahai: Efficient and Explicit Coding for Interactive Communication. FOCS 2011: 768-777 |
| c9 | | Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra: Capacitated Metric Labeling. SODA 2011: 976-995 |
| c8 | | Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, Moshe Tennenholtz: Dueling algorithms. STOC 2011: 215-224 |
| c7 | | |
| i7 | | Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, Moshe Tennenholtz: Dueling Algorithms. CoRR abs/1101.2883 (2011) |
| i6 | | Noga Alon, Ankur Moitra, Benny Sudakov: Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications. CoRR abs/1111.0253 (2011) |
| i5 | | Sanjeev Arora, Rong Ge, Ravi Kannan, Ankur Moitra: Computing a Nonnegative Matrix Factorization -- Provably. CoRR abs/1111.0952 (2011) |
| i4 | | Ankur Moitra: Efficiently Coding for Interactive Communication. Electronic Colloquium on Computational Complexity (ECCC) 18: 42 (2011) |
| 2010 | ||
| j1 | | Tom Leighton, Ankur Moitra: Some Results on Greedy Embeddings in Metric Spaces. Discrete & Computational Geometry 44(3): 686-705 (2010) |
| c6 | | Ankur Moitra, Gregory Valiant: Settling the Polynomial Learnability of Mixtures of Gaussians. FOCS 2010: 93-102 |
| c5 | | Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra: Vertex Sparsifiers and Abstract Rounding Algorithms. FOCS 2010: 265-274 |
| c4 | | Frank Thomson Leighton, Ankur Moitra: Extensions and limits to vertex sparsification. STOC 2010: 47-56 |
| c3 | | Adam Tauman Kalai, Ankur Moitra, Gregory Valiant: Efficiently learning mixtures of two Gaussians. STOC 2010: 553-562 |
| i3 | | Ankur Moitra, Gregory Valiant: Settling the Polynomial Learnability of Mixtures of Gaussians. CoRR abs/1004.4223 (2010) |
| i2 | | Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra: Vertex Sparsifiers and Abstract Rounding Algorithms. CoRR abs/1006.4536 (2010) |
| i1 | | Ankur Moitra, Ryan O'Donnell: Pareto Optimal Solutions for Smoothed Analysts. CoRR abs/1011.2249 (2010) |
| 2009 | ||
| c2 | | Ankur Moitra: Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size. FOCS 2009: 3-12 |
| 2008 | ||
| c1 | | |
| 1 | Noga Alon | |
| 2 | Matthew Andrews | |
| 3 | Sanjeev Arora | |
| 4 | Mark Braverman | |
| 5 | Moses Charikar | |
| 6 | Rong Ge | |
| 7 | Ran Gelles | |
| 8 | Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi) | |
| 9 | Yoni Halpern | |
| 10 | Moritz Hardt | |
| 11 | Nicole Immorlica | |
| 12 | Adam Tauman Kalai (Adam Kalai) | |
| 13 | Ravi Kannan (Ravindran Kannan) | |
| 14 | Howard J. Karloff | |
| 15 | Frank Thomson Leighton (Tom Leighton) | |
| 16 | Shi Li | |
| 17 | Brendan Lucier | |
| 18 | David M. Mimno | |
| 19 | Ryan O'Donnell | |
| 20 | Andrew Postlewaite | |
| 21 | Sushant Sachdeva | |
| 22 | Amit Sahai | |
| 23 | Michael E. Saks (Michael Saks) | |
| 24 | David Sontag | |
| 25 | Benny Sudakov | |
| 26 | Moshe Tennenholtz | |
| 27 | Gregory Valiant | |
| 28 | Yichen Wu | |
| 29 | Michael Zhu |
Data released under the ODC-BY 1.0 license — See also our legal information page