Подписаться
Thomas P. Hayes
Thomas P. Hayes
Associate Professor, Computer Science Dept, Univ. of New Mexico
Подтвержден адрес электронной почты в домене cs.unm.edu
Название
Процитировано
Процитировано
Год
Stochastic linear optimization under bandit feedback
V Dani, TP Hayes, SM Kakade
6872008
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
3872009
The price of bandit information for online optimization
V Dani, SM Kakade, T Hayes
Advances in Neural Information Processing Systems 20, 2007
2112007
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
972008
Error limiting reductions between classification tasks
A Beygelzimer, V Dani, T Hayes, J Langford, B Zadrozny
International Conference on Machine Learning, 49-56, 2005
942005
A non-Markovian coupling for randomly sampling colorings
TP Hayes, E Vigoda
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
942003
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
862005
Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary
V Dani, TP Hayes
SODA 6, 937-943, 2006
832006
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
682012
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
682006
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
642006
The cost of the missing bit: Communication complexity with help
L Babai, TP Hayes, PG Kimmel
Combinatorica 21 (4), 455-488, 2001
642001
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
532004
Randomly coloring graphs of girth at least five
TP Hayes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
522003
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
452015
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
432008
Variable length path coupling
TP Hayes, E Vigoda
Random Structures & Algorithms 31 (3), 251-272, 2007
382007
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
352019
Randomly coloring constant degree graphs
M Dyer, A Frieze, TP Hayes, E Vigoda
Random Structures & Algorithms 43 (2), 181-200, 2013
332013
Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group
L Babai, TP Hayes
SODA 5, 1057-1066, 2005
322005
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20