Thomas P. Hayes
Thomas P. Hayes
Associate Professor, Computer Science Dept, Univ. of New Mexico
Verified email at cs.unm.edu
TitleCited byYear
Stochastic linear optimization under bandit feedback
V Dani, TP Hayes, SM Kakade
4092008
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
2982009
The price of bandit information for online optimization
V Dani, SM Kakade, TP Hayes
Advances in Neural Information Processing Systems, 345-352, 2008
1512008
Error limiting reductions between classification tasks
A Beygelzimer, V Dani, T Hayes, J Langford, B Zadrozny
International Conference on Machine Learning, 49-56, 2005
902005
A non-Markovian coupling for randomly sampling colorings
TP Hayes, E Vigoda
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
782003
Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary
V Dani, TP Hayes
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
772006
High-probability regret bounds for bandit online linear optimization
PL Bartlett, V Dani, T Hayes, S Kakade, A Rakhlin, A Tewari
722008
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
672005
The cost of the missing bit: Communication complexity with help
L Babai, TP Hayes, PG Kimmel
Combinatorica 21 (4), 455-488, 2001
642001
The forgiving graph: a distributed data structure for low stretch under adversarial attack
TP Hayes, J Saia, A Trehan
Distributed Computing 25 (4), 261-278, 2012
632012
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
502004
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
492006
Coupling with the stationary distribution and improved sampling for colorings and independent sets
TP Hayes, E Vigoda
The Annals of Applied Probability 16 (3), 1297-1318, 2006
492006
Randomly coloring graphs of girth at least five
TP Hayes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
492003
Randomly coloring planar graphs with fewer colors than the maximum degree
TP Hayes, JC Vera, E Vigoda
Random Structures & Algorithms 47 (4), 731-759, 2015
372015
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
352008
Variable length path coupling
TP Hayes, E Vigoda
Random Structures & Algorithms 31 (3), 251-272, 2007
322007
Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group
L Babai, TP Hayes
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
292005
The quantum black-box complexity of majority
TP Hayes, S Kutin, D van Melkebeek
Algorithmica 34 (4), 480-501, 2002
24*2002
Randomly coloring constant degree graphs
M Dyer, A Frieze, TP Hayes, E Vigoda
Random Structures & Algorithms 43 (2), 181-200, 2013
222013
The system can't perform the operation now. Try again later.
Articles 1–20