The Cost of the Missing Bit: Communication Complexity with Help. - László Babai; Thomas P. Hayes; Peter G. Kimmel (Comb., 2001)

The Quantum Black-Box Complexity of Majority. - Thomas P. Hayes; Samuel Kutin; Dieter van Melkebeek (Algorithmica, 2002)

A Non-Markovian Coupling for Randomly Sampling Colorings. - Thomas P. Hayes; Eric Vigoda (FOCS, 2003)

Randomly coloring graphs of girth at least five. - Thomas P. Hayes (STOC, 2003)

Randomly coloring constant degree graphs - Martin E. Dyer; Alan M. Frieze; Thomas P. Hayes; Eric Vigoda (Electron. Colloquium Comput. Complex., 2004)

Reductions Between Classification Tasks - Alina Beygelzimer; Varsha Dani; Thomas P. Hayes; John Langford 001 (Electron. Colloquium Comput. Complex., 2004)

A general lower bound for mixing of single-site dynamics on graphs. - Thomas P. Hayes; Alistair Sinclair (FOCS, 2005)

Error limiting reductions between classification tasks. - Alina Beygelzimer; Varsha Dani; Thomas P. Hayes; John Langford 001; Bianca Zadrozny (ICML, 2005)

Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group. - László Babai; Thomas P. Hayes (SODA, 2005)

Coupling with the stationary distribution and improved sampling for colorings and independent sets. - Thomas P. Hayes; Eric Vigoda (SODA, 2005)

A simple condition implying rapid mixing of single-site dynamics on spin systems. - Thomas P. Hayes (FOCS, 2006)

Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. - Varsha Dani; Thomas P. Hayes (SODA, 2006)

How to Beat the Adaptive Multi-Armed Bandit - Varsha Dani; Thomas P. Hayes (CoRR, 2006)

The Price of Bandit Information for Online Optimization. - Varsha Dani; Thomas P. Hayes; Sham M. Kakade (NIPS, 2007)

Online collaborative filtering with nearly optimal dynamic regret. - Baruch Awerbuch; Thomas P. Hayes (SPAA, 2007)

Variable length path coupling. - Thomas P. Hayes; Eric Vigoda (Random Struct. Algorithms, 2007)

High-Probability Regret Bounds for Bandit Online Linear Optimization. - Peter L. Bartlett; Varsha Dani; Thomas P. Hayes; Sham M. Kakade; Alexander Rakhlin; Ambuj Tewari (COLT, 2008)

Stochastic Linear Optimization under Bandit Feedback. - Varsha Dani; Thomas P. Hayes; Sham M. Kakade (COLT, 2008)

The forgiving tree: a self-healing distributed data structure. - Tom Hayes; Navin Rustagi; Jared Saia; Amitabh Trehan (PODC, 2008)

Minimizing average latency in oblivious routing. - Prahladh Harsha; Thomas P. Hayes; Hariharan Narayanan; Harald Räcke; Jaikumar Radhakrishnan (SODA, 2008)

The adwords problem: online keyword matching with budgeted bidders under random permutations. - Nikhil R. Devanur; Thomas P. Hayes (EC, 2009)

Liftings of Tree-Structured Markov Chains - (Extended Abstract). - Thomas P. Hayes; Alistair Sinclair (APPROX-RANDOM, 2010)

Sparseness and a reduction from Totally Nonnegative Least Squares to SVM. - Vamsi K. Potluru; Sergey M. Plis; Shuang Luan; Vince D. Calhoun; Thomas P. Hayes (IJCNN, 2011)

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman - Thomas P. Hayes (CoRR, 2011)

Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem. - Thomas P. Hayes (Discret. Math. Theor. Comput. Sci., 2011)

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. - Thomas P. Hayes; Jared Saia; Amitabh Trehan (Distributed Comput., 2012)

The Power of Choice for Random Satisfiability. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (APPROX-RANDOM, 2013)

Block Coordinate Descent for Sparse NMF - Vamsi K. Potluru; Sergey M. Plis; Jonathan Le Roux; Barak A. Pearlmutter; Vince D. Calhoun; Thomas P. Hayes (ICLR (Poster), 2013)

Local uniformity properties for glauber dynamics on graph colorings. - Thomas P. Hayes (Random Struct. Algorithms, 2013)

Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics. - Thomas P. Hayes; Cristopher Moore (CoRR, 2014)

Proactive Highly Ambulatory Sensor Routing (PHASeR) protocol for mobile wireless sensor networks. - Tom Hayes; Falah H. Ali (Pervasive Mob. Comput., 2015)

Randomly coloring planar graphs with fewer colors than the maximum degree. - Thomas P. Hayes; Juan Carlos Vera 001; Eric Vigoda (Random Struct. Algorithms, 2015)

