| CSP gaps and reductions in the Lasserre hierarchy M Tulsiani Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 173 | 2009 |
| 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 | 153 | 2008 |
| Reductions between expansion problems P Raghavendra, D Steurer, M Tulsiani 2012 IEEE 27th Conference on Computational Complexity, 64-73, 2012 | 140 | 2012 |
| Convex relaxations and integrality gaps E Chlamtac, M Tulsiani Handbook on semidefinite, conic and polynomial optimization, 139-169, 2012 | 135 | 2012 |
| 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 | 133 | 2008 |
| Time space tradeoffs for attacks against one-way functions and PRGs A De, L Trevisan, M Tulsiani Annual Cryptology Conference, 649-665, 2010 | 119* | 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 | 98 | 2009 |
| 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 | 84 | 2007 |
| Improved pseudorandom generators for depth 2 circuits A De, O Etesami, L Trevisan, M Tulsiani International Workshop on Randomization and Approximation Techniques in …, 2010 | 76 | 2010 |
| SDP gaps from pairwise independence S Benabbas, K Georgiou, A Magen, M Tulsiani Theory of Computing 8 (1), 269-289, 2012 | 57 | 2012 |
| 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 | 57 | 2007 |
| 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 | 53 | 2019 |
| Algorithms and hardness for subspace approximation A Deshpande, M Tulsiani, NK Vishnoi Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 52 | 2011 |
| Optimal Sherali-Adams gaps from pairwise independence K Georgiou, A Magen, M Tulsiani International Workshop on Approximation Algorithms for Combinatorial …, 2009 | 39 | 2009 |
| 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 | 38* | 2011 |
| 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 | 36 | 2021 |
| 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 | 34 | 2014 |
| 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 | 32 | 2022 |
| 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 | 30 | 2014 |
| 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 | 29* | 2017 |
Luca TrevisanBocconi UniversityE-mail megerősítve itt: unibocconi.it
