BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
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 DBLP: Tulsiani:Madhur

Contributed to:

ICALP (1) 20142014
STOC 20142014
ICALP (1) 20102010
STOC 20092009
STOC 20082008
STOC 20072007

Wrote 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.
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.
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut (GS, LT, MT), pp. 302–310.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.