Madhur Tulsiani
Madhur Tulsiani
Verified email at ttic.edu - Homepage
TitleCited byYear
CSP gaps and reductions in the Lasserre hierarchy
M Tulsiani
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1342009
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
1052008
Convex relaxations and integrality gaps
E Chlamtac, M Tulsiani
Handbook on semidefinite, conic and polynomial optimization, 139-169, 2012
1042012
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
1032008
Reductions between expansion problems
P Raghavendra, D Steurer, M Tulsiani
2012 IEEE 27th Conference on Computational Complexity, 64-73, 2012
952012
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
732007
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
682009
Time space tradeoffs for attacks against one-way functions and PRGs
A De, L Trevisan, M Tulsiani
Annual Cryptology Conference, 649-665, 2010
51*2010
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
512007
Improved pseudorandom generators for depth 2 circuits
A De, O Etesami, L Trevisan, M Tulsiani
Approximation, randomization, and combinatorial optimization. Algorithms and …, 2010
462010
SDP gaps from pairwise independence
S Benabbas, K Georgiou, A Magen, M Tulsiani
Theory of Computing 8 (1), 269-289, 2012
412012
Algorithms and hardness for subspace approximation
A Deshpande, M Tulsiani, NK Vishnoi
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
312011
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
26*2011
Optimal Sherali-Adams gaps from pairwise independence
K Georgiou, A Magen, M Tulsiani
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
252009
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
212008
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
182014
Playing random and expanding unique games
A Kolla, M Tulsiani
Unpublished manuscript available from the authors’ webpages, to appear in …, 2007
18*2007
Quadratic Goldreich--Levin Theorems
M Tulsiani, J Wolf
SIAM Journal on Computing 43 (2), 730-766, 2014
162014
Algorithmic regularity for polynomials and applications
A Bhattacharyya, P Hatami, M Tulsiani
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
142014
LS+ lower bounds from pairwise independence
M Tulsiani, P Worah
2013 IEEE Conference on Computational Complexity, 121-132, 2013
142013
The system can't perform the operation now. Try again later.
Articles 1–20