( en | de | ru )

 

Disambiguation of "Hayes, Thomas P."

Author of the publication

copydeleteadd this publication to your clipboard
High-Probability Regret Bounds for Bandit Online Linear Optimization.

, , , , , and . COLT, page 335-342. Omnipress, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dallas Thomas Hayes

David Hayes

Zachary Hayes

Barry Hayes

Egbert Hayessen

 

Other publications of authors with the same name

Multiparty Interactive Communication with Private Channels., , , and . PODC, page 147-149. ACM, (2019)Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group., and . SODA, page 1057-1066. SIAM, (2005)Sending a Message with Unknown Noise., , , and . ICDCN, page 8:1-8:10. ACM, (2018)On the Power of Choice for k-Colorability of Random Graphs., , and . APPROX-RANDOM, volume 207 of LIPIcs, page 59:1-59:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks., and . DISC, volume 246 of LIPIcs, page 16:1-16:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The forgiving graph: a distributed data structure for low stretch under adversarial attack., , and . PODC, page 121-130. ACM, (2009)A simple condition implying rapid mixing of single-site dynamics on spin systems.. FOCS, page 39-46. IEEE Computer Society, (2006)Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks., , , and . Distributed Comput., 36 (3): 373-384 (September 2023)Fully-Asynchronous Distributed Metropolis Sampler with Optimal Speedup., , and . CoRR, (2019)Sampling Random Colorings of Sparse Random Graphs., , , and . SODA, page 1759-1771. SIAM, (2018)