 | 2008 |
|---|
| 6 |       | Subhash Khot,
Ashok Kumar Ponnuswami:
Minimizing Wide Range Regret with Time Selection Functions.
COLT 2008: 81-86 |
| 2007 |
|---|
| 5 | | Subhash Khot,
Ashok Kumar Ponnuswami:
Approximation Algorithms for the Max-Min Allocation Problem.
APPROX-RANDOM 2007: 204-217 |
| 2006 |
|---|
| 4 | | Vitaly Feldman,
Parikshit Gopalan,
Subhash Khot,
Ashok Kumar Ponnuswami:
New Results for Learning Noisy Parities and Halfspaces.
FOCS 2006: 563-574 |
| 3 | | Subhash Khot,
Ashok Kumar Ponnuswami:
Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion.
ICALP (1) 2006: 226-237 |
| 2 | | Vitaly Feldman,
Parikshit Gopalan,
Subhash Khot,
Ashok Kumar Ponnuswami:
New Results for Learning Noisy Parities and Halfspaces.
Electronic Colloquium on Computational Complexity (ECCC) 13(059): (2006) |
| 2004 |
|---|
| 1 | | Ashok Kumar Ponnuswami,
H. Venkateswaran:
Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size.
FSTTCS 2004: 460-468 |
