Thomas P. Hayes

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 40

Top Topics

Wireless Sensor

Energy Conservation

Symmetry Breaking

Top Venues

Publications

Varsha Dani, Thomas P. Hayes, Seth Pettie, Jared Saia
Fraud Detection for Random Walks. ITCS (2024)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes
Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. PODC (2024)
Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore
Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier. Eur. J. Comb. 121 (2024)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes
Low-Distortion Clustering in Bounded Growth Graphs. CoRR (2024)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. APPROX/RANDOM (2023)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. CoRR (2023)
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) (2023)
Varsha Dani, Thomas P. Hayes
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. CoRR (2022)
Varsha Dani, Thomas P. Hayes
How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. DISC (2022)
Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore
Improved Reconstruction of Random Geometric Graphs. ICALP (2022)
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)
Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore
Improved Reconstruction of Random Geometric Graphs. CoRR (2021)
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)
Weiming Feng, Thomas P. Hayes, Yitong Yin
Distributed Metropolis Sampler with Optimal Parallelism. SODA (2021)
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 (2021)
Varsha Dani, Diksha Gupta, Thomas P. Hayes
On the Power of Choice for k-Colorability of Random Graphs. APPROX-RANDOM (2021)
Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia
A Scalable Algorithm for Multiparty Interactive Communication with Private Channels. ICDCN (2020)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie
The Energy Complexity of BFS in Radio Networks. PODC (2020)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie
The Energy Complexity of BFS in Radio Networks. CoRR (2020)
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) (2019)
Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia
Multiparty Interactive Communication with Private Channels. PODC (2019)
Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Improved Strong Spatial Mixing for Colorings on Trees. CoRR (2019)
Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Improved Strong Spatial Mixing for Colorings on Trees. APPROX-RANDOM (2019)
Weiming Feng, Thomas P. Hayes, Yitong Yin
Fully-Asynchronous Distributed Metropolis Sampler with Optimal Speedup. CoRR (2019)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Sampling Random Colorings of Sparse Random Graphs. SODA (2018)
Varsha Dani, Thomas P. Hayes, Mahnush Movahedi, Jared Saia, Maxwell Young
Interactive communication with unknown noise rate. Inf. Comput. 261 (2018)
Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia
Sending a Message with Unknown Noise. ICDCN (2018)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie
The Energy Complexity of Broadcast. PODC (2018)
Weiming Feng, Thomas P. Hayes, Yitong Yin
Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors). CoRR (2018)
Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia
Distributed Computing with Channel Noise. IACR Cryptol. ePrint Arch. 2017 (2017)
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
Sampling Random Colorings of Sparse Random Graphs. CoRR (2017)
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie
The Energy Complexity of Broadcast. CoRR (2017)
Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia
Secure one-way interactive communication. CoRR (2016)
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 (2016)
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) (2016)
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)
Abhinav Aggarwal, Varsha Dani, Nico Döttling, Thomas P. Hayes, Jared Saia
Secure Multiparty Interactive Communication with Unknown Noise Rate. CoRR (2016)
Thomas P. Hayes, Falah H. Ali
Robust Ad-hoc Sensor Routing (RASeR) protocol for mobile wireless sensor networks. Ad Hoc Networks 50 (2016)
Varsha Dani, Thomas P. Hayes, Cristopher Moore, Alexander Russell
Codes, Lower Bounds, and Phase Transitions in the Symmetric Rendezvous Problem. CoRR (2016)
Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda
Randomly coloring planar graphs with fewer colors than the maximum degree. Random Struct. Algorithms 47 (4) (2015)
Thomas P. Hayes, Cristopher Moore
Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics. CoRR (2014)
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)
Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
Randomly coloring constant degree graphs. Random Struct. Algorithms 43 (2) (2013)
Thomas P. Hayes
Local uniformity properties for glauber dynamics on graph colorings. Random Struct. Algorithms 43 (2) (2013)
Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore
The Power of Choice for Random Satisfiability. APPROX-RANDOM (2013)
Thomas P. Hayes, Jared Saia, Amitabh Trehan
The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. Distributed Comput. 25 (4) (2012)
Varsha Dani, Josep Díaz, Thomas P. Hayes, Cristopher Moore
The Power of Choice for Random Satisfiability CoRR (2012)
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)
Thomas P. Hayes
Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem. Discret. Math. Theor. Comput. Sci. 13 (4) (2011)
Thomas P. Hayes
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman CoRR (2011)
Thomas P. Hayes, Alistair Sinclair
Liftings of Tree-Structured Markov Chains - (Extended Abstract). APPROX-RANDOM (2010)
Nikhil R. Devanur, Thomas P. Hayes
The adwords problem: online keyword matching with budgeted bidders under random permutations. EC (2009)
Thomas P. Hayes, Jared Saia, Amitabh Trehan
The forgiving graph: a distributed data structure for low stretch under adversarial attack. PODC (2009)
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)
Varsha Dani, Thomas P. Hayes, Sham M. Kakade
Stochastic Linear Optimization under Bandit Feedback. COLT (2008)
Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan
Minimizing average latency in oblivious routing. SODA (2008)
Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda
Randomly coloring planar graphs with fewer colors than the maximum degree. STOC (2007)
Thomas P. Hayes, Eric Vigoda
Variable length path coupling. Random Struct. Algorithms 31 (3) (2007)
Baruch Awerbuch, Thomas P. Hayes
Online collaborative filtering with nearly optimal dynamic regret. SPAA (2007)
Varsha Dani, Thomas P. Hayes, Sham M. Kakade
The Price of Bandit Information for Online Optimization. NIPS (2007)
Thomas P. Hayes
A simple condition implying rapid mixing of single-site dynamics on spin systems. FOCS (2006)
Varsha Dani, Thomas P. Hayes
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. SODA (2006)
Varsha Dani, Thomas P. Hayes
How to Beat the Adaptive Multi-Armed Bandit CoRR (2006)
Thomas P. Hayes, Eric Vigoda
Coupling with the stationary distribution and improved sampling for colorings and independent sets. SODA (2005)
Alina Beygelzimer, Varsha Dani, Thomas P. Hayes, John Langford, Bianca Zadrozny
Error limiting reductions between classification tasks. ICML (2005)
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)
Thomas P. Hayes, Alistair Sinclair
A general lower bound for mixing of single-site dynamics on graphs. FOCS (2005)
Thomas P. Hayes, Eric Vigoda
Variable length path coupling. SODA (2004)
Alina Beygelzimer, Varsha Dani, Thomas P. Hayes, John Langford
Reductions Between Classification Tasks Electron. Colloquium Comput. Complex. (077) (2004)
Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
Randomly Coloring Constant Degree Graphs. FOCS (2004)
Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
Randomly coloring constant degree graphs Electron. Colloquium Comput. Complex. (009) (2004)
Thomas P. Hayes
Randomly coloring graphs of girth at least five. STOC (2003)
Thomas P. Hayes, Eric Vigoda
A Non-Markovian Coupling for Randomly Sampling Colorings. FOCS (2003)
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek
The Quantum Black-Box Complexity of Majority. Algorithmica 34 (4) (2002)
László Babai, Thomas P. Hayes, Peter G. Kimmel
The Cost of the Missing Bit: Communication Complexity with Help. Comb. 21 (4) (2001)
László Babai, Thomas P. Hayes, Peter G. Kimmel
The Cost of the Missing Bit: Communication Complexity with Help. STOC (1998)