| Stochastic Linear Optimization under Bandit Feedback. V Dani, TP Hayes, SM Kakade COLT 2, 3, 2008 | 909 | 2008 |
| The adwords problem: online keyword matching with budgeted bidders under random permutations NR Devanur, TP Hayes Proceedings of the 10th ACM conference on Electronic commerce, 71-78, 2009 | 455 | 2009 |
| The price of bandit information for online optimization V Dani, SM Kakade, T Hayes Advances in Neural Information Processing Systems 20, 2007 | 237 | 2007 |
| High-probability regret bounds for bandit online linear optimization P Bartlett, V Dani, T Hayes, S Kakade, A Rakhlin, A Tewari Proceedings of the 21st Annual Conference on Learning Theory-COLT 2008, 335-342, 2008 | 129 | 2008 |
| Error limiting reductions between classification tasks A Beygelzimer, V Dani, T Hayes, J Langford, B Zadrozny International Conference on Machine Learning, 49-56, 2005 | 104 | 2005 |
| A general lower bound for mixing of single-site dynamics on graphs TP Hayes, A Sinclair 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 511-520, 2005 | 102 | 2005 |
| A non-Markovian coupling for randomly sampling colorings TP Hayes, E Vigoda 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 98 | 2003 |
| Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary V Dani, TP Hayes SODA 6, 937-943, 2006 | 91 | 2006 |
| A simple condition implying rapid mixing of single-site dynamics on spin systems TP Hayes 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006 | 84 | 2006 |
| Coupling with the stationary distribution and improved sampling for colorings and independent sets TP Hayes, E Vigoda | 70 | 2006 |
| The forgiving graph: a distributed data structure for low stretch under adversarial attack TP Hayes, J Saia, A Trehan Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009 | 69 | 2009 |
| The cost of the missing bit: Communication complexity with help L Babai, TP Hayes, PG Kimmel Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 63 | 1998 |
| Randomly coloring constant degree graphs M Dyer, A Frieze, TP Hayes, E Vigoda 45th Annual IEEE Symposium on Foundations of Computer Science, 582-589, 2004 | 54 | 2004 |
| Randomly coloring graphs of girth at least five TP Hayes Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 52 | 2003 |
| Randomly coloring planar graphs with fewer colors than the maximum degree TP Hayes, JC Vera, E Vigoda Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 49 | 2007 |
| The Forgiving Tree: a Self-Healing Distributed Data Structure T Hayes, N Rustagi, J Saia, A Trehan 27th ACM Symposium on Principles of Distributed Computing (PODC 2008), 203-212, 2008 | 45 | 2008 |
| Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model C Efthymiou, TP Hayes, D Stefankovic, E Vigoda, Y Yin SIAM Journal on Computing 48 (2), 581-643, 2019 | 44 | 2019 |
| Randomly coloring constant degree graphs M Dyer, A Frieze, TP Hayes, E Vigoda Random Structures & Algorithms 43 (2), 181-200, 2013 | 41 | 2013 |
| Variable length path coupling TP Hayes, E Vigoda Random Structures & Algorithms 31 (3), 251-272, 2007 | 40 | 2007 |
| The energy complexity of broadcast YJ Chang, V Dani, TP Hayes, Q He, W Li, S Pettie Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 39 | 2018 |
Varsha DaniRochester Institute of Technology在 cs.rit.edu 的电子邮件经过验证
