| 2010 | STOC | Extensions and limits to vertex sparsification. | Frank Thomson Leighton, Ankur Moitra |
| 2006 | SODA | Improved lower and upper bounds for universal TSP in planar metrics. | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton |
| 2006 | SODA | New lower bounds for oblivious routing in undirected graphs. | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Rcke |
| 2005 | NSDI | The Challenges of Delivering Content and Applications on the Internet. | Frank Thomson Leighton |
| 2003 | FOCS | The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions. | Robert D. Kleinberg, Frank Thomson Leighton |
| 2003 | STOC | Consistent load balancing via spread minimization. | Robert D. Kleinberg, Frank Thomson Leighton |
| 2001 | NCA | The Challenges of Delivering Content on the Internet. | Frank Thomson Leighton |
| 2001 | PODS | The Challenges of Delivering Content on the Internet. | Frank Thomson Leighton |
| 2001 | SODA | Guessing secrets. | Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton |
| 2001 | WADS | The Challenges of Delivering Content on the Internet. | Frank Thomson Leighton |
| 2000 | STOC | Compression using efficient multicasting. | Micah Adler, Frank Thomson Leighton |
| 1999 | PODC | Resource Discovery in Distributed Networks. | Mor Harchol-Balter, Frank Thomson Leighton, Daniel Lewin |
| 1999 | SODA | New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. | Frank Thomson Leighton, Satish Rao, Aravind Srinivasan |
| 1998 | RECOMB | Protein folding in the hydrophobic-hydrophilic ( | Bonnie Berger, Frank Thomson Leighton |
| 1997 | FOCS | General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate). | Matthew Andrews, Antonio Fernndez, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang |
| 1997 | SODA | The Path Resistance Method for Bounding lambda | Stephen Guattery, Frank Thomson Leighton, Gary L. Miller |
| 1997 | STOC | Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. | David R. Karger, Eric P. Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin |
| 1996 | FOCS | Universal Stability Results for Greedy Contention-Resolution Protocols. | Matthew Andrews, Baruch Awerbuch, Antonio Fernndez, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu |
| 1996 | STOC | Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). | Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang |
| 1996 | STOC | Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract). | Baruch Awerbuch, Yossi Azar, Amos Fiat, Frank Thomson Leighton |
| 1996 | STOC | Reconstructing a Three-Dimensional Model with Arbitrary Errors. | Bonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton |
| 1996 | SPAA | Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). | Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang |
| 1995 | CRYPTO | Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract). | Joe Kilian, Frank Thomson Leighton |
| 1995 | SODA | The Statistical Adversary Allows Optimal Money-Making Trading Strategies. | Andrew Chou, Jeremy R. Cooperstock, Ran El-Yaniv, Michael Klugerman, Frank Thomson Leighton |
| 1995 | SODA | Greedy Dynamic Routing on Arrays. | Nabil Kahal, Frank Thomson Leighton |
| 1995 | STOC | Tight analyses of two local load balancing algorithms. | Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andra W. Richa, Robert Endre Tarjan, David Zuckerman |
| 1995 | STOC | Lower bounds for sorting networks. | Nabil Kahal, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerdi |
| 1995 | SPAA | On Probabilistic Networks for Selection, Merging, and Sorting. | Frank Thomson Leighton, Yuan Ma, Torsten Suel |
| 1994 | FOCS | On-line Admission Control and Circuit Routing for High Performance Computing and Communication | Baruch Awerbuch, Rainer Gawlick, Frank Thomson Leighton, Yuval Rabani |
| 1994 | FOCS | On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates | Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma |
| 1994 | SPAA | Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff. | Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg |
| 1994 | SPAA | Minimal Adaptive Routing on the Mesh with Bounded Queue Size. | Donald D. Chinn, Frank Thomson Leighton, Martin Tompa |
| 1993 | CRYPTO | Secret-Key Agreement without Public-Key Cryptography. | Frank Thomson Leighton, Silvio Micali |
| 1993 | FOCS | A Simple Local-Control Approximation Algorithm for Multicommodity Flow | Baruch Awerbuch, Frank Thomson Leighton |
| 1993 | FOCS | Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract) | Frank Thomson Leighton, Yuan Ma |
| 1993 | ISAAC | Multicommodity Flows: A Survey of Recent Research. | Baruch Awerbuch, Frank Thomson Leighton |
| 1993 | SPAA | A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. | Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao |
| 1993 | SPAA | Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks With Destructive Faults. | Frank Thomson Leighton, Yuan Ma |
| 1992 | FOCS | On the Fault Tolerance of Some Popular Bounded-Degree Networks | Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman |
| 1992 | STOC | Methods for Message Routing in Parallel Machines | Frank Thomson Leighton |
| 1992 | WG | Improved Algorithms for Routing on Two-Dimensional Grids. | Dinesh Bhatia, Frank Thomson Leighton, Fillia Makedon, Carolyn Haibt Norton |
| 1991 | FOCS | Highly Fault-Tolerant Sorting Circuits | Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton |
| 1991 | FOCS | Efficient Algorithms for Dynamic Allocation of Distributed Memory | Frank Thomson Leighton, Eric J. Schwabe |
| 1991 | SODA | Tight Bounds for On-Line Tree Embeddings. | Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu |
| 1991 | STOC | Fast Approximation Algorithms for Multicommodity Flow Problems | Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, va Tardos, Spyros Tragoudas |
| 1991 | SPAA | Coding Theory, Hypercube Embeddings, and Fault Tolerance. | William Aiello, Frank Thomson Leighton |
| 1990 | FOCS | Drawing Graphs in the Plane with High Resolution | Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger |
| 1990 | FOCS | Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) | Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas |
| 1990 | FOCS | A (fairly) Simple Circuit that (usually) Sorts | Frank Thomson Leighton, C. Greg Plaxton |
| 1990 | SODA | First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space. | Edward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton |
| 1990 | STOC | Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract) | Alok Aggarwal, Mark Hansen, Frank Thomson Leighton |
| 1990 | STOC | On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract) | Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs |
| 1990 | SPAA | Fast Algorithms for Bit-Serial Routing on a Hypercube. | William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman |
| 1990 | SPAA | Average Case Analysis of Greedy Routing algorithms on Arrays. | Frank Thomson Leighton |
| 1989 | DAC | Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms. | Thang Nguyen Bui, C. Heigham, Curt Jones, Frank Thomson Leighton |
| 1989 | FOCS | Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies | Frank Thomson Leighton, Bruce M. Maggs |
| 1989 | STOC | Fast Computation Using Faulty Hypercubes (Extended Abstract) | Johan Hstad, Frank Thomson Leighton, Mark Newman |
| 1989 | STOC | Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) | Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg |
| 1989 | SPAA | A 2 | Frank Thomson Leighton, Fillia Makedon, Ioannis G. Tollis |
| 1989 | SPAA | Dynamic Tree Embeddings in Butterflies and Hypercubes. | Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe |
| 1988 | FOCS | Universal Packet Routing Algorithms (Extended Abstract) | Frank Thomson Leighton, Bruce M. Maggs, Satish Rao |
| 1988 | FOCS | An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms | Frank Thomson Leighton, Satish Rao |
| 1988 | STOC | Optimal Simulations by Butterfly Networks (Preliminary Version) | Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Arnold L. Rosenberg |
| 1987 | STOC | Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract) | Johan Hstad, Frank Thomson Leighton, Mark Newman |
| 1987 | STOC | Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract) | Johan Hstad, Frank Thomson Leighton, Brian Rogoff |
| 1986 | FOCS | Optimal Simulations of Tree Machines (Preliminary Version) | Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg |
| 1986 | STOC | A Provably Efficient Algorithm for Dynamic Storage Allocation | Edward G. Coffman Jr., Frank Thomson Leighton |
| 1986 | STOC | Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms | Frank Thomson Leighton, Peter W. Shor |
| 1984 | FOCS | Graph Bisection Algorithms with Good Average Case Behavior | Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser |
| 1984 | STOC | Some Unexpected Expected Behavior Results for Bin Packing | Jon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch |
| 1984 | STOC | Tight Bounds on the Complexity of Parallel Sorting | Frank Thomson Leighton |
| 1983 | FCT | Estimating a Probability Using Finite Memory (Extended Abstract). | Frank Thomson Leighton, Ronald L. Rivest |
| 1983 | FOCS | Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) | Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani |
| 1983 | STOC | An Approximation Algorithm for Manhattan Routing (Extended Abstract) | Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton |
| 1982 | FOCS | Wafer-Scale Integration of Systolic Arrays (Extended Abstract) | Frank Thomson Leighton, Charles E. Leiserson |
| 1982 | STOC | A Layout Strategy for VLSI which Is Provably Good (Extended Abstract) | Frank Thomson Leighton |
| 1981 | FOCS | New Lower Bound Techniques for VLSI | Frank Thomson Leighton |
| 1981 | STOC | New Layouts for the Shuffle-Exchange Graph (Extended Abstract) | Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller |