Obserwuj
Thomas P. Hayes
Thomas P. Hayes
Associate Professor, Dept of Computer Science and Engineering, University at Buffalo
Zweryfikowany adres z buffalo.edu
Tytuł
Cytowane przez
Cytowane przez
Rok
Stochastic linear optimization under bandit feedback
V Dani, TP Hayes, SM Kakade
21st Annual Conference on Learning Theory, 355-366, 2008
9772008
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
4772009
The price of bandit information for online optimization
V Dani, SM Kakade, T Hayes
Advances in Neural Information Processing Systems 20, 2007
2492007
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
1382008
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
1112005
Error limiting reductions between classification tasks
A Beygelzimer, V Dani, T Hayes, J Langford, B Zadrozny
International Conference on Machine Learning, 49-56, 2005
1082005
A non-Markovian coupling for randomly sampling colorings
TP Hayes, E Vigoda
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
1002003
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
902006
Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary
V Dani, TP Hayes
SODA 6, 937-943, 2006
902006
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
712009
Coupling with the stationary distribution and improved sampling for colorings and independent sets
TP Hayes, E Vigoda
702006
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
641998
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
542004
Randomly coloring graphs of girth at least five
TP Hayes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
542003
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
522007
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
472008
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
462019
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
412018
Randomly coloring constant degree graphs
M Dyer, A Frieze, TP Hayes, E Vigoda
Random Structures & Algorithms 43 (2), 181-200, 2013
412013
Variable length path coupling
TP Hayes, E Vigoda
Random Structures & Algorithms 31 (3), 251-272, 2007
402007
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20