Articles with public access mandates - Thomas P. HayesLearn more
Available somewhere: 16
Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
C Efthymiou, TP Hayes, D Stefankovic, E Vigoda, Y Yin
SIAM Journal on Computing 48 (2), 581-643, 2019
Mandates: US National Science Foundation, National Natural Science Foundation of China …
The energy complexity of broadcast
YJ Chang, V Dani, TP Hayes, Q He, W Li, S Pettie
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
Mandates: US National Science Foundation
Interactive communication with unknown noise rate
V Dani, TP Hayes, M Movahedi, J Saia, M Young
Information and computation 261, 464-486, 2018
Mandates: US National Science Foundation
Sampling random colorings of sparse random graphs
C Efthymiou, TP Hayes, D Štefankovič, E Vigoda
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Mandates: US National Science Foundation, German Research Foundation
The energy complexity of BFS in radio networks
YJ Chang, V Dani, TP Hayes, S Pettie
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
Mandates: US National Science Foundation
Bounds on the diameter of Cayley graphs of the symmetric group
J Bamberg, N Gill, TP Hayes, HA Helfgott, Á Seress, P Spiga
Journal of Algebraic Combinatorics 40 (1), 1-22, 2014
Mandates: Australian Research Council
Wake up and join me! an energy-efficient algorithm for maximal matching in radio networks
V Dani, A Gupta, TP Hayes, S Pettie
Distributed Computing 36 (3), 373-384, 2023
Mandates: US National Science Foundation
Distributed metropolis sampler with optimal parallelism
W Feng, TP Hayes, Y Yin
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Mandates: US National Science Foundation, National Natural Science Foundation of China
Sending a message with unknown noise
A Aggarwal, V Dani, TP Hayes, J Saia
Proceedings of the 19th International Conference on Distributed Computing …, 2018
Mandates: US National Science Foundation
Sparseness and a reduction from totally nonnegative least squares to svm
VK Potluru, SM Plis, S Luan, VD Calhoun, TP Hayes
The 2011 International Joint Conference on Neural Networks, 1922-1929, 2011
Mandates: US National Institutes of Health
A scalable algorithm for multiparty interactive communication with private channels
A Aggarwal, V Dani, TP Hayes, J Saia
Proceedings of the 21st International Conference on Distributed Computing …, 2020
Mandates: US National Science Foundation
Multiparty interactive communication with private channels
A Aggarwal, V Dani, TP Hayes, J Saia
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
Mandates: US National Science Foundation
Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
V Dani, TP Hayes, C Moore, A Russell
Random Structures & Algorithms 49 (4), 742-765, 2016
Mandates: US National Science Foundation
Improved reconstruction of random geometric graphs
V Dani, J Díaz Cort, TP Hayes, C Moore
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022
Mandates: US National Science Foundation
Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks
V Dani, A Gupta, TP Hayes, S Pettie
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021
Mandates: US National Science Foundation
Sequential Sparse NMF
VK Potluru, SM Plis, BA Pearlmutter, VD Calhoun, TP Hayes
Mandates: US National Institutes of Health
Publication and funding information is determined automatically by a computer program