The SCEAS System
| |||||||

## Search the dblp DataBase
Thomas P. Hayes:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
**Randomly Coloring Constant Degree Graphs.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:582-589 [Conf] - Thomas P. Hayes, Alistair Sinclair
**A general lower bound for mixing of single-site dynamics on graphs.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:511-520 [Conf] - Thomas P. Hayes, Eric Vigoda
**A Non-Markovian Coupling for Randomly Sampling Colorings.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:618-627 [Conf] - Thomas P. Hayes
**A simple condition implying rapid mixing of single-site dynamics on spin systems.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:39-46 [Conf] - Alina Beygelzimer, Varsha Dani, Tom Hayes, John Langford, Bianca Zadrozny
**Error limiting reductions between classification tasks.**[Citation Graph (0, 0)][DBLP] ICML, 2005, pp:49-56 [Conf] - László Babai, Thomas P. Hayes
**Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:1057-1066 [Conf] - Varsha Dani, Thomas P. Hayes
**Robbing the bandit: less regret in online geometric optimization against an adaptive adversary.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:937-943 [Conf] - Thomas P. Hayes, Eric Vigoda
**Variable length path coupling.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:103-110 [Conf] - Thomas P. Hayes, Eric Vigoda
**Coupling with the stationary distribution and improved sampling for colorings and independent sets.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:971-979 [Conf] - László Babai, Thomas P. Hayes, Peter G. Kimmel
**The Cost of the Missing Bit: Communication Complexity with Help.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:673-682 [Conf] - Thomas P. Hayes
**Randomly coloring graphs of girth at least five.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:269-278 [Conf] - Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek
**The Quantum Black-Box Complexity of Majority.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:34, n:4, pp:480-501 [Journal] - László Babai, Thomas P. Hayes, Peter G. Kimmel
**The Cost of the Missing Bit: Communication Complexity with Help.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2001, v:21, n:4, pp:455-488 [Journal] - Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
**Randomly coloring constant degree graphs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:009, pp:- [Journal] - Alina Beygelzimer, Varsha Dani, Thomas P. Hayes, John Langford
**Reductions Between Classification Tasks**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:077, pp:- [Journal] - Baruch Awerbuch, Thomas P. Hayes
**Online collaborative filtering with nearly optimal dynamic regret.**[Citation Graph (0, 0)][DBLP] SPAA, 2007, pp:315-319 [Conf] - Thomas P. Hayes, Juan C. Vera, Eric Vigoda
**Randomly coloring planar graphs with fewer colors than the maximum degree.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:450-458 [Conf] - Varsha Dani, Thomas P. Hayes
**How to Beat the Adaptive Multi-Armed Bandit**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **Liftings of Tree-Structured Markov Chains - (Extended Abstract).**[Citation Graph (, )][DBLP]**Stochastic Linear Optimization under Bandit Feedback.**[Citation Graph (, )][DBLP]**High-Probability Regret Bounds for Bandit Online Linear Optimization.**[Citation Graph (, )][DBLP]**The Price of Bandit Information for Online Optimization.**[Citation Graph (, )][DBLP]**The forgiving graph: a distributed data structure for low stretch under adversarial attack.**[Citation Graph (, )][DBLP]**The adwords problem: online keyword matching with budgeted bidders under random permutations.**[Citation Graph (, )][DBLP]**Minimizing average latency in oblivious routing.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |