dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Ryan O'Donnell (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Kun, Ryan O'Donnell, Suguru Tamaki, Yuichi Yoshida, Yuan Zhou: Linear programming, width-1 CSPs, and robust satisfaction. ITCS 2012: 484-495
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRyan O'Donnell, John Wright, Yuan Zhou: The Fourier Entropy-Influence Conjecture for Certain Classes of Boolean Functions. ICALP (1) 2011: 330-341
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRyan O'Donnell, Yi Wu, Yuan Zhou: Optimal lower bounds for locality sensitive hashing (except when q is tiny). ICS 2011: 275-283
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRyan O'Donnell, Yi Wu, Yuan Zhou: Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups. IEEE Conference on Computational Complexity 2011: 23-33
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRyan O'Donnell, Yi Wu, Yuan Zhou: Optimal lower bounds for locality sensitive hashing (except when q is tiny) CoRR abs/0912.0250: (2009)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRyan O'Donnell, Yi Wu, Yuan Zhou: Optimal lower bounds for locality sensitive hashing (except when q is tiny). Electronic Colloquium on Computational Complexity (ECCC) 16: 130 (2009)

Selection of 6 from 78 records - Ryan O'Donnell has 43 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page