The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean Functions. - Ryan O'Donnell; John Wright 004; Yuan Zhou 007 (ICALP (1), 2011)

A New Point of NP-Hardness for 2-to-1 Label Cover. - Per Austrin; Ryan O'Donnell; John Wright 004 (APPROX-RANDOM, 2012)

A new point of NP-hardness for unique games. - Ryan O'Donnell; John Wright 004 (STOC, 2012)

Decision Trees, Protocols, and the Fourier Entropy-Influence Conjecture. - Andrew Wan; John Wright 004; Chenggang Wu 003 (CoRR, 2013)

A Composition Theorem for Parity Kill Number. - Ryan O'Donnell; John Wright 004; Yu Zhao 032; Xiaorui Sun; Li-Yang Tan (CCC, 2014)

Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs. - Madhur Tulsiani; John Wright 004; Yuan Zhou 007 (ICALP (1), 2014)

Decision trees, protocols and the entropy-influence conjecture. - Andrew Wan; John Wright 004; Chenggang Wu 003 (ITCS, 2014)

Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs. - Ryan O'Donnell; John Wright 004; Chenggang Wu 003; Yuan Zhou 007 (SODA, 2014)

New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover. - Per Austrin; Ryan O'Donnell; Li-Yang Tan; John Wright 004 (ACM Trans. Comput. Theory, 2014)

Adaptivity Helps for Testing Juntas. - Rocco A. Servedio; Li-Yang Tan; John Wright 004 (CCC, 2015)

Quantum Spectrum Testing. - Ryan O'Donnell; John Wright 004 (STOC, 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)

Efficient quantum tomography. - Ryan O'Donnell; John Wright 004 (STOC, 2016)

Efficient quantum tomography II. - Ryan O'Donnell; John Wright 004 (STOC, 2017)

Improved and simplified inapproximability for k-means. - Euiwoong Lee; Melanie Schmidt 001; John Wright 004 (Inf. Process. Lett., 2017)

Guest Column: A Primer on the Statistics of Longest Increasing Subsequences and Quantum States (Shortened Version). - Ryan O'Donnell; John Wright 004 (SIGACT News, 2017)

Improved NP-Inapproximability for 2-Variable Linear Equations. - Johan Håstad; Sangxia Huang; Rajsekar Manokaran; Ryan O'Donnell; John Wright 004 (Theory Comput., 2017)

Which Distribution Distances are Sublinearly Testable? - Constantinos Daskalakis; Gautam Kamath 001; John Wright 004 (Electron. Colloquium Comput. Complex., 2018)

NEEXP is Contained in MIP. - Anand Natarajan 001; John Wright 004 (FOCS, 2019)

Quantum state certification. - Costin Badescu; Ryan O'Donnell; John Wright 004 (STOC, 2019)

NEEXP in MIP. - Anand Natarajan 001; John Wright 004 (CoRR, 2019)

Quantum soundness of the classical low individual degree test. - Zhengfeng Ji; Anand Natarajan 001; Thomas Vidick; John Wright 004; Henry Yuen (CoRR, 2020)

Quantum soundness of testing tensor codes. - Zhengfeng Ji; Anand Natarajan 001; Thomas Vidick; John Wright 004; Henry Yuen (FOCS, 2021)

MIP* = RE. - Zhengfeng Ji; Anand Natarajan 001; Thomas Vidick; John Wright 004; Henry Yuen (Commun. ACM, 2021)

Unique Games hardness of Quantum Max-Cut, and a vector-valued Borell's inequality. - Yeongwoo Hwang; Joe Neeman; Ojas Parekh; Kevin Thompson 007; John Wright 004 (CoRR, 2021)

Testing matrix product states. - Mehdi Soleimanifar; John Wright 004 (SODA, 2022)

Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequality. - Yeongwoo Hwang; Joe Neeman; Ojas Parekh; Kevin Thompson 007; John Wright 004 (SODA, 2023)

A one-query lower bound for unitary synthesis and breaking quantum cryptography. - Alex Lombardi; Fermi Ma; John Wright 004 (IACR Cryptol. ePrint Arch., 2023)

The State Hidden Subgroup Problem and an Efficient Algorithm for Locating Unentanglement. - Adam Bouland; Tudor Giurgica-Tiron; John Wright 004 (STOC, 2025)