| Cryptographic hardness for learning intersections of halfspaces AR Klivans, AA Sherstov Journal of Computer and System Sciences 75 (1), 2-12, 2009 | 204 | 2009 |
| Function approximation via tile coding: Automating parameter choice AA Sherstov, P Stone International symposium on abstraction, reformulation, and approximation …, 2005 | 182 | 2005 |
| The pattern matrix method AA Sherstov SIAM J. Comput, 2010 | 153* | 2010 |
| The Sign-Rank of AC AA Razborov, AA Sherstov SIAM Journal on Computing 39, 1833, 2010 | 134 | 2010 |
| Improving action selection in MDP's via knowledge transfer AA Sherstov, P Stone AAAI 5, 1024-1029, 2005 | 105 | 2005 |
| Strong direct product theorems for quantum communication and query complexity AA Sherstov Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 92 | 2011 |
| Separating AC 0 from depth-2 majority circuits AA Sherstov Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 90 | 2007 |
| Three automated stock-trading agents: A comparative study AA Sherstov, P Stone Agent-Mediated Electronic Commerce VI. Theories for and Engineering of …, 2005 | 88 | 2005 |
| The communication complexity of gap hamming distance AA Sherstov Theory of Computing 8 (1), 197-208, 2012 | 81 | 2012 |
| The intersection of two halfspaces has high threshold degree AA Sherstov SIAM Journal on Computing 42 (6), 2329-2374, 2013 | 72 | 2013 |
| The multiparty communication complexity of set disjointness AA Sherstov Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 69* | 2012 |
| Communication lower bounds using directional derivatives AA Sherstov Journal of the ACM (JACM) 61 (6), 1-71, 2014 | 64 | 2014 |
| Communication lower bounds using dual polynomials AA Sherstov arXiv preprint arXiv:0805.2135, 2008 | 63 | 2008 |
| Halfspace matrices AA Sherstov Computational Complexity 17 (2), 149-178, 2008 | 62 | 2008 |
| The unbounded-error communication complexity of symmetric functions AA Sherstov Combinatorica 31, 583-614, 2011 | 54 | 2011 |
| Lower Bounds for Agnostic Learning via Approximate Rank AR Klivans, AA Sherstov Computational Complexity 19 (4), 581-604, 2010 | 51* | 2010 |
| Unconditional lower bounds for learning intersections of halfspaces AR Klivans, AA Sherstov Machine Learning 69 (2), 97-114, 2007 | 44 | 2007 |
| Optimal bounds for sign-representing the intersection of two halfspaces by polynomials AA Sherstov Proceedings of the Forty-second ACM Symposium on Theory of Computing, 523-532, 2010 | 43 | 2010 |
| Making polynomials robust to noise AA Sherstov Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 39 | 2012 |
| A separation of NP and coNP in multiparty communication complexity D Gavinsky, AA Sherstov arXiv preprint arXiv:1004.0817, 2010 | 36 | 2010 |
