| Genetic programming III: Darwinian invention and problem solving JR Koza Morgan Kaufmann, 1999 | 2593 | 1999 |
| Genetic programming IV: Routine human-competitive machine intelligence JR Koza, MA Keane, MJ Streeter, W Mydlowec, J Yu, G Lanza Springer Science & Business Media, 2005 | 1160 | 2005 |
| Adaptive bound optimization for online convex optimization HB McMahan, M Streeter arXiv preprint arXiv:1002.4908, 2010 | 406 | 2010 |
| An online algorithm for maximizing submodular functions M Streeter, D Golovin Advances in Neural Information Processing Systems 21, 2008 | 303 | 2008 |
| Evolving inventions JR Koza, MA Keane, MJ Streeter Scientific American 288 (2), 52-59, 2003 | 170 | 2003 |
| Delay-tolerant algorithms for asynchronous distributed online learning B McMahan, M Streeter Advances in Neural Information Processing Systems 27, 2014 | 163 | 2014 |
| Combining multiple heuristics online M Streeter, D Golovin, SF Smith AAAI, 1197-1203, 2007 | 110 | 2007 |
| Online learning of assignments M Streeter, D Golovin, A Krause Advances in neural information processing systems 22, 2009 | 83 | 2009 |
| What's AI done for me lately? Genetic programming's human-competitive results JR Koza, MA Keane, MJ Streeter IEEE intelligent systems 18 (3), 25-31, 2003 | 82 | 2003 |
| The root causes of code growth in genetic programming MJ Streeter European Conference on Genetic Programming, 443-454, 2003 | 82 | 2003 |
| Less regret via online conditioning M Streeter, HB McMahan arXiv preprint arXiv:1002.4862, 2010 | 66 | 2010 |
| New techniques for algorithm portfolio design M Streeter, SF Smith arXiv preprint arXiv:1206.3286, 2012 | 60 | 2012 |
| Tighter Bounds for Multi-Armed Bandits with Expert Advice. HB McMahan, MJ Streeter COLT, 2009 | 57 | 2009 |
| Two broad classes of functions for which a no free lunch result does not hold MJ Streeter Genetic and Evolutionary Computation Conference, 1418-1430, 2003 | 53 | 2003 |
| An asymptotically optimal algorithm for the max k-armed bandit problem MJ Streeter, SF Smith AAAI, 135-142, 2006 | 51 | 2006 |
| Online submodular maximization under a matroid constraint with application to learning assignments D Golovin, A Krause, M Streeter arXiv preprint arXiv:1407.1082, 2014 | 50 | 2014 |
| No-regret algorithms for unconstrained online convex optimization M Streeter, HB McMahan arXiv preprint arXiv:1211.2260, 2012 | 49 | 2012 |
| A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem MJ Streeter, SF Smith International Conference on Principles and Practice of Constraint …, 2006 | 48 | 2006 |
| Using Decision Procedures Efficiently for Optimization. MJ Streeter, SF Smith ICAPS, 312-319, 2007 | 41 | 2007 |
| No-regret algorithms for unconstrained online convex optimization B Mcmahan, M Streeter Advances in neural information processing systems 25, 2012 | 40 | 2012 |
H. Brendan McMahanResearch Scientist, Google SeattleVerified email at google.com
