◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

T. Hayes

26 papers hereh-index 243.4k citations66 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author7
  • middle author15
  • last author3

Across the 26 of 26 papers where every author was matched, so the position is known.

fields
  • cs.DS7
  • cs.DM4
  • math.PR4
  • cs.DC3
  • cs.CC2
  • cs.CR2
same name
  • T. Hayes — 3 papers, h 10
  • T. Hayes — 2 papers, h 6
  • T. Hayes — 1 paper, h 3
  • T. Hayes — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20012023
most citedCoupling with the stationary distribution and improved sampling for colorings and independent sets

56 citations · 184 across the 20 of their papers we have counts for

collaborators
Showing 2016Show all

4 papers · 1 filter

cs.CR2016

Distributed Computing with Channel Noise

Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes +1

A group of n users want to run a distributed protocol π over a network where communication occurs via private point-to-point channels. Unfortunately, an adversary, who knows $π…

math.CO2016

Codes, Lower Bounds, and Phase Transitions in the Symmetric Rendezvous Problem

Varsha Dani, Thomas P. Hayes, Cristopher Moore +1

In the rendezvous problem, two parties with different labelings of the vertices of a complete graph are trying to meet at some vertex at the same time. It is well-known that if the…

cs.CR2016

Sending a Message with Unknown Noise

Abhinav Aggarwal, Varsha Dani, Thomas Hayes +1

Alice and Bob are connected via a two-way channel, and Alice wants to send a message of L bits to Bob. An adversary flips an arbitrary but finite number of bits, T, on the chan…

cs.DM2016★ 5 cited

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic +2

We study the hard-core model defined on independent sets of an input graph where the independent sets are weighted by a parameter λ>0. For constant Δ, previous work of Weitz (2…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.