default search action
Yi Wu 0002
Person information
- affiliation: Google
- affiliation: Purdue University, West Lafayette
- affiliation: IBM Research, Almaden
- affiliation: Carnegie Mellon University
Other persons with the same name
- Yi Wu — disambiguation page
- Yi Wu 0001 — Nanjing University of Science and Technology, China (and 2 more)
- Yi Wu 0003 — National University of Defense Technology, Changsha
- Yi Wu 0004 — Ericsson China, Beijing, China (and 2 more)
- Yi Wu 0005 — Intel Corporation (and 1 more)
- Yi Wu 0006 — Agder University College, Norway (and 1 more)
- Yi Wu 0007
— Tianjin University, Department of Information Management and Management Science, China (and 1 more)
- Yi Wu 0008
- Yi Wu 0009 — Ericsson Sweden, Lund (and 1 more)
- Yi Wu 0010
- Yi Wu 0011
- Yi Wu 0012 — Zhejiang University, China
- Yi Wu 0013
- Yi Wu 0014
- Yi Wu 0015 — Beijing Institute of Technology
- Yi Wu 0016 (aka: Yi Alice Wu) — Oracle (and 1 more)
- Yi Wu 0017
- Yi Wu 0018
- Yi Wu 0019
- Yi Wu 0020
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j6]Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from Some Optimal Geometric Inapproximability Results. ACM Trans. Algorithms 12(1): 6:1-6:25 (2016) - 2015
- [j5]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. ACM Trans. Comput. Theory 7(2): 9:1-9:16 (2015) - [i11]Alina Ene, Jan Vondrák, Yi Wu:
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. CoRR abs/1503.03905 (2015) - 2014
- [j4]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny). ACM Trans. Comput. Theory 6(1): 5:1-5:13 (2014) - [c17]Abhiram Natarajan, Yi Wu:
Computational Complexity of Certifying Restricted Isometry Property. APPROX-RANDOM 2014: 371-380 - [c16]Karl Wimmer, Yi Wu, Peng Zhang:
Optimal Query Complexity for Estimating the Trace of a Matrix. ICALP (1) 2014: 1051-1062 - [i10]Karl Wimmer, Yi Wu, Peng Zhang:
Optimal query complexity for estimating the trace of a matrix. CoRR abs/1405.7112 (2014) - [i9]Abhiram Natarajan, Yi Wu:
Computational Complexity of Certifying Restricted Isometry Property. CoRR abs/1406.5791 (2014) - 2013
- [j3]Mikhail J. Atallah, Elena Grigorescu, Yi Wu:
A lower-variance randomized algorithm for approximate string matching. Inf. Process. Lett. 113(18): 690-692 (2013) - [c15]Ninghui Li, Wahbeh H. Qardaji, Dong Su, Yi Wu, Weining Yang:
Membership privacy: a unifying framework for privacy definitions. CCS 2013: 889-900 - [c14]Alina Ene, Jan Vondrák, Yi Wu:
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. SODA 2013: 306-325 - 2012
- [j2]Yi Wu:
Pricing Loss Leaders Can be Hard. J. Comput. Sci. Technol. 27(4): 718-726 (2012) - [j1]Vitaly Feldman
Agnostic Learning of Monomials by Halfspaces Is Hard. SIAM J. Comput. 41(6): 1558-1590 (2012) - [c13]Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from some optimal geometric inapproximability results. SODA 2012: 699-717 - [c12]Preyas Popat, Yi Wu:
On the hardness of pricing loss-leaders. SODA 2012: 735-749 - 2011
- [c11]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. CCC 2011: 23-33 - [c10]Yi Wu:
Pricing Loss Leaders can be Hard. ICS 2011: 101-111 - [c9]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Optimal lower bounds for locality sensitive hashing (except when q is tiny). ICS 2011: 275-283 - [c8]Ilias Diakonikolas, Ryan O'Donnell, Rocco A. Servedio
Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions. SODA 2011: 1590-1606 - 2010
- [b1]Yi Wu:
The Approximability of Learning and Constraint Satisfaction Problems. Carnegie Mellon University, USA, 2010 - [c7]Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman:
Fooling Functions of Halfspaces under Product Distributions. CCC 2010: 223-234 - [c6]Venkatesan Guruswami, Subhash Khot, Ryan O'Donnell, Preyas Popat, Madhur Tulsiani, Yi Wu:
SDP Gaps for 2-to-1 and Other Label-Cover Variants. ICALP (1) 2010: 617-628 - [i8]Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman:
Fooling functions of halfspaces under product distributions. CoRR abs/1001.1593 (2010) - [i7]Ilias Diakonikolas, Ryan O'Donnell, Rocco A. Servedio, Yi Wu:
Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions. CoRR abs/1010.3484 (2010) - [i6]Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu:
Agnostic Learning of Monomials by Halfspaces is Hard. CoRR abs/1012.0729 (2010) - [i5]Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu:
Agnostic Learning of Monomials by Halfspaces is Hard. Electron. Colloquium Comput. Complex. TR10 (2010) - [i4]Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from some optimal geometric inapproximability results. Electron. Colloquium Comput. Complex. TR10 (2010) - [i3]Yi Wu, Ryan O'Donnell, David Zuckerman, Parikshit Gopalan:
Fooling functions of halfspaces under product distributions. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c5]Vitaly Feldman
Agnostic Learning of Monomials by Halfspaces Is Hard. FOCS 2009: 385-394 - [c4]Ryan O'Donnell, Yi Wu:
3-bit dictator testing: 1 vs. 5/8. SODA 2009: 365-373 - [c3]Ryan O'Donnell, Yi Wu:
Conditional hardness for satisfiable 3-CSPs. STOC 2009: 493-502 - [i2]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Optimal lower bounds for locality sensitive hashing (except when q is tiny). CoRR abs/0912.0250 (2009) - [i1]Ryan O'Donnell, Yi Wu, Yuan Zhou:
Optimal lower bounds for locality sensitive hashing (except when q is tiny). Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c2]Ryan O'Donnell, Yi Wu:
An optimal sdp algorithm for max-cut, and equally optimal long code tests. STOC 2008: 335-344 - 2007
- [c1]Yi Wu, Rong Zhang, Alexander I. Rudnicky:
Data selection for speech recognition. ASRU 2007: 562-565
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-11 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: