Explore over 5,214,755 papers,
46,254 were added last week.
Author
|
Conference
|
Journal
|
Year
Look for results that meet for the following criteria:
Later than
Equal to
Earlier than
Papers
Authors
Conferences
Journals
View Top Co-Authors In
Visual Explorer
Thomas P. Hayes
Top Co-Authors:
Eric Vigoda (7)
Varsha Dani (7)
László Babai (3)
Sham M. Kakade (3)
Preliminary Draft Master Plan (2)
John Langford (2)
Dieter Van Melkebeek (2)
Alina Beygelzimer (2)
Samuel A. Kutin (2)
Peter G. Kimmel (2)
Baruch Awerbuch (1)
Alan M. Frieze (1)
Peter L. Bartlett (1)
Martin E. Dyer (1)
Alistair Sinclair (1)
Jaikumar Radhakrishnan (1)
Bianca Zadrozny (1)
Harald Räcke (1)
Hariharan Narayanan (1)
Juan Carlos Vera (1)
ObjectID : Author/417659
Thomas P. Hayes
(
Publications: 32
)
(
Citation Count: 166
)
(
G-Index: 11
)
(
H-Index: 7
)
Department of Mathemntics, University of Chicago, 5734 S. University Avenue, Chicaco, IL
Permanent Link:
http://academic.research.microsoft.com/Author/417659.aspx
Order by:
Year
|
Citation
|
Rank
The rank of a paper is calculated by considering the authors, the published conference or journal, and its citation graph. The highest ranking result will appear first.
Learn more
Papers
Citations
Year 2009
Nikhil R. Devenur
,
Thomas P. Hayes
:
The adwords problem: online keyword matching with budgeted bidders under random permutations
,
EC
, 2009
Year 2008
Varsha Dani
,
Thomas P. Hayes
,
Sham M. Kakade
:
Stochastic Linear Optimization under Bandit Feedback
,
COLT
, 2008
(
Citations: 6
)
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
(
Citations: 2
)
Prahladh Harsha
,
Thomas P. Hayes
,
Hariharan Narayanan
,
Harald Räcke
,
Jaikumar Radhakrishnan
:
Minimizing average latency in oblivious routing
,
SODA
, 2008
Year 2007
Thomas P. Hayes
,
Juan Carlos Vera
,
Eric Vigoda
:
Randomly coloring planar graphs with fewer colors than the maximum degree
,
STOC
, 2007
(
Citations: 5
)
Varsha Dani
,
Thomas P. Hayes
,
Sham Kakade
:
The Price of Bandit Information for Online Optimization
,
NIPS
, 2007
(
Citations: 4
)
Thomas P. Hayes
,
Eric Vigoda
:
Variable length path coupling
,
RSA
, 2007
(
Citations: 1
)
Baruch Awerbuch
,
Thomas P. Hayes
:
Online collaborative filtering with nearly optimal dynamic regret
,
SPAA
, 2007
(
Citations: 1
)
Year 2006
Varsha Dani
,
Thomas P. Hayes
:
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary
,
SODA
, 2006
(
Citations: 23
)
Thomas P. Hayes
:
A simple condition implying rapid mixing of single-site dynamics on spin systems
,
FOCS
, 2006
(
Citations: 3
)
Varsha Dani
,
Thomas P. Hayes
:
How to Beat the Adaptive Multi-Armed Bandit
,
CORR
, 2006
(
Citations: 2
)
Year 2005
Alina Beygelzimer
,
Varsha Dani
,
Thomas P. Hayes
,
John Langford
,
Bianca Zadrozny
:
Error limiting reductions between classification tasks
,
ICML
, 2005
(
Citations: 12
)
Thomas P. Hayes
,
Eric Vigoda
:
Coupling with the stationary distribution and improved sampling for colorings and independent sets
,
SODA
, 2005
(
Citations: 7
)
Thomas P. Hayes
,
Alistair Sinclair
:
A general lower bound for mixing of single-site dynamics on graphs
,
FOCS
, 2005
(
Citations: 6
)
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
(
Citations: 2
)
Year 2004
Martin E. Dyer
,
Alan M. Frieze
,
Thomas P. Hayes
,
Eric Vigoda
:
Randomly Coloring Constant Degree Graphs
,
FOCS
, 2004
(
Citations: 16
)
Thomas P. Hayes
,
Eric Vigoda
:
Variable length path coupling
,
SODA
, 2004
(
Citations: 7
)
Alina Beygelzimer
,
Varsha Dani
,
Thomas P. Hayes
,
John Langford
:
Reductions Between Classification Tasks
,
ECCC
, 2004
Year 2003
Thomas P. Hayes
,
Eric Vigoda
:
A Non-Markovian Coupling for Randomly Sampling Colorings
,
FOCS
, 2003
(
Citations: 24
)
Thomas P. Hayes
:
Randomly coloring graphs of girth at least five
,
STOC
, 2003
(
Citations: 11
)
T. P. Hayes
:
Randomly coloring graphs with girth at least five
, 2003
(
Citations: 7
)
Year 2002
Thomas P. Hayes
,
Samuel Kutin
,
Dieter Van Melkebeek
:
The Quantum Black-Box Complexity of Majority
,
ALGORITHMICA
, 2002
Year 2001
László Babai
,
Thomas P. Hayes
,
Peter G. Kimmel
:
The Cost of the Missing Bit: Communication Complexity with Help
,
COMBINATORICA
, 2001
(
Citations: 13
)
Year 1998
László Babai
,
Thomas P. Hayes
,
Peter G. Kimmel
:
The Cost of the Missing Bit: Communication Complexity with Help
,
STOC
, 1998
(
Citations: 8
)
Thomas P. Hayes Samuel Kutin
:
On the Quantum Complexity of Majority
, 1998
(
Citations: 4
)
Thomas P. Hayes
,
Samuel Kutin
,
Dieter Van Melkebeek
:
On the Quantum Black-Box Complexity of Majority
, 1998
(
Citations: 1
)
Year Unknown
Thomas P. Hayes
:
Local Uniformity Properties for Glauber Dynamics on Graph Colorings
(
Citations: 1
)
L Aszl O Babai
,
Thomas P. Hayes
:
The probability of generating the symmetric group when one of the generators is random
Thomas P. Hayes
,
Eric Vigoda
:
A Non-Markovian Coupling for Randomly Sampling Colorings (Extended Abstract)
Preliminary Draft
,
Thomas P. Hayes
:
Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
Preliminary Rough Draft
,
Thomas P. Hayes
:
The truncated coin ips martingale maximizes escape probability.
Thomas P. Hayes
:
A large-deviation inequality for vector-valued martingales