Improved small-set expansion from higher eigenvalues - Ryan O'Donnell; David Witmer (CoRR, 2012)

Efficiency analysis of formally verified adaptive cruise controllers. - Sarah M. Loos; David Witmer; Peter Steenkiste; André Platzer (ITSC, 2013)

Sparsest cut on bounded treewidth graphs: algorithms and hardness results. - Anupam Gupta 001; Kunal Talwar; David Witmer (STOC, 2013)

Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch. - Ryan O'Donnell; David Witmer (CCC, 2014)

How to Refute a Random CSP. - Sarah R. Allen; Ryan O'Donnell; David Witmer (FOCS, 2015)

Continuous analogues of the Most Informative Function problem. - Guy Kindler; Ryan O'Donnell; David Witmer (CoRR, 2015)

Beating the random assignment on constraint satisfaction problems of bounded degree. - Boaz Barak; Ankur Moitra; Ryan O'Donnell; Prasad Raghavendra; Oded Regev 001; David Steurer; Luca Trevisan 001; Aravindan Vijayaraghavan; David Witmer; John Wright 004 (Electron. Colloquium Comput. Complex., 2015)

Lower Bounds for CSP Refutation by SDP Hierarchies. - Ryuhei Mori; David Witmer (APPROX-RANDOM, 2016)

Sum of squares lower bounds for refuting any CSP. - Pravesh K. Kothari; Ryuhei Mori; Ryan O'Donnell; David Witmer (STOC, 2017)