Hayes, Thomas - Department of Computer Science, University of New Mexico

• A Non-Markovian Coupling for Randomly Sampling Colorings
• A large-deviation inequality for vector-valued martingales
• On the Quantum Black-Box Complexity of Majority Thomas P. Hayes Samuel Kutin y Dieter van Melkebeek z
• Nearindependence of permutations and an almost sure polynomial bound on the
• A large-deviation inequality for vector-valued martingales
• Variable Length Path Coupling Thomas P. Hayes
• How to Beat the Adaptive Multi-Armed Bandit Varsha Dani
• A simple condition implying rapid mixing of single-site dynamics on spin systems Thomas P. Hayes
• How to Beat the Adaptive MultiArmed Bandit Varsha Dani # Thomas P. Hayes +
• Local Uniformity Properties for Glauber Dynamics on Graph Colorings
• Separating the k-party communication complexity hierarchy
• The Cost of the Missing Bit: Communication Complexity with Help
• The truncated coin ips martingale maximizes escape probability.
• A large-deviation inequality for vector-valued martingales
• Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary.
• The Annals of Applied Probability 2006, Vol. 16, No. 3, 12971318
• The truncated coin flips martingale maximizes escape probability.
• Separating the k-party communication complexity hierarchy
• The Cost of the Missing Bit: Communication Complexity with Help
• A Non-Markovian Coupling for Randomly Sampling Colorings (Extended Abstract)
• Randomly Coloring Graphs of Girth at Least Five [Extended Abstract]
• A large-deviation inequality for vector-valued martingales
• A NonMarkovian Coupling for Randomly Sampling Colorings (Extended Abstract)
• Local Uniformity Properties for Glauber Dynamics on Graph Colorings
• Liftings of Tree-Structured Markov Chains (Extended Abstract)
• Randomly Coloring Graphs of Girth at Least Five [Extended Abstract] #
• On the Quantum Black-Box Complexity of Majority Thomas P. Hayes
• How to Beat the Adaptive Multi-Armed Bandit Varsha Dani* Thomas P. Hayesy
• Randomly Coloring Graphs of Girth at Least Five [Extended Abstract]
• The Cost of the Missing Bit: Communication Complexity with Help
• A large-deviation inequality for vector-valued martingales
• On the Quantum Black-Box Complexity of Majority Thomas P. Hayes* Samuel Kutiny Dieter van Melkebeekz
• A Non-Markovian Coupling for Randomly Sampling Colorings (Extended Abstract)
• Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary.
• A NonMarkovian Coupling for Randomly Sampling Colorings
• The truncated coin flips martingale maximizes escape probability.
• Near-independence of permutations and an almost sure polynomial bound on the
• A Non-Markovian Coupling for Randomly Sampling Colorings
• A large-deviation inequality for vector-valued martingales
• Separating the k-party communication complexity hierarchy
• Online Matchings via Randomized Queueing Thomas P. Hayes