| 2010 | FOCS | Vertex Sparsifiers and Abstract Rounding Algorithms. | Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra |
| 2010 | SPAA | Basic network creation games. | Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton |
| 2008 | FOCS | Some Results on Greedy Embeddings in Metric Spaces. | Ankur Moitra, Tom Leighton |
| 2007 | PODC | The Akamai approach to achieving performance and reliability on the internet. | Tom Leighton |
| 2007 | SODA | Semi-oblivious routing: lower bounds. | Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton |
| 2006 | SPAA | Semi-oblivious routing. | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton |
| 2005 | SODA | Online client-server load balancing without global information. | Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton |
| 2005 | SODA | Oblivious routing on node-capacitated and directed graphs. | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Rcke |
| 2005 | STOC | Oblivious routing in directed graphs with random demands. | Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Rcke |
| 1996 | ICIP | Secure spread spectrum watermarking for images, audio and video. | Ingemar J. Cox, Joe Kilian, Tom Leighton, Talal Shamoon |
| 1994 | STOC | Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. | Baruch Awerbuch, Tom Leighton |
| 1994 | STOC | Scalable expanders: exploiting hierarchical random wiring. | Eric A. Brewer, Frederic T. Chong, Tom Leighton |
| 1990 | ICCD | Empirical evaluation of randomly-wire multistage networks. | Tom Leighton, Derek Linsinski, Bruce M. Maggs |
| 1983 | WG | Parallel Computation Using Meshes of Trees. | Tom Leighton |