Travelled to:1 × Canada
1 × Greece
1 × Iceland
5 × USA
Collaborated with:P.Raghavendra B.Barak J.A.Kelner S.Arora I.Dinur J.R.Lee P.Tetali A.Wigderson C.Daskalakis M.Bläser M.Hardt F.G.S.L.Brandão A.W.Harrow Y.Zhou S.Khot A.Kolla M.Tulsiani N.K.Vishnoi
Talks about:graph (4) squar (3) sum (3) uniqu (2) relax (2) game (2) hypercontract (1) semidefinit (1) isoperimetr (1) dictionari (1)
Person: David Steurer
DBLP: Steurer:David
Contributed to:
2015201420122010
2009200920082008Wrote 11 papers:
- STOC-2015-BarakKS #composition #learning #taxonomy
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method (BB, JAK, DS), pp. 143–151.
- STOC-2015-LeeRS #bound #programming
- Lower Bounds on the Size of Semidefinite Programming Relaxations (JRL, PR, DS), pp. 567–576.
- STOC-2014-BarakKS
- Rounding sum-of-squares relaxations (BB, JAK, DS), pp. 31–40.
- STOC-2014-DinurS #approach #parallel
- Analytical approach to parallel repetition (ID, DS), pp. 624–633.
- STOC-2012-BarakBHKSZ #proving
- Hypercontractivity, sum-of-squares proofs, and their applications (BB, FGSLB, AWH, JAK, DS, YZ), pp. 307–326.
- STOC-2010-RaghavendraS #game studies #graph
- Graph expansion and the unique games conjecture (PR, DS), pp. 755–764.
- STOC-2010-RaghavendraST #approximate #graph #parametricity
- Approximations for the isoperimetric and spectral profile of graphs and related parameters (PR, DS, PT), pp. 631–640.
- ICALP-v1-2009-AroraSW #case study #graph #towards
- Towards a Study of Low-Complexity Graphs (SA, DS, AW), pp. 119–131.
- STOC-2009-AroraDS #algorithm #message passing
- Message passing algorithms and improved LP decoding (SA, CD, DS), pp. 3–12.
- ICALP-A-2008-BlaserHS #set
- Asymptotically Optimal Hitting Sets Against Polynomials (MB, MH, DS), pp. 345–356.
- STOC-2008-AroraKKSTV #constraints #game studies #graph
- Unique games on expanding constraint graphs are easy: extended abstract (SA, SK, AK, DS, MT, NKV), pp. 21–28.