BibTeX records: David Steurer

download as .bib file

@inproceedings{DBLP:conf/innovations/BarakKS19,
  author    = {Boaz Barak and
               Pravesh K. Kothari and
               David Steurer},
  title     = {Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture},
  booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
               2019, January 10-12, 2019, San Diego, California, {USA}},
  pages     = {9:1--9:12},
  year      = {2019},
  crossref  = {DBLP:conf/innovations/2019},
  url       = {https://doi.org/10.4230/LIPIcs.ITCS.2019.9},
  doi       = {10.4230/LIPIcs.ITCS.2019.9},
  timestamp = {Wed, 09 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/BarakKS19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KothariSS18,
  author    = {Pravesh K. Kothari and
               Jacob Steinhardt and
               David Steurer},
  title     = {Robust moment estimation and improved clustering via sum of squares},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {1035--1046},
  year      = {2018},
  crossref  = {DBLP:conf/stoc/2018},
  url       = {https://doi.org/10.1145/3188745.3188970},
  doi       = {10.1145/3188745.3188970},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/KothariSS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2018,
  editor    = {Eric Blais and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               David Steurer},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
               NJ, {USA}},
  series    = {LIPIcs},
  volume    = {116},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-085-9},
  isbn      = {978-3-95977-085-9},
  timestamp = {Wed, 15 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-08662,
  author    = {Boaz Barak and
               Pravesh K. Kothari and
               David Steurer},
  title     = {Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture},
  journal   = {CoRR},
  volume    = {abs/1804.08662},
  year      = {2018},
  url       = {http://arxiv.org/abs/1804.08662},
  archivePrefix = {arXiv},
  eprint    = {1804.08662},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1804-08662},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-11419,
  author    = {Prasad Raghavendra and
               Tselil Schramm and
               David Steurer},
  title     = {High-dimensional estimation via sum-of-squares proofs},
  journal   = {CoRR},
  volume    = {abs/1807.11419},
  year      = {2018},
  url       = {http://arxiv.org/abs/1807.11419},
  archivePrefix = {arXiv},
  eprint    = {1807.11419},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1807-11419},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakKS18,
  author    = {Boaz Barak and
               Pravesh Kothari and
               David Steurer},
  title     = {Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {77},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/077},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BarakKS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/PotechinS17,
  author    = {Aaron Potechin and
               David Steurer},
  title     = {Exact tensor completion with sum-of-squares},
  booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017,
               Amsterdam, The Netherlands, 7-10 July 2017},
  pages     = {1619--1673},
  year      = {2017},
  crossref  = {DBLP:conf/colt/2017},
  url       = {http://proceedings.mlr.press/v65/potechin17a.html},
  timestamp = {Wed, 16 Aug 2017 11:08:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colt/PotechinS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/SchrammS17,
  author    = {Tselil Schramm and
               David Steurer},
  title     = {Fast and robust tensor decomposition with applications to dictionary
               learning},
  booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017,
               Amsterdam, The Netherlands, 7-10 July 2017},
  pages     = {1760--1793},
  year      = {2017},
  crossref  = {DBLP:conf/colt/2017},
  url       = {http://proceedings.mlr.press/v65/schramm17a.html},
  timestamp = {Wed, 16 Aug 2017 11:08:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colt/SchrammS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HopkinsS17,
  author    = {Samuel B. Hopkins and
               David Steurer},
  title     = {Efficient Bayesian Estimation from Few Samples: Community Detection
               and Related Problems},
  booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2017, Berkeley, CA, USA, October 15-17, 2017},
  pages     = {379--390},
  year      = {2017},
  crossref  = {DBLP:conf/focs/2017},
  url       = {https://doi.org/10.1109/FOCS.2017.42},
  doi       = {10.1109/FOCS.2017.42},
  timestamp = {Tue, 04 Dec 2018 10:17:29 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/HopkinsS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HopkinsKPRSS17,
  author    = {Samuel B. Hopkins and
               Pravesh K. Kothari and
               Aaron Potechin and
               Prasad Raghavendra and
               Tselil Schramm and
               David Steurer},
  title     = {The Power of Sum-of-Squares for Detecting Hidden Structures},
  booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2017, Berkeley, CA, USA, October 15-17, 2017},
  pages     = {720--731},
  year      = {2017},
  crossref  = {DBLP:conf/focs/2017},
  url       = {https://doi.org/10.1109/FOCS.2017.72},
  doi       = {10.1109/FOCS.2017.72},
  timestamp = {Tue, 04 Dec 2018 10:17:29 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/HopkinsKPRSS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarakKS17,
  author    = {Boaz Barak and
               Pravesh K. Kothari and
               David Steurer},
  title     = {Quantum entanglement, sum of squares, and the log rank conjecture},
  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages     = {975--988},
  year      = {2017},
  crossref  = {DBLP:conf/stoc/2017},
  url       = {https://doi.org/10.1145/3055399.3055488},
  doi       = {10.1145/3055399.3055488},
  timestamp = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/BarakKS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarakKS17,
  author    = {Boaz Barak and
               Pravesh Kothari and
               David Steurer},
  title     = {Quantum entanglement, sum of squares, and the log rank conjecture},
  journal   = {CoRR},
  volume    = {abs/1701.06321},
  year      = {2017},
  url       = {http://arxiv.org/abs/1701.06321},
  archivePrefix = {arXiv},
  eprint    = {1701.06321},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BarakKS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PotechinS17,
  author    = {Aaron Potechin and
               David Steurer},
  title     = {Exact tensor completion with sum-of-squares},
  journal   = {CoRR},
  volume    = {abs/1702.06237},
  year      = {2017},
  url       = {http://arxiv.org/abs/1702.06237},
  archivePrefix = {arXiv},
  eprint    = {1702.06237},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/PotechinS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SchrammS17,
  author    = {Tselil Schramm and
               David Steurer},
  title     = {Fast and robust tensor decomposition with applications to dictionary
               learning},
  journal   = {CoRR},
  volume    = {abs/1706.08672},
  year      = {2017},
  url       = {http://arxiv.org/abs/1706.08672},
  archivePrefix = {arXiv},
  eprint    = {1706.08672},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/SchrammS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-00264,
  author    = {Samuel B. Hopkins and
               David Steurer},
  title     = {Bayesian estimation from few samples: community detection and related
               problems},
  journal   = {CoRR},
  volume    = {abs/1710.00264},
  year      = {2017},
  url       = {http://arxiv.org/abs/1710.00264},
  archivePrefix = {arXiv},
  eprint    = {1710.00264},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1710-00264},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-05017,
  author    = {Samuel B. Hopkins and
               Pravesh K. Kothari and
               Aaron Potechin and
               Prasad Raghavendra and
               Tselil Schramm and
               David Steurer},
  title     = {The power of sum-of-squares for detecting hidden structures},
  journal   = {CoRR},
  volume    = {abs/1710.05017},
  year      = {2017},
  url       = {http://arxiv.org/abs/1710.05017},
  archivePrefix = {arXiv},
  eprint    = {1710.05017},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1710-05017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-11581,
  author    = {Pravesh K. Kothari and
               David Steurer},
  title     = {Outlier-robust moment-estimation via sum-of-squares},
  journal   = {CoRR},
  volume    = {abs/1711.11581},
  year      = {2017},
  url       = {http://arxiv.org/abs/1711.11581},
  archivePrefix = {arXiv},
  eprint    = {1711.11581},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1711-11581},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakKS17,
  author    = {Boaz Barak and
               Pravesh Kothari and
               David Steurer},
  title     = {Quantum entanglement, sum of squares, and the log rank conjecture},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {11},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/011},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BarakKS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChanLRS16,
  author    = {Siu On Chan and
               James R. Lee and
               Prasad Raghavendra and
               David Steurer},
  title     = {Approximate Constraint Satisfaction Requires Large {LP} Relaxations},
  journal   = {J. {ACM}},
  volume    = {63},
  number    = {4},
  pages     = {34:1--34:22},
  year      = {2016},
  url       = {https://doi.org/10.1145/2811255},
  doi       = {10.1145/2811255},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/jacm/ChanLRS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MaSS16,
  author    = {Tengyu Ma and
               Jonathan Shi and
               David Steurer},
  title     = {Polynomial-Time Tensor Decompositions with Sum-of-Squares},
  booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
               2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
               {USA}},
  pages     = {438--446},
  year      = {2016},
  crossref  = {DBLP:conf/focs/2016},
  url       = {https://doi.org/10.1109/FOCS.2016.54},
  doi       = {10.1109/FOCS.2016.54},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/MaSS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HopkinsSSS16,
  author    = {Samuel B. Hopkins and
               Tselil Schramm and
               Jonathan Shi and
               David Steurer},
  title     = {Fast spectral algorithms from sum-of-squares proofs: tensor decomposition
               and planted sparse vectors},
  booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  pages     = {178--191},
  year      = {2016},
  crossref  = {DBLP:conf/stoc/2016},
  url       = {https://doi.org/10.1145/2897518.2897529},
  doi       = {10.1145/2897518.2897529},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/HopkinsSSS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MaSS16,
  author    = {Tengyu Ma and
               Jonathan Shi and
               David Steurer},
  title     = {Polynomial-time Tensor Decompositions with Sum-of-Squares},
  journal   = {CoRR},
  volume    = {abs/1610.01980},
  year      = {2016},
  url       = {http://arxiv.org/abs/1610.01980},
  archivePrefix = {arXiv},
  eprint    = {1610.01980},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/MaSS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DinurSV15,
  author    = {Irit Dinur and
               David Steurer and
               Thomas Vidick},
  title     = {A parallel repetition theorem for entangled projection games},
  journal   = {Computational Complexity},
  volume    = {24},
  number    = {2},
  pages     = {201--254},
  year      = {2015},
  url       = {https://doi.org/10.1007/s00037-015-0098-3},
  doi       = {10.1007/s00037-015-0098-3},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/cc/DinurSV15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AroraBS15,
  author    = {Sanjeev Arora and
               Boaz Barak and
               David Steurer},
  title     = {Subexponential Algorithms for Unique Games and Related Problems},
  journal   = {J. {ACM}},
  volume    = {62},
  number    = {5},
  pages     = {42:1--42:25},
  year      = {2015},
  url       = {https://doi.org/10.1145/2775105},
  doi       = {10.1145/2775105},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/jacm/AroraBS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BraunFPS15,
  author    = {G{\'{a}}bor Braun and
               Samuel Fiorini and
               Sebastian Pokutta and
               David Steurer},
  title     = {Approximation Limits of Linear Programs (Beyond Hierarchies)},
  journal   = {Math. Oper. Res.},
  volume    = {40},
  number    = {3},
  pages     = {756--772},
  year      = {2015},
  url       = {https://doi.org/10.1287/moor.2014.0694},
  doi       = {10.1287/moor.2014.0694},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/mor/BraunFPS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LetchfordLPS15,
  author    = {Adam N. Letchford and
               Jean B. Lasserre and
               Pablo A. Parrilo and
               David Steurer},
  title     = {The 2013 Newton Institute Programme on polynomial optimization},
  journal   = {Math. Program.},
  volume    = {151},
  number    = {2},
  pages     = {375--377},
  year      = {2015},
  url       = {https://doi.org/10.1007/s10107-015-0886-1},
  doi       = {10.1007/s10107-015-0886-1},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/mp/LetchfordLPS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarakGHMRS15,
  author    = {Boaz Barak and
               Parikshit Gopalan and
               Johan H{\aa}stad and
               Raghu Meka and
               Prasad Raghavendra and
               David Steurer},
  title     = {Making the Long Code Shorter},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {5},
  pages     = {1287--1324},
  year      = {2015},
  url       = {https://doi.org/10.1137/130929394},
  doi       = {10.1137/130929394},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/BarakGHMRS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BarakMORRSTVWW15,
  author    = {Boaz Barak and
               Ankur Moitra and
               Ryan O'Donnell and
               Prasad Raghavendra and
               Oded Regev and
               David Steurer and
               Luca Trevisan and
               Aravindan Vijayaraghavan and
               David Witmer and
               John Wright},
  title     = {Beating the Random Assignment on Constraint Satisfaction Problems
               of Bounded Degree},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
               NJ, {USA}},
  pages     = {110--123},
  year      = {2015},
  crossref  = {DBLP:conf/approx/2015},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.110},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2015.110},
  timestamp = {Mon, 11 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/approx/BarakMORRSTVWW15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/HopkinsSS15,
  author    = {Samuel B. Hopkins and
               Jonathan Shi and
               David Steurer},
  title     = {Tensor principal component analysis via sum-of-square proofs},
  booktitle = {Proceedings of The 28th Conference on Learning Theory, {COLT} 2015,
               Paris, France, July 3-6, 2015},
  pages     = {956--1006},
  year      = {2015},
  crossref  = {DBLP:conf/colt/2015},
  url       = {http://jmlr.org/proceedings/papers/v40/Hopkins15.html},
  timestamp = {Tue, 12 Jul 2016 21:51:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colt/HopkinsSS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarakKS15,
  author    = {Boaz Barak and
               Jonathan A. Kelner and
               David Steurer},
  title     = {Dictionary Learning and Tensor Decomposition via the Sum-of-Squares
               Method},
  booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
               of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
  pages     = {143--151},
  year      = {2015},
  crossref  = {DBLP:conf/stoc/2015},
  url       = {https://doi.org/10.1145/2746539.2746605},
  doi       = {10.1145/2746539.2746605},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/BarakKS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeRS15,
  author    = {James R. Lee and
               Prasad Raghavendra and
               David Steurer},
  title     = {Lower Bounds on the Size of Semidefinite Programming Relaxations},
  booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
               of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
  pages     = {567--576},
  year      = {2015},
  crossref  = {DBLP:conf/stoc/2015},
  url       = {https://doi.org/10.1145/2746539.2746599},
  doi       = {10.1145/2746539.2746599},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/LeeRS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarakMORRSTVWW15,
  author    = {Boaz Barak and
               Ankur Moitra and
               Ryan O'Donnell and
               Prasad Raghavendra and
               Oded Regev and
               David Steurer and
               Luca Trevisan and
               Aravindan Vijayaraghavan and
               David Witmer and
               John Wright},
  title     = {Beating the random assignment on constraint satisfaction problems
               of bounded degree},
  journal   = {CoRR},
  volume    = {abs/1505.03424},
  year      = {2015},
  url       = {http://arxiv.org/abs/1505.03424},
  archivePrefix = {arXiv},
  eprint    = {1505.03424},
  timestamp = {Mon, 11 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BarakMORRSTVWW15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HopkinsSS15,
  author    = {Samuel B. Hopkins and
               Jonathan Shi and
               David Steurer},
  title     = {Tensor principal component analysis via sum-of-squares proofs},
  journal   = {CoRR},
  volume    = {abs/1507.03269},
  year      = {2015},
  url       = {http://arxiv.org/abs/1507.03269},
  archivePrefix = {arXiv},
  eprint    = {1507.03269},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/HopkinsSS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HopkinsSSS15,
  author    = {Samuel B. Hopkins and
               Tselil Schramm and
               Jonathan Shi and
               David Steurer},
  title     = {Speeding up sum-of-squares for tensor decomposition and planted sparse
               vectors},
  journal   = {CoRR},
  volume    = {abs/1512.02337},
  year      = {2015},
  url       = {http://arxiv.org/abs/1512.02337},
  archivePrefix = {arXiv},
  eprint    = {1512.02337},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/HopkinsSSS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakMORRSTVWW15,
  author    = {Boaz Barak and
               Ankur Moitra and
               Ryan O'Donnell and
               Prasad Raghavendra and
               Oded Regev and
               David Steurer and
               Luca Trevisan and
               Aravindan Vijayaraghavan and
               David Witmer and
               John Wright},
  title     = {Beating the random assignment on constraint satisfaction problems
               of bounded degree},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {82},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/082},
  timestamp = {Mon, 11 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BarakMORRSTVWW15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LeeRST14,
  author    = {James R. Lee and
               Prasad Raghavendra and
               David Steurer and
               Ning Tan},
  title     = {On the Power of Symmetric {LP} and {SDP} Relaxations},
  booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
               BC, Canada, June 11-13, 2014},
  pages     = {13--21},
  year      = {2014},
  crossref  = {DBLP:conf/coco/2014},
  url       = {https://doi.org/10.1109/CCC.2014.10},
  doi       = {10.1109/CCC.2014.10},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/LeeRST14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DinurS14,
  author    = {Irit Dinur and
               David Steurer},
  title     = {Direct Product Testing},
  booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
               BC, Canada, June 11-13, 2014},
  pages     = {188--196},
  year      = {2014},
  crossref  = {DBLP:conf/coco/2014},
  url       = {https://doi.org/10.1109/CCC.2014.27},
  doi       = {10.1109/CCC.2014.27},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/DinurS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DinurSV14,
  author    = {Irit Dinur and
               David Steurer and
               Thomas Vidick},
  title     = {A Parallel Repetition Theorem for Entangled Projection Games},
  booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
               BC, Canada, June 11-13, 2014},
  pages     = {197--208},
  year      = {2014},
  crossref  = {DBLP:conf/coco/2014},
  url       = {https://doi.org/10.1109/CCC.2014.28},
  doi       = {10.1109/CCC.2014.28},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/coco/DinurSV14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarakKS14,
  author    = {Boaz Barak and
               Jonathan A. Kelner and
               David Steurer},
  title     = {Rounding sum-of-squares relaxations},
  booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
               May 31 - June 03, 2014},
  pages     = {31--40},
  year      = {2014},
  crossref  = {DBLP:conf/stoc/2014},
  url       = {https://doi.org/10.1145/2591796.2591886},
  doi       = {10.1145/2591796.2591886},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/BarakKS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DinurS14,
  author    = {Irit Dinur and
               David Steurer},
  title     = {Analytical approach to parallel repetition},
  booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
               May 31 - June 03, 2014},
  pages     = {624--633},
  year      = {2014},
  crossref  = {DBLP:conf/stoc/2014},
  url       = {https://doi.org/10.1145/2591796.2591884},
  doi       = {10.1145/2591796.2591884},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/DinurS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarakS14,
  author    = {Boaz Barak and
               David Steurer},
  title     = {Sum-of-squares proofs and the quest toward optimal algorithms},
  journal   = {CoRR},
  volume    = {abs/1404.5236},
  year      = {2014},
  url       = {http://arxiv.org/abs/1404.5236},
  archivePrefix = {arXiv},
  eprint    = {1404.5236},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BarakS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarakKS14,
  author    = {Boaz Barak and
               Jonathan A. Kelner and
               David Steurer},
  title     = {Dictionary Learning and Tensor Decomposition via the Sum-of-Squares
               Method},
  journal   = {CoRR},
  volume    = {abs/1407.1543},
  year      = {2014},
  url       = {http://arxiv.org/abs/1407.1543},
  archivePrefix = {arXiv},
  eprint    = {1407.1543},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BarakKS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeRS14,
  author    = {James R. Lee and
               Prasad Raghavendra and
               David Steurer},
  title     = {Lower bounds on the size of semidefinite programming relaxations},
  journal   = {CoRR},
  volume    = {abs/1411.6317},
  year      = {2014},
  url       = {http://arxiv.org/abs/1411.6317},
  archivePrefix = {arXiv},
  eprint    = {1411.6317},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/LeeRS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakS14,
  author    = {Boaz Barak and
               David Steurer},
  title     = {Sum-of-squares proofs and the quest toward optimal algorithms},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {59},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/059},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BarakS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChanLRS13,
  author    = {Siu On Chan and
               James R. Lee and
               Prasad Raghavendra and
               David Steurer},
  title     = {Approximate Constraint Satisfaction Requires Large {LP} Relaxations},
  booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  pages     = {350--359},
  year      = {2013},
  crossref  = {DBLP:conf/focs/2013},
  url       = {https://doi.org/10.1109/FOCS.2013.45},
  doi       = {10.1109/FOCS.2013.45},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/ChanLRS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BarakKS13,
  author    = {Boaz Barak and
               Guy Kindler and
               David Steurer},
  title     = {On the optimality of semidefinite relaxations for average-case and
               generalized constraint satisfaction},
  booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
               CA, USA, January 9-12, 2013},
  pages     = {197--214},
  year      = {2013},
  crossref  = {DBLP:conf/innovations/2013},
  url       = {https://doi.org/10.1145/2422436.2422460},
  doi       = {10.1145/2422436.2422460},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/BarakKS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-1979,
  author    = {Irit Dinur and
               David Steurer},
  title     = {Analytical Approach to Parallel Repetition},
  journal   = {CoRR},
  volume    = {abs/1305.1979},
  year      = {2013},
  url       = {http://arxiv.org/abs/1305.1979},
  archivePrefix = {arXiv},
  eprint    = {1305.1979},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1305-1979},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChanLRS13,
  author    = {Siu On Chan and
               James R. Lee and
               Prasad Raghavendra and
               David Steurer},
  title     = {Approximate Constraint Satisfaction Requires Large {LP} Relaxations},
  journal   = {CoRR},
  volume    = {abs/1309.0563},
  year      = {2013},
  url       = {http://arxiv.org/abs/1309.0563},
  archivePrefix = {arXiv},
  eprint    = {1309.0563},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/ChanLRS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DinurSV13,
  author    = {Irit Dinur and
               David Steurer and
               Thomas Vidick},
  title     = {A parallel repetition theorem for entangled projection games},
  journal   = {CoRR},
  volume    = {abs/1310.4113},
  year      = {2013},
  url       = {http://arxiv.org/abs/1310.4113},
  archivePrefix = {arXiv},
  eprint    = {1310.4113},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/DinurSV13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BarakKS13,
  author    = {Boaz Barak and
               Jonathan A. Kelner and
               David Steurer},
  title     = {Rounding Sum-of-Squares Relaxations},
  journal   = {CoRR},
  volume    = {abs/1312.6652},
  year      = {2013},
  url       = {http://arxiv.org/abs/1312.6652},
  archivePrefix = {arXiv},
  eprint    = {1312.6652},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BarakKS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurS13a,
  author    = {Irit Dinur and
               David Steurer},
  title     = {Direct Product Testing},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {179},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/179},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/DinurS13a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakKS13,
  author    = {Boaz Barak and
               Jonathan A. Kelner and
               David Steurer},
  title     = {Rounding Sum-of-Squares Relaxations},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {184},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/184},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BarakKS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/AroraDS12,
  author    = {Sanjeev Arora and
               Constantinos Daskalakis and
               David Steurer},
  title     = {Message-Passing Algorithms and Improved {LP} Decoding},
  journal   = {{IEEE} Trans. Information Theory},
  volume    = {58},
  number    = {12},
  pages     = {7260--7271},
  year      = {2012},
  url       = {https://doi.org/10.1109/TIT.2012.2208584},
  doi       = {10.1109/TIT.2012.2208584},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tit/AroraDS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/RaghavendraST12,
  author    = {Prasad Raghavendra and
               David Steurer and
               Madhur Tulsiani},
  title     = {Reductions between Expansion Problems},
  booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
               2012, Porto, Portugal, June 26-29, 2012},
  pages     = {64--73},
  year      = {2012},
  crossref  = {DBLP:conf/coco/2012},
  url       = {https://doi.org/10.1109/CCC.2012.43},
  doi       = {10.1109/CCC.2012.43},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/RaghavendraST12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarakGHMRS12,
  author    = {Boaz Barak and
               Parikshit Gopalan and
               Johan H{\aa}stad and
               Raghu Meka and
               Prasad Raghavendra and
               David Steurer},
  title     = {Making the Long Code Shorter},
  booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2012, New Brunswick, NJ, USA, October 20-23, 2012},
  pages     = {370--379},
  year      = {2012},
  crossref  = {DBLP:conf/focs/2012},
  url       = {https://doi.org/10.1109/FOCS.2012.83},
  doi       = {10.1109/FOCS.2012.83},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/BarakGHMRS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BraunFPS12,
  author    = {G{\'{a}}bor Braun and
               Samuel Fiorini and
               Sebastian Pokutta and
               David Steurer},
  title     = {Approximation Limits of Linear Programs (Beyond Hierarchies)},
  booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2012, New Brunswick, NJ, USA, October 20-23, 2012},
  pages     = {480--489},
  year      = {2012},
  crossref  = {DBLP:conf/focs/2012},
  url       = {https://doi.org/10.1109/FOCS.2012.10},
  doi       = {10.1109/FOCS.2012.10},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/BraunFPS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BarakBHKSZ12,
  author    = {Boaz Barak and
               Fernando G. S. L. Brand{\~{a}}o and
               Aram Wettroth Harrow and
               Jonathan A. Kelner and
               David Steurer and
               Yuan Zhou},
  title     = {Hypercontractivity, sum-of-squares proofs, and their applications},
  booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
               {STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
  pages     = {307--326},
  year      = {2012},
  crossref  = {DBLP:conf/stoc/2012},
  url       = {https://doi.org/10.1145/2213977.2214006},
  doi       = {10.1145/2213977.2214006},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/BarakBHKSZ12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-0957,
  author    = {G{\'{a}}bor Braun and
               Samuel Fiorini and
               Sebastian Pokutta and
               David Steurer},
  title     = {Approximation Limits of Linear Programs (Beyond Hierarchies)},
  journal   = {CoRR},
  volume    = {abs/1204.0957},
  year      = {2012},
  url       = {http://arxiv.org/abs/1204.0957},
  archivePrefix = {arXiv},
  eprint    = {1204.0957},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1204-0957},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-4484,
  author    = {Boaz Barak and
               Fernando G. S. L. Brand{\~{a}}o and
               Aram Wettroth Harrow and
               Jonathan A. Kelner and
               David Steurer and
               Yuan Zhou},
  title     = {Hypercontractivity, Sum-of-Squares Proofs, and their Applications},
  journal   = {CoRR},
  volume    = {abs/1205.4484},
  year      = {2012},
  url       = {http://arxiv.org/abs/1205.4484},
  archivePrefix = {arXiv},
  eprint    = {1205.4484},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1205-4484},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarakRS11,
  author    = {Boaz Barak and
               Prasad Raghavendra and
               David Steurer},
  title     = {Rounding Semidefinite Programming Hierarchies via Global Correlation},
  booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
               2011, Palm Springs, CA, USA, October 22-25, 2011},
  pages     = {472--481},
  year      = {2011},
  crossref  = {DBLP:conf/focs/2011},
  url       = {https://doi.org/10.1109/FOCS.2011.95},
  doi       = {10.1109/FOCS.2011.95},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/BarakRS11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiMRSZ11,
  author    = {Venkatesan Guruswami and
               Yury Makarychev and
               Prasad Raghavendra and
               David Steurer and
               Yuan Zhou},
  title     = {Finding Almost-Perfect Graph Bisections},
  booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 7-9, 2011. Proceedings},
  pages     = {321--337},
  year      = {2011},
  crossref  = {DBLP:conf/innovations/2011},
  url       = {http://conference.itcs.tsinghua.edu.cn/ICS2011/content/papers/11.html},
  timestamp = {Wed, 19 Oct 2011 15:40:50 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/GuruswamiMRSZ11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BarakHHS11,
  author    = {Boaz Barak and
               Moritz Hardt and
               Thomas Holenstein and
               David Steurer},
  title     = {Subsampling Mathematical Relaxations and Average-case Complexity},
  booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
               2011},
  pages     = {512--531},
  year      = {2011},
  crossref  = {DBLP:conf/soda/2011},
  url       = {https://doi.org/10.1137/1.9781611973082.41},
  doi       = {10.1137/1.9781611973082.41},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/BarakHHS11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4680,
  author    = {Boaz Barak and
               Prasad Raghavendra and
               David Steurer},
  title     = {Rounding Semidefinite Programming Hierarchies via Global Correlation},
  journal   = {CoRR},
  volume    = {abs/1104.4680},
  year      = {2011},
  url       = {http://arxiv.org/abs/1104.4680},
  archivePrefix = {arXiv},
  eprint    = {1104.4680},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1104-4680},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-0405,
  author    = {Boaz Barak and
               Parikshit Gopalan and
               Johan H{\aa}stad and
               Raghu Meka and
               Prasad Raghavendra and
               David Steurer},
  title     = {Making the long code shorter, with applications to the Unique Games
               Conjecture},
  journal   = {CoRR},
  volume    = {abs/1111.0405},
  year      = {2011},
  url       = {http://arxiv.org/abs/1111.0405},
  archivePrefix = {arXiv},
  eprint    = {1111.0405},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1111-0405},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakRS11,
  author    = {Boaz Barak and
               Prasad Raghavendra and
               David Steurer},
  title     = {Rounding Semidefinite Programming Hierarchies via Global Correlation},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {65},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/065},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BarakRS11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakGHMRS11,
  author    = {Boaz Barak and
               Parikshit Gopalan and
               Johan H{\aa}stad and
               Raghu Meka and
               Prasad Raghavendra and
               David Steurer},
  title     = {Making the long code shorter, with applications to the Unique Games
               Conjecture},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {142},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/142},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BarakGHMRS11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Steurer10,
  author    = {David Steurer},
  title     = {Improved Rounding for Parallel Repeated Unique Games},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
               International Workshop, {RANDOM} 2010, Barcelona, Spain, September
               1-3, 2010. Proceedings},
  pages     = {724--737},
  year      = {2010},
  crossref  = {DBLP:conf/approx/2010},
  url       = {https://doi.org/10.1007/978-3-642-15369-3\_54},
  doi       = {10.1007/978-3-642-15369-3\_54},
  timestamp = {Thu, 15 Jun 2017 21:41:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/Steurer10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AroraBS10,
  author    = {Sanjeev Arora and
               Boaz Barak and
               David Steurer},
  title     = {Subexponential Algorithms for Unique Games and Related Problems},
  booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  pages     = {563--572},
  year      = {2010},
  crossref  = {DBLP:conf/focs/2010},
  url       = {https://doi.org/10.1109/FOCS.2010.59},
  doi       = {10.1109/FOCS.2010.59},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/AroraBS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Steurer10,
  author    = {David Steurer},
  title     = {Fast {SDP} Algorithms for Constraint Satisfaction Problems},
  booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  pages     = {684--697},
  year      = {2010},
  crossref  = {DBLP:conf/soda/2010},
  url       = {https://doi.org/10.1137/1.9781611973075.56},
  doi       = {10.1137/1.9781611973075.56},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/Steurer10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RaghavendraST10,
  author    = {Prasad Raghavendra and
               David Steurer and
               Prasad Tetali},
  title     = {Approximations for the isoperimetric and spectral profile of graphs
               and related parameters},
  booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
               2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  pages     = {631--640},
  year      = {2010},
  crossref  = {DBLP:conf/stoc/2010},
  url       = {https://doi.org/10.1145/1806689.1806776},
  doi       = {10.1145/1806689.1806776},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/RaghavendraST10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RaghavendraS10,
  author    = {Prasad Raghavendra and
               David Steurer},
  title     = {Graph expansion and the unique games conjecture},
  booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
               2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  pages     = {755--764},
  year      = {2010},
  crossref  = {DBLP:conf/stoc/2010},
  url       = {https://doi.org/10.1145/1806689.1806792},
  doi       = {10.1145/1806689.1806792},
  timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/RaghavendraS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-2586,
  author    = {Prasad Raghavendra and
               David Steurer and
               Madhur Tulsiani},
  title     = {Reductions Between Expansion Problems},
  journal   = {CoRR},
  volume    = {abs/1011.2586},
  year      = {2010},
  url       = {http://arxiv.org/abs/1011.2586},
  archivePrefix = {arXiv},
  eprint    = {1011.2586},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1011-2586},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AroraIMS10,
  author    = {Sanjeev Arora and
               Russell Impagliazzo and
               William Matthews and
               David Steurer},
  title     = {Improved Algorithms for Unique Games via Divide and Conquer},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {41},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/041},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/AroraIMS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RaghavendraST10,
  author    = {Prasad Raghavendra and
               David Steurer and
               Madhur Tulsiani},
  title     = {Reductions Between Expansion Problems},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {172},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/172},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/RaghavendraST10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RaghavendraS09,
  author    = {Prasad Raghavendra and
               David Steurer},
  title     = {Integrality Gaps for Strong {SDP} Relaxations of {UNIQUE} {GAMES}},
  booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
  pages     = {575--585},
  year      = {2009},
  crossref  = {DBLP:conf/focs/2009},
  url       = {https://doi.org/10.1109/FOCS.2009.73},
  doi       = {10.1109/FOCS.2009.73},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/RaghavendraS09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RaghavendraS09a,
  author    = {Prasad Raghavendra and
               David Steurer},
  title     = {How to Round Any {CSP}},
  booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
  pages     = {586--594},
  year      = {2009},
  crossref  = {DBLP:conf/focs/2009},
  url       = {https://doi.org/10.1109/FOCS.2009.74},
  doi       = {10.1109/FOCS.2009.74},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/RaghavendraS09a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AroraSW09,
  author    = {Sanjeev Arora and
               David Steurer and
               Avi Wigderson},
  title     = {Towards a Study of Low-Complexity Graphs},
  booktitle = {Automata, Languages and Programming, 36th International Colloquium,
               {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
  pages     = {119--131},
  year      = {2009},
  crossref  = {DBLP:conf/icalp/2009-1},
  url       = {https://doi.org/10.1007/978-3-642-02927-1\_12},
  doi       = {10.1007/978-3-642-02927-1\_12},
  timestamp = {Tue, 23 May 2017 01:08:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/AroraSW09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RaghavendraS09,
  author    = {Prasad Raghavendra and
               David Steurer},
  title     = {Towards computing the Grothendieck constant},
  booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages     = {525--534},
  year      = {2009},
  crossref  = {DBLP:conf/soda/2009},
  url       = {http://dl.acm.org/citation.cfm?id=1496770.1496828},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/RaghavendraS09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AroraDS09,
  author    = {Sanjeev Arora and
               Constantinos Daskalakis and
               David Steurer},
  title     = {Message passing algorithms and improved {LP} decoding},
  booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
               {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
  pages     = {3--12},
  year      = {2009},
  crossref  = {DBLP:conf/stoc/2009},
  url       = {https://doi.org/10.1145/1536414.1536418},
  doi       = {10.1145/1536414.1536418},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/AroraDS09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-5526,
  author    = {Boaz Barak and
               Moritz Hardt and
               Thomas Holenstein and
               David Steurer},
  title     = {Subsampling Semidefinite Programs and Max-Cut on the Sphere},
  journal   = {CoRR},
  volume    = {abs/0911.5526},
  year      = {2009},
  url       = {http://arxiv.org/abs/0911.5526},
  archivePrefix = {arXiv},
  eprint    = {0911.5526},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-0911-5526},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SteurerV09,
  author    = {David Steurer and
               Nisheeth K. Vishnoi},
  title     = {Connections Between Unique Games and Multicut},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {125},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/125},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/SteurerV09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakHHS09,
  author    = {Boaz Barak and
               Moritz Hardt and
               Thomas Holenstein and
               David Steurer},
  title     = {Subsampling Semidefinite Programs and Max-Cut on the Sphere},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {129},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/129},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BarakHHS09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SandersS08,
  author    = {Peter Sanders and
               David Steurer},
  title     = {An asymptotic approximation scheme for multigraph edge coloring},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {21:1--21:24},
  year      = {2008},
  url       = {https://doi.org/10.1145/1361192.1361198},
  doi       = {10.1145/1361192.1361198},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/talg/SandersS08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarakHHRRS08,
  author    = {Boaz Barak and
               Moritz Hardt and
               Ishay Haviv and
               Anup Rao and
               Oded Regev and
               David Steurer},
  title     = {Rounding Parallel Repetitions of Unique Games},
  booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2008, October 25-28, 2008, Philadelphia, PA, {USA}},
  pages     = {374--383},
  year      = {2008},
  crossref  = {DBLP:conf/focs/2008},
  url       = {https://doi.org/10.1109/FOCS.2008.55},
  doi       = {10.1109/FOCS.2008.55},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/BarakHHRRS08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BlaserHS08,
  author    = {Markus Bl{\"{a}}ser and
               Moritz Hardt and
               David Steurer},
  title     = {Asymptotically Optimal Hitting Sets Against Polynomials},
  booktitle = {Automata, Languages and Programming, 35th International Colloquium,
               {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
               {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  pages     = {345--356},
  year      = {2008},
  crossref  = {DBLP:conf/icalp/2008-1},
  url       = {https://doi.org/10.1007/978-3-540-70575-8\_29},
  doi       = {10.1007/978-3-540-70575-8\_29},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/BlaserHS08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AroraKKSTV08,
  author    = {Sanjeev Arora and
               Subhash Khot and
               Alexandra Kolla and
               David Steurer and
               Madhur Tulsiani and
               Nisheeth K. Vishnoi},
  title     = {Unique games on expanding constraint graphs are easy: extended abstract},
  booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
               Victoria, British Columbia, Canada, May 17-20, 2008},
  pages     = {21--28},
  year      = {2008},
  crossref  = {DBLP:conf/stoc/2008},
  url       = {https://doi.org/10.1145/1374376.1374380},
  doi       = {10.1145/1374376.1374380},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/AroraKKSTV08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/DoerrLS07,
  author    = {Benjamin Doerr and
               Johannes Lengler and
               David Steurer},
  title     = {The Interval Liar Game},
  journal   = {Electronic Notes in Discrete Mathematics},
  volume    = {28},
  pages     = {425--432},
  year      = {2007},
  url       = {https://doi.org/10.1016/j.endm.2007.01.060},
  doi       = {10.1016/j.endm.2007.01.060},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/endm/DoerrLS07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DoerrLS06,
  author    = {Benjamin Doerr and
               Johannes Lengler and
               David Steurer},
  title     = {The Interval Liar Game},
  booktitle = {Algorithms and Computation, 17th International Symposium, {ISAAC}
               2006, Kolkata, India, December 18-20, 2006, Proceedings},
  pages     = {318--327},
  year      = {2006},
  crossref  = {DBLP:conf/isaac/2006},
  url       = {https://doi.org/10.1007/11940128\_33},
  doi       = {10.1007/11940128\_33},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/DoerrLS06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Steurer06,
  author    = {David Steurer},
  title     = {Tight bounds for the Min-Max boundary decomposition cost of weighted
               graphs},
  booktitle = {{SPAA} 2006: Proceedings of the 18th Annual {ACM} Symposium on Parallelism
               in Algorithms and Architectures, Cambridge, Massachusetts, USA, July
               30 - August 2, 2006},
  pages     = {197--206},
  year      = {2006},
  crossref  = {DBLP:conf/spaa/2006},
  url       = {https://doi.org/10.1145/1148109.1148142},
  doi       = {10.1145/1148109.1148142},
  timestamp = {Wed, 21 Nov 2018 11:13:10 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/spaa/Steurer06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0606001,
  author    = {David Steurer},
  title     = {Tight Bounds for the Min-Max Boundary Decomposition Cost of Weighted
               Graphs},
  journal   = {CoRR},
  volume    = {abs/cs/0606001},
  year      = {2006},
  url       = {http://arxiv.org/abs/cs/0606001},
  archivePrefix = {arXiv},
  eprint    = {cs/0606001},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-cs-0606001},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SandersS05,
  author    = {Peter Sanders and
               David Steurer},
  title     = {An asymptotic approximation scheme for multigraph edge coloring},
  booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
               23-25, 2005},
  pages     = {897--906},
  year      = {2005},
  crossref  = {DBLP:conf/soda/2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432.1070559},
  timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/SandersS05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2019,
  editor    = {Avrim Blum},
  title     = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
               2019, January 10-12, 2019, San Diego, California, {USA}},
  series    = {LIPIcs},
  volume    = {124},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-095-8},
  isbn      = {978-3-95977-095-8},
  timestamp = {Tue, 08 Jan 2019 13:39:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2018,
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  publisher = {{ACM}},
  year      = {2018},
  url       = {http://dl.acm.org/citation.cfm?id=3188745},
  timestamp = {Thu, 21 Jun 2018 08:21:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/colt/2017,
  editor    = {Satyen Kale and
               Ohad Shamir},
  title     = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017,
               Amsterdam, The Netherlands, 7-10 July 2017},
  series    = {Proceedings of Machine Learning Research},
  volume    = {65},
  publisher = {{PMLR}},
  year      = {2017},
  url       = {http://jmlr.org/proceedings/papers/v65/},
  timestamp = {Wed, 16 Aug 2017 11:08:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colt/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2017,
  editor    = {Chris Umans},
  title     = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2017, Berkeley, CA, USA, October 15-17, 2017},
  publisher = {{IEEE} Computer Society},
  year      = {2017},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8100284},
  isbn      = {978-1-5386-3464-6},
  timestamp = {Tue, 04 Dec 2018 10:17:29 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2017,
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  publisher = {{ACM}},
  year      = {2017},
  url       = {https://doi.org/10.1145/3055399},
  doi       = {10.1145/3055399},
  isbn      = {978-1-4503-4528-6},
  timestamp = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2016,
  editor    = {Irit Dinur},
  title     = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
               2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
               {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2016},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7781469},
  isbn      = {978-1-5090-3933-3},
  timestamp = {Tue, 20 Dec 2016 16:13:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2016,
  editor    = {Daniel Wichs and
               Yishay Mansour},
  title     = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  publisher = {{ACM}},
  year      = {2016},
  url       = {http://dl.acm.org/citation.cfm?id=2897518},
  isbn      = {978-1-4503-4132-5},
  timestamp = {Fri, 10 Jun 2016 10:30:30 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2015,
  editor    = {Naveen Garg and
               Klaus Jansen and
               Anup Rao and
               Jos{\'{e}} D. P. Rolim},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
               NJ, {USA}},
  series    = {LIPIcs},
  volume    = {40},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2015},
  url       = {http://www.dagstuhl.de/dagpub/978-3-939897-89-7},
  isbn      = {978-3-939897-89-7},
  timestamp = {Wed, 14 Feb 2018 13:29:27 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/colt/2015,
  editor    = {Peter Gr{\"{u}}nwald and
               Elad Hazan and
               Satyen Kale},
  title     = {Proceedings of The 28th Conference on Learning Theory, {COLT} 2015,
               Paris, France, July 3-6, 2015},
  series    = {{JMLR} Workshop and Conference Proceedings},
  volume    = {40},
  publisher = {JMLR.org},
  year      = {2015},
  url       = {http://jmlr.org/proceedings/papers/v40/},
  timestamp = {Tue, 12 Jul 2016 21:51:13 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colt/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2015,
  editor    = {Rocco A. Servedio and
               Ronitt Rubinfeld},
  title     = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
               of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
  publisher = {{ACM}},
  year      = {2015},
  url       = {http://dl.acm.org/citation.cfm?id=2746539},
  isbn      = {978-1-4503-3536-2},
  timestamp = {Wed, 10 Jun 2015 17:10:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2014,
  title     = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
               BC, Canada, June 11-13, 2014},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6875457},
  isbn      = {978-1-4799-3626-7},
  timestamp = {Fri, 13 May 2016 10:43:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2014,
  editor    = {David B. Shmoys},
  title     = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
               May 31 - June 03, 2014},
  publisher = {{ACM}},
  year      = {2014},
  url       = {http://dl.acm.org/citation.cfm?id=2591796},
  isbn      = {978-1-4503-2710-7},
  timestamp = {Wed, 29 Mar 2017 16:45:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2013,
  title     = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6685222},
  isbn      = {978-0-7695-5135-7},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2013,
  editor    = {Robert D. Kleinberg},
  title     = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
               CA, USA, January 9-12, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2422436},
  isbn      = {978-1-4503-1859-4},
  timestamp = {Sun, 17 Feb 2013 11:19:02 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2012,
  title     = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
               2012, Porto, Portugal, June 26-29, 2012},
  publisher = {{IEEE} Computer Society},
  year      = {2012},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6242817},
  isbn      = {978-1-4673-1663-7},
  timestamp = {Fri, 13 May 2016 10:26:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2012,
  title     = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2012, New Brunswick, NJ, USA, October 20-23, 2012},
  publisher = {{IEEE} Computer Society},
  year      = {2012},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6374356},
  isbn      = {978-1-4673-4383-1},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2012,
  editor    = {Howard J. Karloff and
               Toniann Pitassi},
  title     = {Proceedings of the 44th Symposium on Theory of Computing Conference,
               {STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
  publisher = {{ACM}},
  year      = {2012},
  url       = {http://dl.acm.org/citation.cfm?id=2213977},
  isbn      = {978-1-4503-1245-5},
  timestamp = {Tue, 22 May 2012 21:36:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2011,
  editor    = {Rafail Ostrovsky},
  title     = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
               2011, Palm Springs, CA, USA, October 22-25, 2011},
  publisher = {{IEEE} Computer Society},
  year      = {2011},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6108120},
  isbn      = {978-1-4577-1843-4},
  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2011,
  editor    = {Bernard Chazelle},
  title     = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 7-9, 2011. Proceedings},
  publisher = {Tsinghua University Press},
  year      = {2011},
  isbn      = {978-7-302-24517-9},
  timestamp = {Wed, 19 Oct 2011 15:40:50 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2011,
  editor    = {Dana Randall},
  title     = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
               2011},
  publisher = {{SIAM}},
  year      = {2011},
  url       = {https://doi.org/10.1137/1.9781611973082},
  doi       = {10.1137/1.9781611973082},
  isbn      = {978-0-89871-993-2},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2010,
  editor    = {Maria J. Serna and
               Ronen Shaltiel and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
               International Workshop, {RANDOM} 2010, Barcelona, Spain, September
               1-3, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6302},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-15369-3},
  doi       = {10.1007/978-3-642-15369-3},
  isbn      = {978-3-642-15368-6},
  timestamp = {Thu, 15 Jun 2017 21:41:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2010,
  title     = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2010},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5669376},
  isbn      = {978-0-7695-4244-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2010,
  editor    = {Moses Charikar},
  title     = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  publisher = {{SIAM}},
  year      = {2010},
  url       = {https://doi.org/10.1137/1.9781611973075},
  doi       = {10.1137/1.9781611973075},
  isbn      = {978-0-89871-701-3},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2010,
  editor    = {Leonard J. Schulman},
  title     = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
               2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  publisher = {{ACM}},
  year      = {2010},
  isbn      = {978-1-4503-0050-6},
  timestamp = {Fri, 12 Oct 2012 12:16:22 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2009,
  title     = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2009},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5438528},
  isbn      = {978-0-7695-3850-1},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2009-1,
  editor    = {Susanne Albers and
               Alberto Marchetti{-}Spaccamela and
               Yossi Matias and
               Sotiris E. Nikoletseas and
               Wolfgang Thomas},
  title     = {Automata, Languages and Programming, 36th International Colloquium,
               {ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {5555},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-02927-1},
  doi       = {10.1007/978-3-642-02927-1},
  isbn      = {978-3-642-02926-4},
  timestamp = {Tue, 23 May 2017 01:08:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2009-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2009,
  editor    = {Claire Mathieu},
  title     = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  publisher = {{SIAM}},
  year      = {2009},
  url       = {https://doi.org/10.1137/1.9781611973068},
  doi       = {10.1137/1.9781611973068},
  isbn      = {978-0-89871-680-1},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2009,
  editor    = {Michael Mitzenmacher},
  title     = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
               {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
  publisher = {{ACM}},
  year      = {2009},
  isbn      = {978-1-60558-506-2},
  timestamp = {Fri, 05 Jun 2009 09:31:27 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2008,
  title     = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2008, October 25-28, 2008, Philadelphia, PA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2008},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4690923},
  isbn      = {978-0-7695-3436-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2008-1,
  editor    = {Luca Aceto and
               Ivan Damg{\aa}rd and
               Leslie Ann Goldberg and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Anna Ing{\'{o}}lfsd{\'{o}}ttir and
               Igor Walukiewicz},
  title     = {Automata, Languages and Programming, 35th International Colloquium,
               {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
               {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  series    = {Lecture Notes in Computer Science},
  volume    = {5125},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-70575-8},
  doi       = {10.1007/978-3-540-70575-8},
  isbn      = {978-3-540-70574-1},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2008-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2008,
  editor    = {Cynthia Dwork},
  title     = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
               Victoria, British Columbia, Canada, May 17-20, 2008},
  publisher = {{ACM}},
  year      = {2008},
  isbn      = {978-1-60558-047-0},
  timestamp = {Sat, 19 Jun 2010 14:44:24 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2006,
  editor    = {Tetsuo Asano},
  title     = {Algorithms and Computation, 17th International Symposium, {ISAAC}
               2006, Kolkata, India, December 18-20, 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4288},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11940128},
  doi       = {10.1007/11940128},
  isbn      = {3-540-49694-7},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/spaa/2006,
  editor    = {Phillip B. Gibbons and
               Uzi Vishkin},
  title     = {{SPAA} 2006: Proceedings of the 18th Annual {ACM} Symposium on Parallelism
               in Algorithms and Architectures, Cambridge, Massachusetts, USA, July
               30 - August 2, 2006},
  publisher = {{ACM}},
  year      = {2006},
  url       = {https://doi.org/10.1145/1148109},
  doi       = {10.1145/1148109},
  isbn      = {1-59593-452-9},
  timestamp = {Wed, 21 Nov 2018 11:13:10 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/spaa/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2005,
  title     = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
               23-25, 2005},
  publisher = {{SIAM}},
  year      = {2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432},
  isbn      = {0-89871-585-7},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier