Madhur Tulsiani
Madhur Tulsiani
Verified email at ttic.edu - Homepage
Title
Cited by
Cited by
Year
CSP gaps and reductions in the Lasserre hierarchy
M Tulsiani
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1492009
Unique games on expanding constraint graphs are easy
S Arora, SA Khot, A Kolla, D Steurer, M Tulsiani, NK Vishnoi
Proceedings of the fortieth annual ACM symposium on Theory of computing, 21-28, 2008
1132008
Convex relaxations and integrality gaps
E Chlamtac, M Tulsiani
Handbook on semidefinite, conic and polynomial optimization, 139-169, 2012
1122012
Dense subsets of pseudorandom sets
O Reingold, L Trevisan, M Tulsiani, S Vadhan
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 76-85, 2008
1112008
Reductions between expansion problems
P Raghavendra, D Steurer, M Tulsiani
2012 IEEE 27th Conference on Computational Complexity, 64-73, 2012
1072012
Tight integrality gaps for Lovász-Schrijver LP relaxations of vertex cover and max cut
G Schoenebeck, L Trevisan, M Tulsiani
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
782007
Regularity, boosting, and efficiently simulating every high-entropy distribution
L Trevisan, M Tulsiani, S Vadhan
2009 24th Annual IEEE Conference on Computational Complexity, 126-136, 2009
702009
Time space tradeoffs for attacks against one-way functions and PRGs
A De, L Trevisan, M Tulsiani
Annual Cryptology Conference, 649-665, 2010
61*2010
Improved pseudorandom generators for depth 2 circuits
A De, O Etesami, L Trevisan, M Tulsiani
Approximation, randomization, and combinatorial optimization. Algorithms and …, 2010
562010
A linear round lower bound for Lovász-Schrijver SDP relaxations of vertex cover
G Schoenebeck, L Trevisan, M Tulsiani
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007
532007
SDP gaps from pairwise independence
S Benabbas, K Georgiou, A Magen, M Tulsiani
Theory of Computing 8 (1), 269-289, 2012
472012
Algorithms and hardness for subspace approximation
A Deshpande, M Tulsiani, NK Vishnoi
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
362011
Optimal Sherali-Adams gaps from pairwise independence
K Georgiou, A Magen, M Tulsiani
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
292009
On LP-based approximability for strict CSPs
A Kumar, R Manokaran, M Tulsiani, NK Vishnoi
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
27*2011
Linear programming hierarchies suffice for directed steiner tree
Z Friggstad, J Könemann, Y Kun-Ko, A Louis, M Shadravan, M Tulsiani
International Conference on Integer Programming and Combinatorial …, 2014
222014
New proofs of the Green-Tao-Ziegler dense model theorem: An exposition
O Reingold, L Trevisan, M Tulsiani, S Vadhan
arXiv preprint arXiv:0806.0381, 2008
222008
A characterization of strong approximation resistance
S Khot, M Tulsiani, P Worah
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
212014
Quadratic Goldreich--Levin Theorems
M Tulsiani, J Wolf
SIAM Journal on Computing 43 (2), 730-766, 2014
192014
Playing random and expanding unique games
A Kolla, M Tulsiani
Unpublished manuscript available from the authors’ webpages, to appear in …, 2007
19*2007
Weak decoupling, polynomial folds and approximate optimization over the sphere
V Bhattiprolu, M Ghosh, V Guruswami, E Lee, M Tulsiani
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
16*2017
The system can't perform the operation now. Try again later.
Articles 1–20