Data selection for speech recognition. - Yi Wu 002; Rong Zhang 003; Alexander I. Rudnicky (ASRU, 2007)

An optimal sdp algorithm for max-cut, and equally optimal long code tests. - Ryan O'Donnell; Yi Wu 002 (STOC, 2008)

3-bit dictator testing: 1 vs. 5/8. - Ryan O'Donnell; Yi Wu 002 (SODA, 2009)

Conditional hardness for satisfiable 3-CSPs. - Ryan O'Donnell; Yi Wu 002 (STOC, 2009)

Optimal lower bounds for locality sensitive hashing (except when q is tiny). - Ryan O'Donnell; Yi Wu 002; Yuan Zhou 007 (Electron. Colloquium Comput. Complex., 2009)

SDP Gaps for 2-to-1 and Other Label-Cover Variants. - Venkatesan Guruswami; Subhash Khot; Ryan O'Donnell; Preyas Popat; Madhur Tulsiani; Yi Wu 002 (ICALP (1), 2010)

Bypassing UGC from some optimal geometric inapproximability results. - Venkatesan Guruswami; Prasad Raghavendra; Rishi Saket; Yi Wu 002 (Electron. Colloquium Comput. Complex., 2010)

Fooling functions of halfspaces under product distributions. - Yi Wu 002; Ryan O'Donnell; David Zuckerman; Parikshit Gopalan (Electron. Colloquium Comput. Complex., 2010)

The Approximability of Learning and Constraint Satisfaction Problems. - Yi Wu 002 (2010)

Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions. - Ilias Diakonikolas; Ryan O'Donnell; Rocco A. Servedio; Yi Wu 002 (SODA, 2011)

On the hardness of pricing loss-leaders. - Preyas Popat; Yi Wu 002 (SODA, 2012)

Pricing Loss Leaders Can be Hard. - Yi Wu 002 (J. Comput. Sci. Technol., 2012)

Agnostic Learning of Monomials by Halfspaces Is Hard. - Vitaly Feldman; Venkatesan Guruswami; Prasad Raghavendra; Yi Wu 002 (SIAM J. Comput., 2012)

Membership privacy: a unifying framework for privacy definitions. - Ninghui Li; Wahbeh H. Qardaji; Dong Su; Yi Wu 002; Weining Yang (CCS, 2013)

Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. - Alina Ene; Jan Vondrák; Yi Wu 002 (SODA, 2013)

A lower-variance randomized algorithm for approximate string matching. - Mikhail J. Atallah; Elena Grigorescu; Yi Wu 002 (Inf. Process. Lett., 2013)

Computational Complexity of Certifying Restricted Isometry Property. - Abhiram Natarajan; Yi Wu 002 (APPROX-RANDOM, 2014)

Optimal Query Complexity for Estimating the Trace of a Matrix. - Karl Wimmer; Yi Wu 002; Peng Zhang 052 (ICALP (1), 2014)

Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. - Ryan O'Donnell; Yi Wu 002; Yuan Zhou 007 (ACM Trans. Comput. Theory, 2015)