Ankur Moitra

	2012
24		Noga Alon, Ankur Moitra, Benny Sudakov: Nearly complete graphs decomposable into large induced matchings and their applications. STOC 2012: 1079-1090
23		Sanjeev Arora, Rong Ge, Ravindran Kannan, Ankur Moitra: Computing a nonnegative matrix factorization - provably. STOC 2012: 145-162
22		Sanjeev Arora, Rong Ge, Ankur Moitra: Learning Topic Models - Going beyond SVD CoRR abs/1204.1956: (2012)
21		Ankur Moitra: A Singly-Exponential Time Algorithm for Computing Nonnegative Rank CoRR abs/1205.0044: (2012)
20		Adam Tauman Kalai, Ankur Moitra, Gregory Valiant: Disentangling Gaussians. Commun. ACM 55(2): 113-120 (2012)
19		Ankur Moitra: A Singly-Exponential Time Algorithm for Computing Nonnegative Rank. Electronic Colloquium on Computational Complexity (ECCC) 19: 53 (2012)
	2011
18		Ran Gelles, Ankur Moitra, Amit Sahai: Efficient and Explicit Coding for Interactive Communication. FOCS 2011: 768-777
17		Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra: Capacitated Metric Labeling. SODA 2011: 976-995
16		Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, Moshe Tennenholtz: Dueling algorithms. STOC 2011: 215-224
15		Ankur Moitra, Ryan O'Donnell: Pareto optimal solutions for smoothed analysts. STOC 2011: 225-234
14		Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, Moshe Tennenholtz: Dueling Algorithms CoRR abs/1101.2883: (2011)
13		Noga Alon, Ankur Moitra, Benny Sudakov: Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications CoRR abs/1111.0253: (2011)
12		Sanjeev Arora, Rong Ge, Ravi Kannan, Ankur Moitra: Computing a Nonnegative Matrix Factorization -- Provably CoRR abs/1111.0952: (2011)
11		Ankur Moitra: Efficiently Coding for Interactive Communication. Electronic Colloquium on Computational Complexity (ECCC) 18: 42 (2011)
	2010
10		Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra: Vertex Sparsifiers and Abstract Rounding Algorithms. FOCS 2010: 265-274
9		Ankur Moitra, Gregory Valiant: Settling the Polynomial Learnability of Mixtures of Gaussians. FOCS 2010: 93-102
8		Frank Thomson Leighton, Ankur Moitra: Extensions and limits to vertex sparsification. STOC 2010: 47-56
7		Adam Tauman Kalai, Ankur Moitra, Gregory Valiant: Efficiently learning mixtures of two Gaussians. STOC 2010: 553-562
6		Ankur Moitra, Gregory Valiant: Settling the Polynomial Learnability of Mixtures of Gaussians CoRR abs/1004.4223: (2010)
5		Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra: Vertex Sparsifiers and Abstract Rounding Algorithms CoRR abs/1006.4536: (2010)
4		Ankur Moitra, Ryan O'Donnell: Pareto Optimal Solutions for Smoothed Analysts CoRR abs/1011.2249: (2010)
3		Tom Leighton, Ankur Moitra: Some Results on Greedy Embeddings in Metric Spaces. Discrete & Computational Geometry 44(3): 686-705 (2010)
	2009
2		Ankur Moitra: Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size. FOCS 2009: 3-12
	2008
1		Ankur Moitra, Tom Leighton: Some Results on Greedy Embeddings in Metric Spaces. FOCS 2008: 337-346

Coauthor Index

1	Noga Alon	[13] [24]
2	Matthew Andrews	[17]
3	Sanjeev Arora	[12] [22] [23]
4	Moses Charikar	[5] [10]
5	Rong Ge	[12] [22] [23]
6	Ran Gelles	[18]
7	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[17]
8	Nicole Immorlica	[14] [16]
9	Adam Tauman Kalai (Adam Kalai)	[7] [14] [16] [20]
10	Ravi Kannan (Ravindran Kannan)	[12] [23]
11	Howard J. Karloff	[17]
12	Frank Thomson Leighton (Tom Leighton)	[1] [3] [5] [8] [10]
13	Shi Li	[5] [10]
14	Brendan Lucier	[14] [16]
15	Ryan O'Donnell	[4] [15]
16	Andrew Postlewaite	[14] [16]
17	Amit Sahai	[18]
18	Benny Sudakov	[13] [24]
19	Moshe Tennenholtz	[14] [16]
20	Gregory Valiant	[6] [7] [9] [20]

Colors in the list of coauthors

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page