Thomas P. Hayes

From MaRDI portal
Person:402923

Available identifiers

zbMath Open hayes.thomas-pMaRDI QIDQ402923

List of research outcomes

PublicationDate of PublicationType
Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q61473832024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q60833822023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q60909172023-11-20Paper
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks2023-09-11Paper
https://portal.mardi4nfdi.de/entity/Q58755052023-02-03Paper
The Energy Complexity of BFS in Radio Networks2021-03-15Paper
Multiparty Interactive Communication with Private Channels2021-01-20Paper
The Energy Complexity of Broadcast2019-09-19Paper
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model2019-05-07Paper
Interactive communication with unknown noise rate2018-06-14Paper
Sampling Random Colorings of Sparse Random Graphs2018-03-15Paper
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem2017-01-05Paper
Randomly coloring planar graphs with fewer colors than the maximum degree2016-01-07Paper
Interactive communication with unknown noise rate2015-11-04Paper
https://portal.mardi4nfdi.de/entity/Q55012472015-08-03Paper
Spatial Mixing for Independent Sets in Poisson Random Trees2015-02-21Paper
https://portal.mardi4nfdi.de/entity/Q29217772014-10-13Paper
Bounds on the diameter of Cayley graphs of the symmetric group2014-08-29Paper
The forgiving graph2014-07-23Paper
https://portal.mardi4nfdi.de/entity/Q54145552014-05-06Paper
Local uniformity properties for glauber dynamics on graph colorings2013-10-09Paper
Randomly coloring constant degree graphs2013-10-09Paper
The Power of Choice for Random Satisfiability2013-10-04Paper
The forgiving graph: a distributed data structure for low stretch under adversarial attack2013-02-04Paper
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman2011-12-04Paper
Liftings of Tree-Structured Markov Chains2010-09-10Paper
Randomly coloring graphs of girth at least five2010-08-16Paper
Robbing the bandit2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35794442010-08-06Paper
Randomly coloring planar graphs with fewer colors than the maximum degree2009-01-05Paper
Variable length path coupling2008-01-08Paper
A general lower bound for mixing of single-site dynamics on graphs2007-10-17Paper
https://portal.mardi4nfdi.de/entity/Q34360592007-05-08Paper
Coupling with the stationary distribution and improved sampling for colorings and independent sets2007-02-05Paper
The quantum black-box complexity of majority2003-05-04Paper
The cost of the missing bit: Communication complexity with help2002-10-20Paper
https://portal.mardi4nfdi.de/entity/Q45425911998-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Thomas P. Hayes