|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 25 occurrences of 19 keywords
|
|
|
|
|
Results
Found 34 publication records. Showing 34 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer |
Approximation Limits of Linear Programs (Beyond Hierarchies)  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Fernando G. S. L. Brandão, Aram Wettroth Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou |
Hypercontractivity, sum-of-squares proofs, and their applications. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Prasad Raghavendra, David Steurer |
Rounding Semidefinite Programming Hierarchies via Global Correlation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer |
Making the long code shorter, with applications to the Unique Games Conjecture. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer |
Making the long code shorter, with applications to the Unique Games Conjecture |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Prasad Raghavendra, David Steurer |
Rounding Semidefinite Programming Hierarchies via Global Correlation |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer |
Subsampling Mathematical Relaxations and Average-case Complexity. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou |
Finding Almost-Perfect Graph Bisections. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Prasad Raghavendra, David Steurer |
Rounding Semidefinite Programming Hierarchies via Global Correlation. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, Russell Impagliazzo, William Matthews, David Steurer |
Improved Algorithms for Unique Games via Divide and Conquer. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP 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 | David Steurer |
Fast SDP Algorithms for Constraint Satisfaction Problems. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Steurer |
Improved Rounding for Parallel Repeated Unique Games. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, Boaz Barak, David Steurer |
Subexponential Algorithms for Unique Games and Related Problems. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra, David Steurer |
Graph expansion and the unique games conjecture. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra, David Steurer, Prasad Tetali |
Approximations for the isoperimetric and spectral profile of graphs and related parameters. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
graph expansion, small-set expansion, sparse principal component analysis, spectral profile, approximation algorithm, semidefinite programming |
| 1 | Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer |
Subsampling Semidefinite Programs and Max-Cut on the Sphere. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Steurer, Nisheeth K. Vishnoi |
Connections Between Unique Games and Multicut. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer |
Subsampling Semidefinite Programs and Max-Cut on the Sphere |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Prasad Raghavendra, David Steurer |
Towards computing the Grothendieck constant. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora, David Steurer, Avi Wigderson |
Towards a Study of Low-Complexity Graphs. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prasad Raghavendra, David Steurer |
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
SDP hierarchies, Sherali-Adams hierarchy, integrality gap construction, approximation algorithms, semidefinite programming, hardness of approximation, unique games conjecture |
| 1 | Prasad Raghavendra, David Steurer |
How to Round Any CSP. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
rounding scheme, approximation algorithm, sensitivity analysis, semidefinite programming, constraint satisfaction problems, dimension reduction, integrality gap |
| 1 | Sanjeev Arora, Constantinos Daskalakis, David Steurer |
Message passing algorithms and improved LP decoding. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
lp decoding, min-sum algorithm, ldpc codes, message-passing algorithms |
| 1 | Peter Sanders, David Steurer |
An asymptotic approximation scheme for multigraph edge coloring. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
chromatic index, data migration, Edge coloring, multigraphs |
| 1 | Markus Bläser, Moritz Hardt, David Steurer |
Asymptotically Optimal Hitting Sets Against Polynomials. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer |
Rounding Parallel Repetitions of Unique Games. |
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 | Benjamin Doerr, Johannes Lengler, David Steurer |
The Interval Liar Game. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | David Steurer |
Tight Bounds for the Min-Max Boundary Decomposition Cost of Weighted Graphs |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | David Steurer |
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs. |
SPAA |
2006 |
DBLP DOI BibTeX RDF |
scheduling, load balancing, parallel computing, graph partitioning, graph separators |
| 1 | Benjamin Doerr, Johannes Lengler, David Steurer |
The Interval Liar Game. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Sanders, David Steurer |
An asymptotic approximation scheme for multigraph edge coloring. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #34 of 34 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")