Sledovat
Madhur Tulsiani
Madhur Tulsiani
E-mailová adresa ověřena na: ttic.edu - Domovská stránka
Název
Citace
Citace
Rok
CSP gaps and reductions in the Lasserre hierarchy
M Tulsiani
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1692009
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
1472008
Reductions between expansion problems
P Raghavendra, D Steurer, M Tulsiani
2012 IEEE 27th Conference on Computational Complexity, 64-73, 2012
1362012
Convex relaxations and integrality gaps
E Chlamtac, M Tulsiani
Handbook on semidefinite, conic and polynomial optimization, 139-169, 2012
1342012
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
1272008
Time space tradeoffs for attacks against one-way functions and PRGs
A De, L Trevisan, M Tulsiani
Annual Cryptology Conference, 649-665, 2010
108*2010
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
922009
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
852007
Improved pseudorandom generators for depth 2 circuits
A De, O Etesami, L Trevisan, M Tulsiani
International Workshop on Randomization and Approximation Techniques in …, 2010
732010
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
552007
SDP gaps from pairwise independence
S Benabbas, K Georgiou, A Magen, M Tulsiani
Theory of Computing 8 (1), 269-289, 2012
542012
Algorithms and hardness for subspace approximation
A Deshpande, M Tulsiani, NK Vishnoi
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
472011
Approximating constraint satisfaction problems on high-dimensional expanders
VL Alev, FG Jeronimo, M Tulsiani
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
452019
Optimal Sherali-Adams gaps from pairwise independence
K Georgiou, A Magen, M Tulsiani
International Workshop on Approximation Algorithms for Combinatorial …, 2009
392009
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
37*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
292014
Near-linear time decoding of ta-shma’s codes via splittable regularity
FG Jeronimo, S Srivastava, M Tulsiani
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
282021
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
282014
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
27*2017
Sum-of-squares lower bounds for sparse independent set
C Jones, A Potechin, G Rajendran, M Tulsiani, J Xu
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
252022
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20