![]() |
| 2007 | ||
|---|---|---|
| 4 | EE | Subhash Khot, Ashok Kumar Ponnuswami: Approximation Algorithms for the Max-Min Allocation Problem. APPROX-RANDOM 2007: 204-217 |
| 2006 | ||
| 3 | EE | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: New Results for Learning Noisy Parities and Halfspaces. FOCS 2006: 563-574 |
| 2 | EE | Subhash Khot, Ashok Kumar Ponnuswami: Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion. ICALP (1) 2006: 226-237 |
| 2004 | ||
| 1 | EE | Ashok Kumar Ponnuswami, H. Venkateswaran: Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size. FSTTCS 2004: 460-468 |
| 1 | Vitaly Feldman | [3] |
| 2 | Parikshit Gopalan | [3] |
| 3 | Subhash Khot | [2] [3] [4] |
| 4 | H. Venkateswaran | [1] |