| Hypercontractivity, Sum-of-Squares proofs, and their applications B Barak, FGSL Brandao, AW Harrow, J Kelner, D Steurer, Y Zhou Proceedings of the 44th symposium on Theory of Computing, 307-326, 2012 | 175 | 2012 |
| Optimal lower bounds for locality-sensitive hashing (except when q is tiny) R O’Donnell, Y Wu, Y Zhou ACM Transactions on Computation Theory (TOCT) 6 (1), 1-13, 2014 | 131 | 2014 |
| Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph A Bhaskara, M Charikar, V Guruswami, A Vijayaraghavan, Y Zhou Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 110 | 2012 |
| Tighter bounds for facility games P Lu, Y Wang, Y Zhou Internet and Network Economics, 137-148, 2009 | 90 | 2009 |
| Optimal PAC multiple arm identification with applications to crowdsourcing Y Zhou, X Chen, J Li International Conference on Machine Learning, 217-225, 2014 | 85 | 2014 |
| Approximability and proof complexity R O'Donnell, Y Zhou Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013 | 66 | 2013 |
| Linear programming, width-1 CSPs, and robust satisfaction G Kun, R O’Donnell, S Tamaki, Y Yoshida, Y Zhou | 51 | 2012 |
| Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs R O'Donnell, J Wright, C Wu, Y Zhou Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014 | 44 | 2014 |
| Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem L Cai, Y Cheng, E Verbin, Y Zhou SIAM Journal on Discrete Mathematics 24 (4), 1322--1335, 2010 | 34 | 2010 |
| Approximation Algorithms and Hardness of the k-Route Cut Problem J Chuzhoy, Y Makarychev, A Vijayaraghavan, Y Zhou ACM Transactions on Algorithms (TALG) 12 (1), 1-40, 2015 | 33 | 2015 |
| Optimal sparse designs for process flexibility via probabilistic expanders X Chen, J Zhang, Y Zhou Operations Research 63 (5), 1159-1176, 2015 | 32 | 2015 |
| Dynamic Assortment Optimization with Changing Contextual Information X Chen, Y Wang, Y Zhou Journal of Machine Learning Research 21 (216), 1-44, 2020 | 24 | 2020 |
| Almost Optimal Model-Free Reinforcement Learning via Reference-Advantage Decomposition Z Zhang, Y Zhou, X Ji arXiv preprint arXiv:2004.10019, 2020 | 23 | 2020 |
| The Fourier Entropy–Influence Conjecture for certain classes of Boolean functions R O’Donnell, J Wright, Y Zhou Automata, Languages and Programming, 330-341, 2011 | 23 | 2011 |
| Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set V Guruswami, Y Zhou Theory of Computing 8, 239-267, 2012 | 22 | 2012 |
| Hypercontractive inequalities via SOS, and the Frankl-Rödl graph M Kauers, R O'Donnell, LY Tan, Y Zhou Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014 | 21 | 2014 |
| Best arm identification in linear bandits with linear dimension dependency C Tao, S Blanco, Y Zhou International Conference on Machine Learning, 4877-4886, 2018 | 20 | 2018 |
| Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems Y Yoshida, Y Zhou Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 19 | 2014 |
| Near-optimal policies for dynamic multinomial logit assortment selection models Y Wang, X Chen, Y Zhou Advances in Neural Information Processing Systems, 3101-3110, 2018 | 16 | 2018 |
| Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits Y Li, Y Wang, Y Zhou Conference on Learning Theory, 2173-2174, 2019 | 15 | 2019 |
Ryan O'DonnellProfessor, Computer Science Department, Carnegie MellonEmail verificata su cs.cmu.edu
