NP-hardness of Euclidean sum-of-squares clustering. - Daniel Aloise; Amit Deshpande 001; Pierre Hansen; Preyas Popat (Mach. Learn., 2009)

Approximate Lasserre Integrality Gap for Unique Games. - Subhash Khot; Preyas Popat; Rishi Saket (APPROX-RANDOM, 2010)

SDP Gaps for 2-to-1 and Other Label-Cover Variants. - Venkatesan Guruswami; Subhash Khot; Ryan O'Donnell; Preyas Popat; Madhur Tulsiani; Yi Wu 002 (ICALP (1), 2010)

$2^{ log^{1- eps} n}$ Hardness for Closest Vector Problem with Preprocessing - Subhash Khot; Preyas Popat; Nisheeth K. Vishnoi (CoRR, 2011)

2log1-έn Hardness for Closest Vector Problem with Preprocessing. - Subhash Khot; Preyas Popat; Nisheeth K. Vishnoi (Electron. Colloquium Comput. Complex., 2011)

On the hardness of pricing loss-leaders. - Preyas Popat; Yi Wu 002 (SODA, 2012)

2log1-ε n hardness for the closest vector problem with preprocessing. - Subhash Khot; Preyas Popat; Nisheeth K. Vishnoi (STOC, 2012)

Inapproximability Reductions and Integrality Gaps. - Preyas Popat (2013)

Optimal amortized regret in every interval. - Rina Panigrahy; Preyas Popat (UAI, 2014)

Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing. - Subhash Khot; Preyas Popat; Nisheeth K. Vishnoi (SIAM J. Comput., 2014)

Fractal Structures in Adversarial Prediction. - Rina Panigrahy; Preyas Popat (ITCS, 2015)