Madhur Tulsiani, Ph.D.
Affiliations: | 2009 | Computer Science | University of California, Berkeley, Berkeley, CA, United States |
Area:
Theory (THY), (Computational Complexity, Randomness in Computation, Combinatorial Optimization); Security (SEC)Google:
"Madhur Tulsiani"Parents
Sign in to add mentor| Luca Trevisan | grad student | 2009 | UC Berkeley | |
| (Local constraints in combinatorial optimization.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| De A, Etesami O, Trevisan L, et al. (2010) 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 |
| De A, Trevisan L, Tulsiani M. (2010) 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 |
| Trevisan L, Tulsiani M, Vadhan S. (2009) Regularity, boosting, and efficiently simulating every high-entropy distribution Proceedings of the Annual Ieee Conference On Computational Complexity. 126-136 |
| Reingold O, Trevisan L, Tulsiani M, et al. (2008) Dense subsets of pseudorandom sets Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 76-85 |
| Schoenebeck G, Trevisan L, Tulsiani M. (2007) 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 |
| Schoenebeck G, Trevisan L, Tulsiani M. (2007) A linear round lower bound for Lovasz-Schrijver SDP relaxations of vertex cover Proceedings of the Annual Ieee Conference On Computational Complexity. 205-216 |