| 2008 |
|---|
| 9 | EE | Omer Reingold,
Luca Trevisan,
Madhur Tulsiani,
Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets.
FOCS 2008: 76-85 |
| 8 | EE | Sanjeev Arora,
Subhash Khot,
Alexandra Kolla,
David Steurer,
Madhur Tulsiani,
Nisheeth K. Vishnoi:
Unique games on expanding constraint graphs are easy: extended abstract.
STOC 2008: 21-28 |
| 7 | EE | Omer Reingold,
Luca Trevisan,
Madhur Tulsiani,
Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets.
Electronic Colloquium on Computational Complexity (ECCC) 15(045): (2008) |
| 6 | EE | Luca Trevisan,
Madhur Tulsiani,
Salil P. Vadhan:
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution.
Electronic Colloquium on Computational Complexity (ECCC) 15(103): (2008) |
| 5 | EE | Madhur Tulsiani:
CSP Gaps and Reductions in the Lasserre Hierarchy.
Electronic Colloquium on Computational Complexity (ECCC) 15(104): (2008) |
| 2007 |
|---|
| 4 | EE | Grant Schoenebeck,
Luca Trevisan,
Madhur Tulsiani:
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.
IEEE Conference on Computational Complexity 2007: 205-216 |
| 3 | EE | Grant Schoenebeck,
Luca Trevisan,
Madhur Tulsiani:
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut.
STOC 2007: 302-310 |
| 2006 |
|---|
| 2 | EE | Grant Schoenebeck,
Luca Trevisan,
Madhur Tulsiani:
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.
Electronic Colloquium on Computational Complexity (ECCC) 13(098): (2006) |
| 1 | EE | Grant Schoenebeck,
Luca Trevisan,
Madhur Tulsiani:
Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut.
Electronic Colloquium on Computational Complexity (ECCC) 13(132): (2006) |
