Clik here to view.
An asymptotic approximation scheme for multigraph edge coloring.
Peter Sanders, David Steurer: An asymptotic approximation scheme for multigraph edge coloring. SODA 2005: 897-906
View ArticleClik here to view.
Tight Bounds for the Min-Max Boundary Decomposition Cost of Weighted Graphs.
David Steurer: Tight Bounds for the Min-Max Boundary Decomposition Cost of Weighted Graphs. CoRR abs/cs/0606001 (2006)
View ArticleClik here to view.
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs.
David Steurer: Tight bounds for the Min-Max boundary decomposition cost of weighted graphs. SPAA 2006: 197-206
View ArticleClik here to view.
The Interval Liar Game.
Benjamin Doerr, Johannes Lengler, David Steurer: The Interval Liar Game. ISAAC 2006: 318-327
View ArticleClik here to view.
The Interval Liar Game.
Benjamin Doerr, Johannes Lengler, David Steurer: The Interval Liar Game. Electron. Notes Discret. Math. 28: 425-432 (2007)
View ArticleClik here to view.
Unique games on expanding constraint graphs are easy: extended abstract.
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: 21-28
View ArticleClik here to view.
Asymptotically Optimal Hitting Sets Against Polynomials.
Markus Bläser, Moritz Hardt, David Steurer: Asymptotically Optimal Hitting Sets Against Polynomials. ICALP (1) 2008: 345-356
View ArticleClik here to view.
Rounding Parallel Repetitions of Unique Games.
Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer: Rounding Parallel Repetitions of Unique Games. FOCS 2008: 374-383
View ArticleClik here to view.
An asymptotic approximation scheme for multigraph edge coloring.
Peter Sanders, David Steurer: An asymptotic approximation scheme for multigraph edge coloring. ACM Trans. Algorithms 4(2): 21:1-21:24 (2008)
View ArticleClik here to view.
Connections Between Unique Games and Multicut.
David Steurer, Nisheeth K. Vishnoi: Connections Between Unique Games and Multicut. Electron. Colloquium Comput. Complex. TR09 (2009)
View ArticleClik here to view.
Subsampling Semidefinite Programs and Max-Cut on the Sphere.
Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Semidefinite Programs and Max-Cut on the Sphere. Electron. Colloquium Comput. Complex. TR09 (2009)
View ArticleClik here to view.
Subsampling Semidefinite Programs and Max-Cut on the Sphere.
Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Semidefinite Programs and Max-Cut on the Sphere. CoRR abs/0911.5526 (2009)
View ArticleClik here to view.
Message passing algorithms and improved LP decoding.
Sanjeev Arora, Constantinos Daskalakis, David Steurer: Message passing algorithms and improved LP decoding. STOC 2009: 3-12
View ArticleClik here to view.
Towards computing the Grothendieck constant.
Prasad Raghavendra, David Steurer: Towards computing the Grothendieck constant. SODA 2009: 525-534
View ArticleClik here to view.
Towards a Study of Low-Complexity Graphs.
Sanjeev Arora, David Steurer, Avi Wigderson: Towards a Study of Low-Complexity Graphs. ICALP (1) 2009: 119-131
View ArticleClik here to view.
How to Round Any CSP.
Prasad Raghavendra, David Steurer: How to Round Any CSP. FOCS 2009: 586-594
View ArticleClik here to view.
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES.
Prasad Raghavendra, David Steurer: Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. FOCS 2009: 575-585
View ArticleClik here to view.
Reductions Between Expansion Problems.
Prasad Raghavendra, David Steurer, Madhur Tulsiani: Reductions Between Expansion Problems. Electron. Colloquium Comput. Complex. TR10 (2010)
View ArticleClik here to view.
Improved Algorithms for Unique Games via Divide and Conquer.
Sanjeev Arora, Russell Impagliazzo, William Matthews, David Steurer: Improved Algorithms for Unique Games via Divide and Conquer. Electron. Colloquium Comput. Complex. TR10 (2010)
View ArticleClik here to view.
Reductions Between Expansion Problems.
Prasad Raghavendra, David Steurer, Madhur Tulsiani: Reductions Between Expansion Problems. CoRR abs/1011.2586 (2010)
View Article