 | 2009 |
|---|
| 12 |       | Sanjeev Arora,
David Steurer,
Avi Wigderson:
Towards a Study of Low-Complexity Graphs.
ICALP (1) 2009: 119-131 |
| 11 | | Prasad Raghavendra,
David Steurer:
Towards computing the Grothendieck constant.
SODA 2009: 525-534 |
| 10 | | Sanjeev Arora,
Constantinos Daskalakis,
David Steurer:
Message passing algorithms and improved LP decoding.
STOC 2009: 3-12 |
| 2008 |
|---|
| 9 | | Boaz Barak,
Moritz Hardt,
Ishay Haviv,
Anup Rao,
Oded Regev,
David Steurer:
Rounding Parallel Repetitions of Unique Games.
FOCS 2008: 374-383 |
| 8 | | Markus Bläser,
Moritz Hardt,
David Steurer:
Asymptotically Optimal Hitting Sets Against Polynomials.
ICALP (1) 2008: 345-356 |
| 7 | | 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 |
| 6 | | Peter Sanders,
David Steurer:
An asymptotic approximation scheme for multigraph edge coloring.
ACM Transactions on Algorithms 4(2): (2008) |
| 2007 |
|---|
| 5 | | Benjamin Doerr,
Johannes Lengler,
David Steurer:
The Interval Liar Game.
Electronic Notes in Discrete Mathematics 28: 425-432 (2007) |
| 2006 |
|---|
| 4 | | Benjamin Doerr,
Johannes Lengler,
David Steurer:
The Interval Liar Game.
ISAAC 2006: 318-327 |
| 3 | | David Steurer:
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs.
SPAA 2006: 197-206 |
| 2 | | David Steurer:
Tight Bounds for the Min-Max Boundary Decomposition Cost of Weighted Graphs
CoRR abs/cs/0606001: (2006) |
| 2005 |
|---|
| 1 | | Peter Sanders,
David Steurer:
An asymptotic approximation scheme for multigraph edge coloring.
SODA 2005: 897-906 |
