Thomas P. Hayes

Tom Hayes

	2011
32		Vamsi K. Potluru, Sergey M. Plis, Shuang Luan, Vince D. Calhoun, Thomas P. Hayes: Sparseness and a reduction from Totally Nonnegative Least Squares to SVM. IJCNN 2011: 1922-1929
31		Thomas P. Hayes: How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman CoRR abs/1112.0829: (2011)
30		Thomas P. Hayes: Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem. Discrete Mathematics & Theoretical Computer Science 13(4): 15-22 (2011)
	2010
29		Thomas P. Hayes, Alistair Sinclair: Liftings of Tree-Structured Markov Chains - (Extended Abstract). APPROX-RANDOM 2010: 602-616
	2009
28		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
27		Thomas P. Hayes, Jared Saia, Amitabh Trehan: The forgiving graph: a distributed data structure for low stretch under adversarial attack. PODC 2009: 121-130
26		Tom Hayes, Jared Saia, Amitabh Trehan: The Forgiving Graph: A distributed data structure for low stretch under adversarial attack CoRR abs/0902.2501: (2009)
	2008
25		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
24		Varsha Dani, Thomas P. Hayes, Sham M. Kakade: Stochastic Linear Optimization under Bandit Feedback. COLT 2008: 355-366
23		Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Trehan: The forgiving tree: a self-healing distributed data structure. PODC 2008: 203-212
22		Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan: Minimizing average latency in oblivious routing. SODA 2008: 200-207
21		Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Trehan: The Forgiving Tree: A Self-Healing Distributed Data Structure CoRR abs/0802.3267: (2008)
	2007
20		Varsha Dani, Thomas P. Hayes, Sham Kakade: The Price of Bandit Information for Online Optimization. NIPS 2007
19		Baruch Awerbuch, Thomas P. Hayes: Online collaborative filtering with nearly optimal dynamic regret. SPAA 2007: 315-319
18		Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda: Randomly coloring planar graphs with fewer colors than the maximum degree. STOC 2007: 450-458
17		Thomas P. Hayes, Eric Vigoda: Variable length path coupling. Random Struct. Algorithms 31(3): 251-272 (2007)
	2006
16		Thomas P. Hayes: A simple condition implying rapid mixing of single-site dynamics on spin systems. FOCS 2006: 39-46
15		Varsha Dani, Thomas P. Hayes: Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. SODA 2006: 937-943
14		Varsha Dani, Thomas P. Hayes: How to Beat the Adaptive Multi-Armed Bandit CoRR abs/cs/0602053: (2006)
	2005
13		Thomas P. Hayes, Alistair Sinclair: A general lower bound for mixing of single-site dynamics on graphs. FOCS 2005: 511-520
12		Alina Beygelzimer, Varsha Dani, Thomas P. Hayes, John Langford, Bianca Zadrozny: Error limiting reductions between classification tasks. ICML 2005: 49-56
11		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		Thomas P. Hayes, Eric Vigoda: Coupling with the stationary distribution and improved sampling for colorings and independent sets. SODA 2005: 971-979
	2004
9		Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda: Randomly Coloring Constant Degree Graphs. FOCS 2004: 582-589
8		Thomas P. Hayes, Eric Vigoda: Variable length path coupling. SODA 2004: 103-110
7		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		Alina Beygelzimer, Varsha Dani, Thomas P. Hayes, John Langford: Reductions Between Classification Tasks Electronic Colloquium on Computational Complexity (ECCC)(077): (2004)
	2003
5		Thomas P. Hayes, Eric Vigoda: A Non-Markovian Coupling for Randomly Sampling Colorings. FOCS 2003: 618-627
4		Thomas P. Hayes: Randomly coloring graphs of girth at least five. STOC 2003: 269-278
	2002
3		Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek: The Quantum Black-Box Complexity of Majority. Algorithmica 34(4): 480-501 (2002)
	2001
2		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		László Babai, Thomas P. Hayes, Peter G. Kimmel: The Cost of the Missing Bit: Communication Complexity with Help. STOC 1998: 673-682

Coauthor Index

1	Baruch Awerbuch	[19]
2	László Babai	[1] [2] [11]
3	Peter L. Bartlett	[25]
4	Alina Beygelzimer	[6] [12]
5	Vince D. Calhoun (Vincent D. Calhoun)	[32]
6	Varsha Dani	[6] [12] [14] [15] [20] [24] [25]
7	Nikhil R. Devenur	[28]
8	Martin E. Dyer	[7] [9]
9	Alan M. Frieze	[7] [9]
10	Prahladh Harsha	[22]
11	Sham M. Kakade (Sham Kakade)	[20] [24] [25]
12	Peter G. Kimmel	[1] [2]
13	Samuel Kutin (Samuel A. Kutin)	[3]
14	John Langford	[6] [12]
15	Shuang Luan (Shuang (Sean) Luan)	[32]
16	Dieter van Melkebeek	[3]
17	Hariharan Narayanan	[22]
18	Sergey M. Plis	[32]
19	Vamsi K. Potluru	[32]
20	Harald Räcke	[22]
21	Jaikumar Radhakrishnan	[22]
22	Alexander Rakhlin	[25]
23	Navin Rustagi	[21] [23]
24	Jared Saia	[21] [23] [26] [27]
25	Alistair Sinclair	[13] [29]
26	Ambuj Tewari	[25]
27	Amitabh Trehan	[21] [23] [26] [27]
28	Juan Carlos Vera	[18]
29	Eric Vigoda	[5] [7] [8] [9] [10] [17] [18]
30	Bianca Zadrozny	[12]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page