Ashok Kumar Ponnuswami

On Agnostic Learning of Parities, Monomials, and Halfspaces

Vitaly Feldman, Subhash Khot, Parikshit Gopalan, 2009, SIAM J. Comput..

New Results for Learning Noisy Parities and Halfspaces

Vitaly Feldman, Subhash Khot, Parikshit Gopalan, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion

Subhash Khot, Ashok Kumar Ponnuswami, Subhash Khot, 2006, ICALP.

Approximation Algorithms for the Max-Min Allocation Problem

Subhash Khot, Ashok Kumar Ponnuswami, Subhash Khot, 2007, APPROX-RANDOM.

Model characterization curves for federated search using click-logs: predicting user engagement metrics for the span of feasible operating points

Tapas Kanungo, Ashok Kumar Ponnuswami, Kumaresh Pattabiraman, 2011, WWW.

On composition of a federated web search result page: using online users to provide pairwise preference for heterogeneous verticals

Tapas Kanungo, Ran Gilad-Bachrach, Qiang Wu, 2011, WSDM '11.

Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size

H. Venkateswaran, Ashok Kumar Ponnuswami, 2004, FSTTCS.

Minimizing Wide Range Regret with Time Selection Functions

Subhash Khot, Ashok Kumar Ponnuswami, 2008, COLT.

Intractability results for some computational problems

Ashok Kumar Ponnuswami, Subhash Khot, 2008 .