Robust Ad-hoc Sensor Routing (RASeR) protocol for mobile wireless sensor networks. - Thomas P. Hayes; Falah H. Ali (Ad Hoc Networks, 2016)

Secure Multiparty Interactive Communication with Unknown Noise Rate. - Abhinav Aggarwal; Varsha Dani; Nico Döttling; Thomas P. Hayes; Jared Saia (CoRR, 2016)

Secure one-way interactive communication. - Abhinav Aggarwal; Varsha Dani; Thomas P. Hayes; Jared Saia (CoRR, 2016)

Location aware sensor routing protocol for mobile wireless sensor networks. - Tom Hayes; Falah H. Ali (IET Wirel. Sens. Syst., 2016)

Codes, lower bounds, and phase transitions in the symmetric rendezvous problem. - Varsha Dani; Thomas P. Hayes; Cristopher Moore; Alexander Russell (Random Struct. Algorithms, 2016)

Distributed Computing with Channel Noise. - Abhinav Aggarwal; Varsha Dani; Thomas P. Hayes; Jared Saia (IACR Cryptol. ePrint Arch., 2017)

Medium access control schemes for flat mobile wireless sensor networks. - Tom Hayes; Falah H. Ali (IET Wirel. Sens. Syst., 2017)

Screaming Channels: When Electromagnetic Side Channels Meet Radio Transceivers. - Giovanni Camurati; Sebastian Poeplau; Marius Muench; Tom Hayes; Aurélien Francillon (CCS, 2018)

Sending a Message with Unknown Noise. - Abhinav Aggarwal; Varsha Dani; Thomas P. Hayes; Jared Saia (ICDCN, 2018)

The Energy Complexity of Broadcast. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes; Qizheng He; Wenzheng Li; Seth Pettie (PODC, 2018)

Sampling Random Colorings of Sparse Random Graphs. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (SODA, 2018)

Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors). - Weiming Feng 001; Thomas P. Hayes; Yitong Yin (CoRR, 2018)

Interactive communication with unknown noise rate. - Varsha Dani; Thomas P. Hayes; Mahnush Movahedi; Jared Saia; Maxwell Young (Inf. Comput., 2018)

Improved Strong Spatial Mixing for Colorings on Trees. - Charilaos Efthymiou 001; Andreas Galanis; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (APPROX-RANDOM, 2019)

Multiparty Interactive Communication with Private Channels. - Abhinav Aggarwal; Varsha Dani; Thomas P. Hayes; Jared Saia (PODC, 2019)

Fully-Asynchronous Distributed Metropolis Sampler with Optimal Speedup. - Weiming Feng 001; Thomas P. Hayes; Yitong Yin (CoRR, 2019)

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda; Yitong Yin (SIAM J. Comput., 2019)

A Scalable Algorithm for Multiparty Interactive Communication with Private Channels. - Abhinav Aggarwal; Varsha Dani; Thomas P. Hayes; Jared Saia (ICDCN, 2020)

The Energy Complexity of BFS in Radio Networks. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes; Seth Pettie (PODC, 2020)

On the Power of Choice for k-Colorability of Random Graphs. - Varsha Dani; Diksha Gupta; Thomas P. Hayes (APPROX-RANDOM, 2021)

Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks. - Varsha Dani; Aayush Gupta; Thomas P. Hayes; Seth Pettie (PODC, 2021)

Distributed Metropolis Sampler with Optimal Parallelism. - Weiming Feng 001; Thomas P. Hayes; Yitong Yin (SODA, 2021)

Improved Reconstruction of Random Geometric Graphs. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (ICALP, 2022)

How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks. - Varsha Dani; Thomas P. Hayes (DISC, 2022)

Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks. - Varsha Dani; Aayush Gupta; Thomas P. Hayes; Seth Pettie (Distributed Comput., 2023)

Fraud Detection for Random Walks. - Varsha Dani; Thomas P. Hayes; Seth Pettie; Jared Saia (ITCS, 2024)

Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes (PODC, 2024)

Reconstruction of random geometric graphs: Breaking the Ω(r) distortion barrier. - Varsha Dani; Josep Díaz; Thomas P. Hayes; Cristopher Moore (Eur. J. Comb., 2024)

Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks. - Dominick Banasik; Varsha Dani; Fabien Dufoulon; Aayush Gupta; Thomas P. Hayes; Gopal Pandurangan (PODC, 2025)

Low-Distortion Clustering in Bounded Growth Graphs. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes (SIROCCO, 2025)

A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite Graphs. - Varsha Dani; Thomas P. Hayes (SODA, 2025)

Optimal mixing via tensorization for random independent sets on arbitrary trees. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (Comb. Probab. Comput., 2025)