Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size. - Ashok Kumar Ponnuswami; H. Venkateswaran (FSTTCS, 2004)

Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion. - Subhash Khot; Ashok Kumar Ponnuswami (ICALP (1), 2006)

New Results for Learning Noisy Parities and Halfspaces. - Vitaly Feldman; Parikshit Gopalan; Subhash Khot; Ashok Kumar Ponnuswami (Electron. Colloquium Comput. Complex., 2006)

Approximation Algorithms for the Max-Min Allocation Problem. - Subhash Khot; Ashok Kumar Ponnuswami (APPROX-RANDOM, 2007)

Minimizing Wide Range Regret with Time Selection Functions. - Subhash Khot; Ashok Kumar Ponnuswami (COLT, 2008)

Intractability Results for some Computational Problems. - Ashok Kumar Ponnuswami (2008)

On Agnostic Learning of Parities, Monomials, and Halfspaces. - Vitaly Feldman; Parikshit Gopalan; Subhash Khot; Ashok Kumar Ponnuswami (SIAM J. Comput., 2009)

On composition of a federated web search result page: using online users to provide pairwise preference for heterogeneous verticals. - Ashok Kumar Ponnuswami; Kumaresh Pattabiraman; Qiang Wu; Ran Gilad-Bachrach; Tapas Kanungo (WSDM, 2011)

Model characterization curves for federated search using click-logs: predicting user engagement metrics for the span of feasible operating points. - Ashok Kumar Ponnuswami; Kumaresh Pattabiraman; Desmond Brand; Tapas Kanungo (WWW, 2011)