Preyas Popat

According to our database, Preyas Popat authored at least 11 papers between 2009 and 2015.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2015

Fractal Structures in Adversarial Prediction.

Rina Panigrahy, Preyas Popat

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014

Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing.

Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi

SIAM J. Comput., 2014

Optimal amortized regret in every interval.

Rina Panigrahy, Preyas Popat

Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

2013

Inapproximability Reductions and Integrality Gaps.

Preyas Popat

PhD thesis, 2013

2012

2^{log1-ε <i>n</i>} hardness for the closest vector problem with preprocessing.

Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

On the hardness of pricing loss-leaders.

Preyas Popat, Yi Wu

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

2^{log^1-έn} Hardness for Closest Vector Problem with Preprocessing.

Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi

Electron. Colloquium Comput. Complex., 2011

$2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing

Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi

CoRR, 2011

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

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Approximate Lasserre Integrality Gap for Unique Games.

Subhash Khot, Preyas Popat, Rishi Saket

Proceedings of the Approximation, 2010

2009

NP-hardness of Euclidean sum-of-squares clustering.

Daniel Aloise, Amit Deshpande, Pierre Hansen, Preyas Popat

Mach. Learn., 2009