☰

Madhur Tulsiani, Ph.D. - Publications

Affiliations: 
2009 Computer Science University of California, Berkeley, Berkeley, CA, United States 
Area:
Theory (THY), (Computational Complexity, Randomness in Computation, Combinatorial Optimization); Security (SEC)
Tree Info Similar researchers PubMed Report error

6 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2010 De A, Etesami O, Trevisan L, Tulsiani M. Improved pseudorandom generators for depth 2 circuits Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6302: 504-517. DOI: 10.1007/978-3-642-15369-3_38  0.402
2010 De A, Trevisan L, Tulsiani M. Time space tradeoffs for attacks against one-way functions and PRGs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6223: 649-665. DOI: 10.1007/978-3-642-14623-7_35  0.425
2009 Trevisan L, Tulsiani M, Vadhan S. Regularity, boosting, and efficiently simulating every high-entropy distribution Proceedings of the Annual Ieee Conference On Computational Complexity. 126-136. DOI: 10.1109/CCC.2009.41  0.381
2008 Reingold O, Trevisan L, Tulsiani M, Vadhan S. Dense subsets of pseudorandom sets Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 76-85. DOI: 10.1109/FOCS.2008.38  0.445
2007 Schoenebeck G, Trevisan L, Tulsiani M. Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut Proceedings of the Annual Acm Symposium On Theory of Computing. 302-310. DOI: 10.1145/1250790.1250836  0.541
2007 Schoenebeck G, Trevisan L, Tulsiani M. A linear round lower bound for Lovasz-Schrijver SDP relaxations of vertex cover Proceedings of the Annual Ieee Conference On Computational Complexity. 205-216. DOI: 10.1109/CCC.2007.2  0.548
Show low-probability matches.