The following pages link to Thomas P. Hayes (Q402923):
Displayed 37 items.
- Bounds on the diameter of Cayley graphs of the symmetric group (Q402925) (← links)
- The cost of the missing bit: Communication complexity with help (Q700359) (← links)
- Coupling with the stationary distribution and improved sampling for colorings and independent sets (Q862206) (← links)
- Interactive communication with unknown noise rate (Q1641020) (← links)
- The quantum black-box complexity of majority (Q1871636) (← links)
- The forgiving graph: a distributed data structure for low stretch under adversarial attack (Q1938375) (← links)
- A general lower bound for mixing of single-site dynamics on graphs (Q2456048) (← links)
- The Power of Choice for Random Satisfiability (Q2851879) (← links)
- Local uniformity properties for glauber dynamics on graph colorings (Q2852545) (← links)
- Randomly coloring constant degree graphs (Q2852546) (← links)
- (Q2921777) (← links)
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem (Q2953697) (← links)
- (Q3436059) (← links)
- Randomly coloring planar graphs with fewer colors than the maximum degree (Q3460517) (← links)
- (Q3579444) (← links)
- Randomly coloring graphs of girth at least five (Q3581296) (← links)
- Robbing the bandit (Q3581558) (← links)
- Liftings of Tree-Structured Markov Chains (Q3588438) (← links)
- (Q4542591) (← links)
- Sampling Random Colorings of Sparse Random Graphs (Q4608004) (← links)
- Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model (Q4634031) (← links)
- Multiparty Interactive Communication with Private Channels (Q5145192) (← links)
- The forgiving graph (Q5170309) (← links)
- The Energy Complexity of Broadcast (Q5197671) (← links)
- (Q5414555) (← links)
- Variable length path coupling (Q5433262) (← links)
- (Q5501247) (← links)
- The Energy Complexity of BFS in Radio Networks (Q5855245) (← links)
- (Q5875505) (← links)
- (Q6083382) (← links)
- On the Power of Choice for k-Colorability of Random Graphs. (Q6090917) (← links)
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks (Q6096038) (← links)
- (Q6147383) (← links)
- Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks (Q6201942) (← links)
- How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman (Q6229479) (← links)
- Spatial Mixing for Independent Sets in Poisson Random Trees (Q6259278) (← links)
- Reconstruction of Random Geometric Graphs: Breaking the Omega(r) distortion barrier (Q6374107) (← links)