default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas P. Hayes
Person information
- affiliation: University of New Mexico, Albuquerque, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Varsha Dani
, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier. Eur. J. Comb. 121: 103842 (2024)- 2023
- [j16]Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie:
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks. Distributed Comput. 36(3): 373-384 (2023) - 2019
- [j15]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin:
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. SIAM J. Comput. 48(2): 581-643 (2019) - 2018
- [j14]Varsha Dani, Thomas P. Hayes, Mahnush Movahedi, Jared Saia, Maxwell Young:
Interactive communication with unknown noise rate. Inf. Comput. 261: 464-486 (2018) - 2017
- [j13]Tom Hayes, Falah H. Ali:
Medium access control schemes for flat mobile wireless sensor networks. IET Wirel. Sens. Syst. 7(4): 105-112 (2017) - 2016
- [j12]Thomas P. Hayes, Falah H. Ali:
Robust Ad-hoc Sensor Routing (RASeR) protocol for mobile wireless sensor networks. Ad Hoc Networks 50: 128-144 (2016) - [j11]Tom Hayes, Falah H. Ali:
Location aware sensor routing protocol for mobile wireless sensor networks. IET Wirel. Sens. Syst. 6(2): 49-57 (2016) - [j10]Varsha Dani, Thomas P. Hayes, Cristopher Moore, Alexander Russell:
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem. Random Struct. Algorithms 49(4): 742-765 (2016) - 2015
- [j9]Tom Hayes, Falah H. Ali:
Proactive Highly Ambulatory Sensor Routing (PHASeR) protocol for mobile wireless sensor networks. Pervasive Mob. Comput. 21: 47-61 (2015) - [j8]Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda:
Randomly coloring planar graphs with fewer colors than the maximum degree. Random Struct. Algorithms 47(4): 731-759 (2015) - 2013
- [j7]Thomas P. Hayes:
Local uniformity properties for glauber dynamics on graph colorings. Random Struct. Algorithms 43(2): 139-180 (2013) - [j6]Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly coloring constant degree graphs. Random Struct. Algorithms 43(2): 181-200 (2013) - 2012
- [j5]Thomas P. Hayes, Jared Saia, Amitabh Trehan:
The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. Distributed Comput. 25(4): 261-278 (2012) - 2011
- [j4]Thomas P. Hayes:
Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem. Discret. Math. Theor. Comput. Sci. 13(4): 15-22 (2011) - 2007
- [j3]Thomas P. Hayes, Eric Vigoda:
Variable length path coupling. Random Struct. Algorithms 31(3): 251-272 (2007) - 2002
- [j2]Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek:
The Quantum Black-Box Complexity of Majority. Algorithmica 34(4): 480-501 (2002) - 2001
- [j1]László Babai, Thomas P. Hayes, Peter G. Kimmel:
The Cost of the Missing Bit: Communication Complexity with Help. Comb. 21(4): 455-488 (2001)
Conference and Workshop Papers
- 2025
- [c43]Varsha Dani, Thomas P. Hayes:
A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite Graphs. SODA 2025: 4899-4913 - 2024
- [c42]Varsha Dani, Thomas P. Hayes, Seth Pettie, Jared Saia:
Fraud Detection for Random Walks. ITCS 2024: 36:1-36:22 - [c41]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes:
Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. PODC 2024: 412-415 - 2023
- [c40]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. APPROX/RANDOM 2023: 33:1-33:16 - 2022
- [c39]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Improved Reconstruction of Random Geometric Graphs. ICALP 2022: 48:1-48:17 - [c38]Varsha Dani, Thomas P. Hayes:
How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. DISC 2022: 16:1-16:22 - 2021
- [c37]Varsha Dani, Diksha Gupta, Thomas P. Hayes:
On the Power of Choice for k-Colorability of Random Graphs. APPROX-RANDOM 2021: 59:1-59:17 - [c36]Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie:
Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks. PODC 2021: 151-153 - [c35]Weiming Feng, Thomas P. Hayes, Yitong Yin:
Distributed Metropolis Sampler with Optimal Parallelism. SODA 2021: 2121-2140 - [c34]Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie:
Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks. DISC 2021: 19:1-19:14 - 2020
- [c33]Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia:
A Scalable Algorithm for Multiparty Interactive Communication with Private Channels. ICDCN 2020: 8:1-8:15 - [c32]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie:
The Energy Complexity of BFS in Radio Networks. PODC 2020: 273-282 - 2019
- [c31]Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Improved Strong Spatial Mixing for Colorings on Trees. APPROX-RANDOM 2019: 48:1-48:16 - [c30]Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia:
Multiparty Interactive Communication with Private Channels. PODC 2019: 147-149 - 2018
- [c29]Giovanni Camurati, Sebastian Poeplau, Marius Muench, Tom Hayes, Aurélien Francillon:
Screaming Channels: When Electromagnetic Side Channels Meet Radio Transceivers. CCS 2018: 163-177 - [c28]Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia:
Sending a Message with Unknown Noise. ICDCN 2018: 8:1-8:10 - [c27]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie:
The Energy Complexity of Broadcast. PODC 2018: 95-104 - [c26]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Sampling Random Colorings of Sparse Random Graphs. SODA 2018: 1759-1771 - 2016
- [c25]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin:
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. FOCS 2016: 704-713 - 2013
- [c24]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
The Power of Choice for Random Satisfiability. APPROX-RANDOM 2013: 484-496 - [c23]Vamsi K. Potluru, Sergey M. Plis, Jonathan Le Roux, Barak A. Pearlmutter, Vince D. Calhoun, Thomas P. Hayes:
Block Coordinate Descent for Sparse NMF. ICLR (Poster) 2013 - 2011
- [c22]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 - 2010
- [c21]Thomas P. Hayes, Alistair Sinclair:
Liftings of Tree-Structured Markov Chains - (Extended Abstract). APPROX-RANDOM 2010: 602-616 - 2009
- [c20]Thomas P. Hayes, Jared Saia, Amitabh Trehan:
The forgiving graph: a distributed data structure for low stretch under adversarial attack. PODC 2009: 121-130 - [c19]Nikhil R. Devanur, Thomas P. Hayes:
The adwords problem: online keyword matching with budgeted bidders under random permutations. EC 2009: 71-78 - 2008
- [c18]Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, Sham M. Kakade, Alexander Rakhlin, Ambuj Tewari:
High-Probability Regret Bounds for Bandit Online Linear Optimization. COLT 2008: 335-342 - [c17]Varsha Dani, Thomas P. Hayes, Sham M. Kakade:
Stochastic Linear Optimization under Bandit Feedback. COLT 2008: 355-366 - [c16]Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Trehan:
The forgiving tree: a self-healing distributed data structure. PODC 2008: 203-212 - [c15]Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan:
Minimizing average latency in oblivious routing. SODA 2008: 200-207 - 2007
- [c14]Varsha Dani, Thomas P. Hayes, Sham M. Kakade:
The Price of Bandit Information for Online Optimization. NIPS 2007: 345-352 - [c13]Baruch Awerbuch, Thomas P. Hayes:
Online collaborative filtering with nearly optimal dynamic regret. SPAA 2007: 315-319 - [c12]Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda:
Randomly coloring planar graphs with fewer colors than the maximum degree. STOC 2007: 450-458 - 2006
- [c11]Thomas P. Hayes:
A simple condition implying rapid mixing of single-site dynamics on spin systems. FOCS 2006: 39-46 - [c10]Varsha Dani, Thomas P. Hayes:
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. SODA 2006: 937-943 - 2005
- [c9]Thomas P. Hayes, Alistair Sinclair:
A general lower bound for mixing of single-site dynamics on graphs. FOCS 2005: 511-520 - [c8]Alina Beygelzimer, Varsha Dani, Thomas P. Hayes, John Langford, Bianca Zadrozny:
Error limiting reductions between classification tasks. ICML 2005: 49-56 - [c7]Thomas P. Hayes, Eric Vigoda:
Coupling with the stationary distribution and improved sampling for colorings and independent sets. SODA 2005: 971-979 - [c6]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 - 2004
- [c5]Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly Coloring Constant Degree Graphs. FOCS 2004: 582-589 - [c4]Thomas P. Hayes, Eric Vigoda:
Variable length path coupling. SODA 2004: 103-110 - 2003
- [c3]Thomas P. Hayes, Eric Vigoda:
A Non-Markovian Coupling for Randomly Sampling Colorings. FOCS 2003: 618-627 - [c2]Thomas P. Hayes:
Randomly coloring graphs of girth at least five. STOC 2003: 269-278 - 1998
- [c1]László Babai, Thomas P. Hayes, Peter G. Kimmel:
The Cost of the Missing Bit: Communication Complexity with Help. STOC 1998: 673-682
Informal and Other Publications
- 2024
- [i24]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes:
Low-Distortion Clustering in Bounded Growth Graphs. CoRR abs/2405.05132 (2024) - 2023
- [i23]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. CoRR abs/2307.07727 (2023) - 2022
- [i22]Varsha Dani, Thomas P. Hayes:
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. CoRR abs/2205.12830 (2022) - 2021
- [i21]Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie:
Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks. CoRR abs/2104.09096 (2021) - [i20]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
Improved Reconstruction of Random Geometric Graphs. CoRR abs/2107.14323 (2021) - 2020
- [i19]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie:
The Energy Complexity of BFS in Radio Networks. CoRR abs/2007.09816 (2020) - 2019
- [i18]Weiming Feng, Thomas P. Hayes, Yitong Yin:
Fully-Asynchronous Distributed Metropolis Sampler with Optimal Speedup. CoRR abs/1904.00943 (2019) - [i17]Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Improved Strong Spatial Mixing for Colorings on Trees. CoRR abs/1909.07059 (2019) - 2018
- [i16]Weiming Feng, Thomas P. Hayes, Yitong Yin:
Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors). CoRR abs/1802.06953 (2018) - 2017
- [i15]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda:
Sampling Random Colorings of Sparse Random Graphs. CoRR abs/1707.03796 (2017) - [i14]Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie:
The Energy Complexity of Broadcast. CoRR abs/1710.01800 (2017) - [i13]Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia:
Distributed Computing with Channel Noise. IACR Cryptol. ePrint Arch. 2017: 710 (2017) - 2016
- [i12]Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin:
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. CoRR abs/1604.01422 (2016) - [i11]Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia:
Secure one-way interactive communication. CoRR abs/1605.04486 (2016) - [i10]Varsha Dani, Thomas P. Hayes, Cristopher Moore, Alexander Russell:
Codes, Lower Bounds, and Phase Transitions in the Symmetric Rendezvous Problem. CoRR abs/1609.01582 (2016) - [i9]Abhinav Aggarwal, Varsha Dani, Nico Döttling, Thomas P. Hayes, Jared Saia:
Secure Multiparty Interactive Communication with Unknown Noise Rate. CoRR abs/1612.05943 (2016) - 2014
- [i8]Thomas P. Hayes, Cristopher Moore:
Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics. CoRR abs/1407.1930 (2014) - 2012
- [i7]Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore:
The Power of Choice for Random Satisfiability. CoRR abs/1211.6997 (2012) - 2011
- [i6]Thomas P. Hayes:
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman. CoRR abs/1112.0829 (2011) - 2009
- [i5]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
- [i4]Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Trehan:
The Forgiving Tree: A Self-Healing Distributed Data Structure. CoRR abs/0802.3267 (2008) - 2006
- [i3]Varsha Dani, Thomas P. Hayes:
How to Beat the Adaptive Multi-Armed Bandit. CoRR abs/cs/0602053 (2006) - 2004
- [i2]Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda:
Randomly coloring constant degree graphs. Electron. Colloquium Comput. Complex. TR04 (2004) - [i1]Alina Beygelzimer, Varsha Dani, Thomas P. Hayes, John Langford:
Reductions Between Classification Tasks. Electron. Colloquium Comput. Complex. TR04 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-29 22:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
