| * | 2009 |
| 25 | EE | Nikhil R. Devenur,
Thomas P. Hayes:
The adwords problem: online keyword matching with budgeted bidders under random permutations.
ACM Conference on Electronic Commerce 2009: 71-78 |
| 24 | EE | Thomas P. Hayes,
Jared Saia,
Amitabh Trehan:
The forgiving graph: a distributed data structure for low stretch under adversarial attack.
PODC 2009: 121-130 |
| 2008 |
| 23 | EE | Peter L. Bartlett,
Varsha Dani,
Thomas P. Hayes,
Sham Kakade,
Alexander Rakhlin,
Ambuj Tewari:
High-Probability Regret Bounds for Bandit Online Linear Optimization.
COLT 2008: 335-342 |
| 22 | EE | Varsha Dani,
Thomas P. Hayes,
Sham M. Kakade:
Stochastic Linear Optimization under Bandit Feedback.
COLT 2008: 355-366 |
| 21 | EE | Prahladh Harsha,
Thomas P. Hayes,
Hariharan Narayanan,
Harald Räcke,
Jaikumar Radhakrishnan:
Minimizing average latency in oblivious routing.
SODA 2008: 200-207 |
| 2007 |
| 20 | EE | Varsha Dani,
Thomas P. Hayes,
Sham Kakade:
The Price of Bandit Information for Online Optimization.
NIPS 2007 |
| 19 | EE | Baruch Awerbuch,
Thomas P. Hayes:
Online collaborative filtering with nearly optimal dynamic regret.
SPAA 2007: 315-319 |
| 18 | EE | Thomas P. Hayes,
Juan Carlos Vera,
Eric Vigoda:
Randomly coloring planar graphs with fewer colors than the maximum degree.
STOC 2007: 450-458 |
| 17 | EE | Thomas P. Hayes,
Eric Vigoda:
Variable length path coupling.
Random Struct. Algorithms 31(3): 251-272 (2007) |
| 2006 |
| 16 | EE | Thomas P. Hayes:
A simple condition implying rapid mixing of single-site dynamics on spin systems.
FOCS 2006: 39-46 |
| 15 | EE | Varsha Dani,
Thomas P. Hayes:
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary.
SODA 2006: 937-943 |
| 14 | EE | Varsha Dani,
Thomas P. Hayes:
How to Beat the Adaptive Multi-Armed Bandit
CoRR abs/cs/0602053: (2006) |
| 2005 |
| 13 | EE | Thomas P. Hayes,
Alistair Sinclair:
A general lower bound for mixing of single-site dynamics on graphs.
FOCS 2005: 511-520 |
| 12 | EE | Alina Beygelzimer,
Varsha Dani,
Thomas P. Hayes,
John Langford,
Bianca Zadrozny:
Error limiting reductions between classification tasks.
ICML 2005: 49-56 |
| 11 | EE | László Babai,
Thomas P. Hayes:
Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group.
SODA 2005: 1057-1066 |
| 10 | EE | Thomas P. Hayes,
Eric Vigoda:
Coupling with the stationary distribution and improved sampling for colorings and independent sets.
SODA 2005: 971-979 |
| 2004 |
| 9 | EE | Martin E. Dyer,
Alan M. Frieze,
Thomas P. Hayes,
Eric Vigoda:
Randomly Coloring Constant Degree Graphs.
FOCS 2004: 582-589 |
| 8 | EE | Thomas P. Hayes,
Eric Vigoda:
Variable length path coupling.
SODA 2004: 103-110 |
| 7 | EE | Martin E. Dyer,
Alan M. Frieze,
Thomas P. Hayes,
Eric Vigoda:
Randomly coloring constant degree graphs
Electronic Colloquium on Computational Complexity (ECCC)(009): (2004) |
| 6 | EE | Alina Beygelzimer,
Varsha Dani,
Thomas P. Hayes,
John Langford:
Reductions Between Classification Tasks
Electronic Colloquium on Computational Complexity (ECCC)(077): (2004) |
| 2003 |
| 5 | EE | Thomas P. Hayes,
Eric Vigoda:
A Non-Markovian Coupling for Randomly Sampling Colorings.
FOCS 2003: 618-627 |
| 4 | EE | Thomas P. Hayes:
Randomly coloring graphs of girth at least five.
STOC 2003: 269-278 |
| 2002 |
| 3 | EE | Thomas P. Hayes,
Samuel Kutin,
Dieter van Melkebeek:
The Quantum Black-Box Complexity of Majority.
Algorithmica 34(4): 480-501 (2002) |
| 2001 |
| 2 | EE | László Babai,
Thomas P. Hayes,
Peter G. Kimmel:
The Cost of the Missing Bit: Communication Complexity with Help.
Combinatorica 21(4): 455-488 (2001) |
| 1998 |
| 1 | EE | László Babai,
Thomas P. Hayes,
Peter G. Kimmel:
The Cost of the Missing Bit: Communication Complexity with Help.
STOC 1998: 673-682 |