| 2025 | PODC | Brief Announcement: Energy-Efficient Maximal Independent Sets in Radio Networks. | Dominick Banasik, Varsha Dani, Fabien Dufoulon, Aayush Gupta, Thomas P. Hayes, Gopal Pandurangan |
| 2025 | SODA | A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite Graphs. | Varsha Dani, Thomas P. Hayes |
| 2025 | SIROCCO | Low-Distortion Clustering in Bounded Growth Graphs. | Yi-Jun Chang, Varsha Dani, Thomas P. Hayes |
| 2024 | PODC | Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs. | Yi-Jun Chang, Varsha Dani, Thomas P. Hayes |
| 2022 | ICALP | Improved Reconstruction of Random Geometric Graphs. | Varsha Dani, Josep Daz, Thomas P. Hayes, Cristopher Moore |
| 2021 | PODC | 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 |
| 2021 | SODA | Distributed Metropolis Sampler with Optimal Parallelism. | Weiming Feng, Thomas P. Hayes, Yitong Yin |
| 2020 | ICDCN | A Scalable Algorithm for Multiparty Interactive Communication with Private Channels. | Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia |
| 2020 | PODC | The Energy Complexity of BFS in Radio Networks. | Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie |
| 2019 | PODC | Multiparty Interactive Communication with Private Channels. | Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia |
| 2018 | ICDCN | Sending a Message with Unknown Noise. | Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia |
| 2018 | PODC | The Energy Complexity of Broadcast. | Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie |
| 2018 | SODA | Sampling Random Colorings of Sparse Random Graphs. | Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda |
| 2016 | FOCS | Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. | Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin |
| 2011 | IJCNN | 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 |
| 2009 | PODC | The forgiving graph: a distributed data structure for low stretch under adversarial attack. | Thomas P. Hayes, Jared Saia, Amitabh Trehan |
| 2008 | COLT | High-Probability Regret Bounds for Bandit Online Linear Optimization. | Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, Sham M. Kakade, Alexander Rakhlin, Ambuj Tewari |
| 2008 | COLT | Stochastic Linear Optimization under Bandit Feedback. | Varsha Dani, Thomas P. Hayes, Sham M. Kakade |
| 2008 | SODA | Minimizing average latency in oblivious routing. | Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Rcke, Jaikumar Radhakrishnan |
| 2007 | STOC | Randomly coloring planar graphs with fewer colors than the maximum degree. | Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda |
| 2007 | SPAA | Online collaborative filtering with nearly optimal dynamic regret. | Baruch Awerbuch, Thomas P. Hayes |
| 2006 | FOCS | A simple condition implying rapid mixing of single-site dynamics on spin systems. | Thomas P. Hayes |
| 2006 | SODA | Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. | Varsha Dani, Thomas P. Hayes |
| 2005 | FOCS | A general lower bound for mixing of single-site dynamics on graphs. | Thomas P. Hayes, Alistair Sinclair |
| 2005 | ICML | Error limiting reductions between classification tasks. | Alina Beygelzimer, Varsha Dani, Thomas P. Hayes, John Langford, Bianca Zadrozny |
| 2005 | SODA | Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group. | Lszl Babai, Thomas P. Hayes |
| 2005 | SODA | Coupling with the stationary distribution and improved sampling for colorings and independent sets. | Thomas P. Hayes, Eric Vigoda |
| 2004 | FOCS | Randomly Coloring Constant Degree Graphs. | Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda |
| 2004 | SODA | Variable length path coupling. | Thomas P. Hayes, Eric Vigoda |
| 2003 | FOCS | A Non-Markovian Coupling for Randomly Sampling Colorings. | Thomas P. Hayes, Eric Vigoda |
| 2003 | STOC | Randomly coloring graphs of girth at least five. | Thomas P. Hayes |
| 1998 | STOC | The Cost of the Missing Bit: Communication Complexity with Help. | Lszl Babai, Thomas P. Hayes, Peter G. Kimmel |