|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 6 keywords
|
|
|
|
|
Results
Found 30 publication records. Showing 30 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Moritz Hardt, Nikhil Srivastava, Madhur Tulsiani |
Graph densification.  |
ITCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhur Tulsiani, Julia Wolf |
Quadratic Goldreich-Levin Theorems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sushant Sachdeva, Madhur Tulsiani |
Cuts in Cartesian Products of Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Madhur Tulsiani, Julia Wolf |
Quadratic Goldreich-Levin Theorems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Amit Deshpande, Madhur Tulsiani, Nisheeth K. Vishnoi |
Algorithms and Hardness for Subspace Approximation. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi |
On LP-Based Approximability for Strict CSPs. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Madhur Tulsiani, Julia Wolf |
Quadratic Goldreich-Levin Theorems. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra, David Steurer, Madhur Tulsiani |
Reductions Between Expansion Problems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Prasad Raghavendra, David Steurer, Madhur Tulsiani |
Reductions Between Expansion Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Subhash Khot, Ryan O'Donnell, Preyas Popat, Madhur Tulsiani, Yi Wu |
SDP Gaps for 2-to-1 and Other Label-Cover Variants. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Luca Trevisan, Madhur Tulsiani |
Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. |
CRYPTO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani |
Improved Pseudorandom Generators for Depth 2 Circuits. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi |
On the Optimality of a Class of LP-based Algorithms. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani |
Improved Pseudorandom Generators for Depth 2 Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Luca Trevisan, Madhur Tulsiani |
Non-uniform attacks against one-way functions and PRGs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Avner Magen, Madhur Tulsiani |
Optimal Sherali-Adams Gaps from Pairwise Independence. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Amit Deshpande, Kasturi R. Varadarajan, Madhur Tulsiani, Nisheeth K. Vishnoi |
Algorithms and Hardness for Subspace Approximation |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi |
On the Optimality of a Class of LP-based Algorithms |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Avner Magen, Madhur Tulsiani |
Optimal Sherali-Adams Gaps from Pairwise Independence. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhur Tulsiani |
CSP gaps and reductions in the lasserre hierarchy. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
constraint satisfaction, semidefinite programming, integrality gaps |
| 1 | Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
Dense Subsets of Pseudorandom Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Madhur Tulsiani |
CSP Gaps and Reductions in the Lasserre Hierarchy. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan |
Dense Subsets of Pseudorandom Sets. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi |
Unique games on expanding constraint graphs are easy: extended abstract. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithms, semidefinite programming, expander graphs |
| 1 | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani |
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani |
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
Lovasz-Schrijver hierarchy, approximation algorithms, linear programming, integrality gap |
| 1 | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani |
Tight Integrality Gaps for Lovasz-Schrijver LP Relaxations of Vertex Cover and Max Cut. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani |
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
Displaying result #1 - #30 of 30 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")