Travelled to:1 × Canada
1 × Denmark
1 × France
3 × USA
Collaborated with:S.Khot P.Worah ∅ J.Wright Y.Zhou G.Schoenebeck L.Trevisan E.Ben-Sasson N.Ron-Zewi J.Wolf V.Guruswami R.O'Donnell P.Popat Y.Wu S.Arora A.Kolla D.Steurer N.K.Vishnoi
Talks about:gap (3) approxim (2) strong (2) resist (2) graph (2) cover (2) game (2) constraint (1) threshold (1) schrijver (1)
Person: Madhur Tulsiani
DBLP: Tulsiani:Madhur
Contributed to:
2014
20142010200920082007Wrote 8 papers:
- ICALP-v1-2014-Ben-SassonRTW #algorithm #proving
- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications (EBS, NRZ, MT, JW), pp. 955–966.
- ICALP-v1-2014-KhotTW #approximate #complexity
- The Complexity of Somewhat Approximation Resistant Predicates (SK, MT, PW), pp. 689–700.
- ICALP-v1-2014-TulsianiWZ #game studies #graph #parallel #rank
- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs (MT, JW, YZ), pp. 1003–1014.
- STOC-2014-KhotTW #approximate
- A characterization of strong approximation resistance (SK, MT, PW), pp. 634–643.
- ICALP-v1-2010-GuruswamiKOPTW
- SDP Gaps for 2-to-1 and Other Label-Cover Variants (VG, SK, RO, PP, MT, YW), pp. 617–628.
- STOC-2009-Tulsiani #csp #reduction
- CSP gaps and reductions in the lasserre hierarchy (MT), pp. 303–312.
- STOC-2008-AroraKKSTV #constraints #game studies #graph
- Unique games on expanding constraint graphs are easy: extended abstract (SA, SK, AK, DS, MT, NKV), pp. 21–28.
- STOC-2007-SchoenebeckTT
- Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut (GS, LT, MT), pp. 302–310.