Frank Thomson Leighton

165 papers A* 64B 20Misc 1Journal 67Unranked 13

Year	Rank	Type	Title / Venue / Authors
2010	A*	`conf`	Extensions and limits to vertex sparsification. STOC Frank Thomson Leighton, Ankur Moitra
2007	J	`jnl`	Hamming Codes, Hypercube Embeddings, and Fault Tolerance. SIAM J. Comput. William Aiello, Frank Thomson Leighton
2006	A*	`conf`	Improved lower and upper bounds for universal TSP in planar metrics. SODA Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton
2006	A*	`conf`	New lower bounds for oblivious routing in undirected graphs. SODA Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke
2005	Misc	`conf`	The Challenges of Delivering Content and Applications on the Internet. NSDI Frank Thomson Leighton
2004	—	`conf`	The Challenges of Delivering Content and Applications on the Internet. RIDE Frank Thomson Leighton
2003	A*	`conf`	Consistent load balancing via spread minimization. STOC Robert D. Kleinberg, Frank Thomson Leighton
2003	B	`conf`	Fractal Merkle Tree Representation and Traversal. CT-RSA Markus Jakobsson, Frank Thomson Leighton, Silvio Micali, Michael Szydlo
2003	J	`jnl`	JACM 1991-1997. J. ACM Frank Thomson Leighton
2003	A*	`conf`	The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions. FOCS Robert D. Kleinberg, Frank Thomson Leighton
2001	J	`jnl`	Compression Using Efficient Multicasting. J. Comput. Syst. Sci. Micah Adler, Frank Thomson Leighton
2001	J	`jnl`	Guessing Secrets. Electron. J. Comb. Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton
2001	A*	`conf`	Guessing secrets. SODA Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton
2001	J	`jnl`	New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SIAM J. Comput. Frank Thomson Leighton, Chi-Jen Lu, Satish Rao, Aravind Srinivasan
2001	B	`conf`	The Challenges of Delivering Content on the Internet. NCA Frank Thomson Leighton
2001	A*	`conf`	The Challenges of Delivering Content on the Internet. PODS Frank Thomson Leighton
2001	B	`conf`	The Challenges of Delivering Content on the Internet. WADS Frank Thomson Leighton
2001	J	`jnl`	Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Frank Thomson Leighton, Zhiyong Liu, Jon M. Kleinberg
2000	A*	`conf`	Compression using efficient multicasting. STOC Micah Adler, Frank Thomson Leighton
2000	J	`jnl`	General Dynamic Routing with Per-Packet Delay Guarantees of SIAM J. Comput. Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang
1999	J	`jnl`	Automatic Methods for Hiding Latency in Parallel and Distributed Computation. SIAM J. Comput. Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
1999	J	`jnl`	Efficient Algorithms for Dynamic Allocation of Distributed Memo. Algorithmica Frank Thomson Leighton, Eric J. Schwabe
1999	J	`jnl`	Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules. Comb. Frank Thomson Leighton, Bruce M. Maggs, Andréa W. Richa
1999	J	`jnl`	Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM Frank Thomson Leighton, Satish Rao
1999	A*	`conf`	New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SODA Frank Thomson Leighton, Satish Rao, Aravind Srinivasan
1999	—	`conf`	Oblivious Deadlock-Free Routing in a Faulty Hypercube. IPPS/SPDP Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
1999	A*	`ed.`	Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA STOC Jeffrey Scott Vitter, Lawrence L. Larmore, Frank Thomson Leighton
1999	J	`jnl`	Reconstructing a Three-Dimensional Model with Arbitrary Errors. J. ACM Bonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton
1999	A*	`conf`	Resource Discovery in Distributed Networks. PODC Mor Harchol-Balter, Frank Thomson Leighton, Daniel Lewin
1999	J	`jnl`	The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian. Comb. Probab. Comput. Stephen Guattery, Frank Thomson Leighton, Gary L. Miller
1999	J	`jnl`	Tight Analyses of Two Local Load Balancing Algorithms. SIAM J. Comput. Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
1999	J	`jnl`	Tight Bounds for On-Line Tree Embeddings. SIAM J. Comput. Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu
1999	J	`jnl`	Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults. SIAM J. Comput. Frank Thomson Leighton, Yuan Ma
1998	J	`jnl`	Greedy Dynamic Routing on Arrays. J. Algorithms Nabil Kahalé, Frank Thomson Leighton
1998	J	`jnl`	Hypercubic Sorting Networks. SIAM J. Comput. Frank Thomson Leighton, C. Greg Plaxton
1998	J	`jnl`	On the Fault Tolerance of Some Popular Bounded-Degree Networks. SIAM J. Comput. Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman
1998	J	`jnl`	Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times. SIAM J. Comput. Edward G. Coffman Jr., Nabil Kahalé, Frank Thomson Leighton
1998	J	`jnl`	Protein Folding in the Hydrophobic-Hydrophilic(HP) Model is NP-Complete. J. Comput. Biol. Bonnie Berger, Frank Thomson Leighton
1998	B	`conf`	Protein folding in the hydrophobic-hydrophilic ( RECOMB Bonnie Berger, Frank Thomson Leighton
1997	J	`jnl`	An Optimal Strategies for Cycle-Stealing in Networks of Workstations. IEEE Trans. Computers Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1997	J	`jnl`	Breaking the Theta (n log² n) Barrier for Sorting with Faults. J. Comput. Syst. Sci. Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton
1997	A*	`conf`	Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. STOC David R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin
1997	J	`jnl`	Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
1997	A*	`conf`	General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate). FOCS Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang
1997	J	`jnl`	On Probabilistic Networks for Selection, Merging, and Sorting. Theory Comput. Syst. Frank Thomson Leighton, Yuan Ma, Torsten Suel
1997	J	`jnl`	On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates. J. Comput. Syst. Sci. Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma
1997	A*	`ed.`	Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997 STOC Frank Thomson Leighton, Peter W. Shor
1997	J	`jnl`	Secure spread spectrum watermarking for multimedia. IEEE Trans. Image Process. Ingemar J. Cox, Joe Kilian, Frank Thomson Leighton, Talal Shamoon
1997	A*	`conf`	The Path Resistance Method for Bounding lambda SODA Stephen Guattery, Frank Thomson Leighton, Gary L. Miller
1997	J	`jnl`	Work-preserving emulations of fixed-connection networks. J. ACM Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe
1996	—	`conf`	A Secure, Robust Watermark for Multimedia. Information Hiding Ingemar J. Cox, Joe Kilian, Frank Thomson Leighton, Talal Shamoon
1996	J	`jnl`	Analysis of Backoff Protocols for Multiple Access Channels. SIAM J. Comput. Johan Håstad, Frank Thomson Leighton, Brian Rogoff
1996	A*	`conf`	Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). STOC Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
1996	—	`conf`	How to Pick a Winner Almost Every Time: Provably-Good Algorithms for Decision Making in the Face of Uncertainty. ISTCS Frank Thomson Leighton
1996	B	`conf`	Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). SPAA Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang
1996	A*	`conf`	Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract). STOC Baruch Awerbuch, Yossi Azar, Amos Fiat, Frank Thomson Leighton
1996	J	`jnl`	Minimal Adaptive Routing on the Mesh with Bounded Queue Size. J. Parallel Distributed Comput. Donald D. Chinn, Frank Thomson Leighton, Martin Tompa
1996	J	`jnl`	On-Line Algorithms for Path Selection in a Nonblocking Network. SIAM J. Comput. Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs
1996	J	`jnl`	Optimal Emulations by Butterfly-Like Networks. J. ACM Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe
1996	A*	`conf`	Reconstructing a Three-Dimensional Model with Arbitrary Errors. STOC Bonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton
1996	J	`jnl`	Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off. J. Parallel Distributed Comput. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1996	A*	`conf`	Universal Stability Results for Greedy Contention-Resolution Protocols. FOCS Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu
1995	J	`jnl`	A 2n-2 Step Algorithm for Routing in an n*n Array with Constant-Size Queues. Algorithmica Frank Thomson Leighton, Fillia Makedon, Ioannis G. Tollis
1995	A*	`conf`	Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract). CRYPTO Joe Kilian, Frank Thomson Leighton
1995	J	`jnl`	Fast Approximation Algorithms for Multicommodity Flow Problems. J. Comput. Syst. Sci. Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas
1995	—	`conf`	Fast algorithms for finding O(congestion+dilation) packet routing schedules. HICSS (2) Frank Thomson Leighton, Bruce M. Maggs
1995	A*	`conf`	Greedy Dynamic Routing on Arrays. SODA Nabil Kahalé, Frank Thomson Leighton
1995	A*	`conf`	Lower bounds for sorting networks. STOC Nabil Kahalé, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi
1995	J	`jnl`	Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing. J. ACM Bonnie Berger, Martin L. Brady, Donna J. Brown, Frank Thomson Leighton
1995	B	`conf`	On Probabilistic Networks for Selection, Merging, and Sorting. SPAA Frank Thomson Leighton, Yuan Ma, Torsten Suel
1995	A*	`ed.`	Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA STOC Frank Thomson Leighton, Allan Borodin
1995	J	`jnl`	Salvage-Embeddings of Complete Trees. SIAM J. Discret. Math. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1995	A*	`conf`	The Statistical Adversary Allows Optimal Money-Making Trading Strategies. SODA Andrew Chou, Jeremy R. Cooperstock, Ran El-Yaniv, Michael Klugerman, Frank Thomson Leighton
1995	A*	`conf`	Tight analyses of two local load balancing algorithms. STOC Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman
1994	J	`jnl`	A 2 SIAM J. Discret. Math. Frank Thomson Leighton
1994	—	`conf`	Building a better butterfly: the multiplexed metabutterfly. ISPAN Frederic T. Chong, Eric A. Brewer, Frank Thomson Leighton, Thomas F. Knight Jr.
1994	J	`jnl`	Methods for Message Routing in Parallel Machines. Theor. Comput. Sci. Frank Thomson Leighton
1994	B	`conf`	Minimal Adaptive Routing on the Mesh with Bounded Queue Size. SPAA Donald D. Chinn, Frank Thomson Leighton, Martin Tompa
1994	A*	`conf`	On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates FOCS Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma
1994	A*	`conf`	On-line Admission Control and Circuit Routing for High Performance Computing and Communication FOCS Baruch Awerbuch, Rainer Gawlick, Frank Thomson Leighton, Yuval Rabani
1994	—	`conf`	Packaging and Multiplexing of Hierarchical Scalable Expanders. PCRCW Frederic T. Chong, Eric A. Brewer, Frank Thomson Leighton, Thomas F. Knight Jr.
1994	J	`jnl`	Packet Routing and Job-Shop Scheduling in Comb. Frank Thomson Leighton, Bruce M. Maggs, Satish Rao
1994	J	`jnl`	Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory. SIAM J. Sci. Comput. Keith Nabors, F. T. Korsmeyer, Frank Thomson Leighton, Jacob K. White
1994	A*	`ed.`	Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada STOC Frank Thomson Leighton, Michael T. Goodrich
1994	J	`jnl`	Randomized Routing and Sorting on Fixed-Connection Networks. J. Algorithms Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao
1994	B	`conf`	Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff. SPAA Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1993	B	`conf`	A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. SPAA Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao
1993	A*	`conf`	A Simple Local-Control Approximation Algorithm for Multicommodity Flow FOCS Baruch Awerbuch, Frank Thomson Leighton
1993	A*	`conf`	Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract) FOCS Frank Thomson Leighton, Yuan Ma
1993	J	`jnl`	Drawing Graphs in the Plane with High Resolution. SIAM J. Comput. Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
1993	B	`conf`	Multicommodity Flows: A Survey of Recent Research. ISAAC Baruch Awerbuch, Frank Thomson Leighton
1993	A*	`conf`	Secret-Key Agreement without Public-Key Cryptography. CRYPTO Frank Thomson Leighton, Silvio Micali
1993	B	`conf`	Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks With Destructive Faults. SPAA Frank Thomson Leighton, Yuan Ma
1992	J	`jnl`	A Tight Lower Bound on the Size of Planar Permutation Networks. SIAM J. Discret. Math. Maria M. Klawe, Frank Thomson Leighton
1992	J	`jnl`	Comparing Queues and Stacks as Mechanisms for Laying out Graphs. SIAM J. Discret. Math. Lenwood S. Heath, Frank Thomson Leighton, Arnold L. Rosenberg
1992	J	`jnl`	Dynamic Tree Embeddings in Butterflies and Hypercubes. SIAM J. Comput. Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe
1992	J	`jnl`	Efficient Embeddings of Trees in Hypercubes. SIAM J. Comput. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1992	J	`jnl`	Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks. IEEE Trans. Computers Frank Thomson Leighton, Bruce M. Maggs
1992	B	`conf`	Improved Algorithms for Routing on Two-Dimensional Grids. WG Dinesh Bhatia, Frank Thomson Leighton, Fillia Makedon, Carolyn Haibt Norton
1992	A*	`conf`	Methods for Message Routing in Parallel Machines STOC Frank Thomson Leighton
1992	A*	`conf`	On the Fault Tolerance of Some Popular Bounded-Degree Networks FOCS Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman
1992	—	`conf`	The Role of Randomness in the Design of Interconnection Networks. IFIP Congress (1) Frank Thomson Leighton, Bruce M. Maggs
1992	—	`conf`	The Role of Randomness in the Design of Interconnection Networks. Heinz Nixdorf Symposium Frank Thomson Leighton, Bruce M. Maggs
1992	—	`conf`	Tolerating Faults in Synchronization Networks. CONPAR Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1991	B	`conf`	Coding Theory, Hypercube Embeddings, and Fault Tolerance. SPAA William Aiello, Frank Thomson Leighton
1991	J	`jnl`	Editors' Introduction. Algorithmica Andrea S. LaPaugh, Frank Thomson Leighton
1991	A*	`conf`	Efficient Algorithms for Dynamic Allocation of Distributed Memory FOCS Frank Thomson Leighton, Eric J. Schwabe
1991	J	`jnl`	Fast Algorithms for Bit-Serial Routing on a Hypercube. Math. Syst. Theory William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman
1991	A*	`conf`	Fast Approximation Algorithms for Multicommodity Flow Problems STOC Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas
1991	A*	`conf`	Highly Fault-Tolerant Sorting Circuits FOCS Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton
1991	J	`jnl`	Letter from the Editor. J. ACM Frank Thomson Leighton
1991	J	`jnl`	Selected Papers from the Symposium on Parallel Algorithms and Architectures. SIGARCH Comput. Archit. News Frank Thomson Leighton
1991	A*	`conf`	Tight Bounds for On-Line Tree Embeddings. SODA Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu
1990	A*	`conf`	A (fairly) Simple Circuit that (usually) Sorts FOCS Frank Thomson Leighton, C. Greg Plaxton
1990	J	`jnl`	A Tight Lower Bound for the Train Reversal Problem. Inf. Process. Lett. Alok Aggarwal, Frank Thomson Leighton
1990	—	`conf`	A Tight Lower Bound on the Size of Planar Permutation Networks. SIGAL International Symposium on Algorithms Maria M. Klawe, Frank Thomson Leighton
1990	A*	`conf`	Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) FOCS Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas
1990	B	`conf`	Average Case Analysis of Greedy Routing algorithms on Arrays. SPAA Frank Thomson Leighton
1990	A*	`conf`	Drawing Graphs in the Plane with High Resolution FOCS Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
1990	—	`conf`	Efficient Reconfiguration of WSI Arrays. ICSI Dinesh Bhatia, Frank Thomson Leighton, Fillia Makedon
1990	B	`conf`	Fast Algorithms for Bit-Serial Routing on a Hypercube. SPAA William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman
1990	A*	`conf`	First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space. SODA Edward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton
1990	J	`jnl`	Generalized Planar Matching. J. Algorithms Francine Berman, David S. Johnson, Frank Thomson Leighton, Peter W. Shor, Larry Snyder
1990	A*	`conf`	On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract) STOC Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs
1990	B	`ed.`	Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '90, Island of Crete, Greece, July 2-6, 1990 SPAA Frank Thomson Leighton
1990	A*	`conf`	Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract) STOC Alok Aggarwal, Mark Hansen, Frank Thomson Leighton
1989	B	`conf`	A 2 SPAA Frank Thomson Leighton, Fillia Makedon, Ioannis G. Tollis
1989	J	`jnl`	A Provably Efficient Algorithm for Dynamic Storage Allocation. J. Comput. Syst. Sci. Edward G. Coffman Jr., Frank Thomson Leighton
1989	J	`jnl`	A Randomized Data Structure for Ordered Sets. Adv. Comput. Res. Jon Louis Bentley, Frank Thomson Leighton, Margaret Lepley, Donald F. Stanat, J. Michael Steele
1989	B	`conf`	Dynamic Tree Embeddings in Butterflies and Hypercubes. SPAA Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe
1989	A*	`conf`	Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies FOCS Frank Thomson Leighton, Bruce M. Maggs
1989	A*	`conf`	Fast Computation Using Faulty Hypercubes (Extended Abstract) STOC Johan Håstad, Frank Thomson Leighton, Mark Newman
1989	A*	`conf`	Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms. DAC Thang Nguyen Bui, C. Heigham, Curt Jones, Frank Thomson Leighton
1989	B	`ed.`	Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, SPAA '89, Santa Fe, New Mexico, USA, June 18-21, 1989 SPAA Frank Thomson Leighton
1989	J	`jnl`	Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM J. Discret. Math. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1989	A*	`conf`	Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) STOC Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg
1988	A*	`conf`	An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms FOCS Frank Thomson Leighton, Satish Rao
1988	—	`conf`	Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures. AWOC Larry Finkelstein, Daniel J. Kleitman, Frank Thomson Leighton
1988	A*	`conf`	Optimal Simulations by Butterfly Networks (Preliminary Version) STOC Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Arnold L. Rosenberg
1988	A*	`conf`	Universal Packet Routing Algorithms (Extended Abstract) FOCS Frank Thomson Leighton, Bruce M. Maggs, Satish Rao
1987	A*	`conf`	Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract) STOC Johan Håstad, Frank Thomson Leighton, Brian Rogoff
1987	J	`jnl`	Global Wire Routing in Two-Dimensional Arrays. Algorithmica Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani
1987	J	`jnl`	Graph bisection algorithms with good average case behavior. Comb. Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser
1987	A*	`conf`	Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract) STOC Johan Håstad, Frank Thomson Leighton, Mark Newman
1986	A*	`conf`	A Provably Efficient Algorithm for Dynamic Storage Allocation STOC Edward G. Coffman Jr., Frank Thomson Leighton
1986	J	`jnl`	Estimating a probability using finite memory. IEEE Trans. Inf. Theory Frank Thomson Leighton, Ronald L. Rivest
1986	A*	`conf`	Optimal Simulations of Tree Machines (Preliminary Version) FOCS Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
1986	J	`jnl`	Three-Dimensional Circuit Layouts. SIAM J. Comput. Frank Thomson Leighton, Arnold L. Rosenberg
1986	A*	`conf`	Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms STOC Frank Thomson Leighton, Peter W. Shor
1985	J	`jnl`	Tight Bounds on the Complexity of Parallel Sorting. IEEE Trans. Computers Frank Thomson Leighton
1985	J	`jnl`	Wafer-Scale Integration of Systolic Arrays. IEEE Trans. Computers Frank Thomson Leighton, Charles E. Leiserson
1984	J	`jnl`	A Framework for Solving VLSI Graph Layout Problems. J. Comput. Syst. Sci. Sandeep N. Bhatt, Frank Thomson Leighton
1984	A*	`conf`	Graph Bisection Algorithms with Good Average Case Behavior FOCS Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser
1984	J	`jnl`	New Lower Bound Techniques for VLSI. Math. Syst. Theory Frank Thomson Leighton
1984	A*	`conf`	Some Unexpected Expected Behavior Results for Bin Packing STOC Jon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch
1984	A*	`conf`	Tight Bounds on the Complexity of Parallel Sorting STOC Frank Thomson Leighton
1983	A*	`conf`	An Approximation Algorithm for Manhattan Routing (Extended Abstract) STOC Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton
1983	J	`jnl`	An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. J. Comput. Syst. Sci. Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller
1983	B	`conf`	Estimating a Probability Using Finite Memory (Extended Abstract). FCT Frank Thomson Leighton, Ronald L. Rivest
1983	A*	`conf`	Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) FOCS Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani
1982	A*	`conf`	A Layout Strategy for VLSI which Is Provably Good (Extended Abstract) STOC Frank Thomson Leighton
1982	J	`jnl`	Finite common coverings of graphs. J. Comb. Theory B Frank Thomson Leighton
1982	A*	`conf`	Wafer-Scale Integration of Systolic Arrays (Extended Abstract) FOCS Frank Thomson Leighton, Charles E. Leiserson
1981	A*	`conf`	New Layouts for the Shuffle-Exchange Graph (Extended Abstract) STOC Daniel J. Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller
1981	A*	`conf`	New Lower Bound Techniques for VLSI FOCS Frank Thomson Leighton