| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Frank Thomson Leighton Frank Thomson Leighton: The Challenges of Delivering Content and Applications on the Internet. RIDE 2004 : 65 Markus Jakobsson , Frank Thomson Leighton, Silvio Micali , Michael Szydlo : Fractal Merkle Tree Representation and Traversal. CT-RSA 2003 : 314-326 Robert Kleinberg , Frank Thomson Leighton: The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions. FOCS 2003 : 594-605 Robert Kleinberg , Frank Thomson Leighton: Consistent load balancing via spread minimization. STOC 2003 : 565-574 Frank Thomson Leighton: JACM 1991-1997. J. ACM 50 (1): 19 (2003) Frank Thomson Leighton: The Challenges of Delivering Content on the Internet. NCA 2001 : 214 Frank Thomson Leighton: The Challenges of Delivering Content on the Internet. PODS 2001 Fan R. K. Chung , Ronald L. Graham , Frank Thomson Leighton: Guessing secrets. SODA 2001 : 723-726 Frank Thomson Leighton: The Challenges of Delivering Content on the Internet. WADS 2001 : 338 Fan Chung , Ronald Graham , Frank Thomson Leighton: Guessing Secrets. Electr. J. Comb. 8 (1): (2001) Matthew Andrews , Baruch Awerbuch , Antonio Fernández , Frank Thomson Leighton, Zhiyong Liu , Jon M. Kleinberg : Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM 48 (1): 39-69 (2001) Micah Adler , Frank Thomson Leighton: Compression Using Efficient Multicasting. J. Comput. Syst. Sci. 63 (1): 127-145 (2001) Frank Thomson Leighton, Chi-Jen Lu , Satish Rao , Aravind Srinivasan : New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SIAM J. Comput. 31 (2): 626-641 (2001) Micah Adler , Frank Thomson Leighton: Compression using efficient multicasting. STOC 2000 : 153-162 Matthew Andrews , Antonio Fernández , Mor Harchol-Balter , Frank Thomson Leighton, Lisa Zhang : General Dynamic Routing with Per-Packet Delay Guarantees of O (Distance + 1/Session Rate). SIAM J. Comput. 30 (5): 1594-1623 (2000) Jin Suk Kim , Eric Lehman , Frank Thomson Leighton: Oblivious Deadlock-Free Routing in a Faulty Hypercube. IPPS/SPDP 1999 : 312-319 Mor Harchol-Balter , Frank Thomson Leighton, Daniel Lewin : Resource Discovery in Distributed Networks. PODC 1999 : 229-237 Frank Thomson Leighton, Satish Rao , Aravind Srinivasan : New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SODA 1999 : 643-652 Frank Thomson Leighton, Eric J. Schwabe : Efficient Algorithms for Dynamic Allocation of Distributed Memo. Algorithmica 24 (2): 139-171 (1999) Frank Thomson Leighton, Bruce M. Maggs , Andréa W. Richa : Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules. Combinatorica 19 (3): 375-401 (1999) Stephen Guattery , Frank Thomson Leighton, Gary L. Miller : The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian Combinatorics, Probability & Computing 8 (5): (1999) Bonnie Berger , Jon M. Kleinberg , Frank Thomson Leighton: Reconstructing a Three-Dimensional Model with Arbitrary Errors. J. ACM 46 (2): 212-235 (1999) Frank Thomson Leighton, Satish Rao : Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46 (6): 787-832 (1999) Frank Thomson Leighton, Yuan Ma : Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults. SIAM J. Comput. 29 (1): 258-273 (1999) Bhaskar Ghosh , Frank Thomson Leighton, Bruce M. Maggs , S. Muthukrishnan , C. Greg Plaxton , Rajmohan Rajaraman , Andréa W. Richa , Robert Endre Tarjan , David Zuckerman : Tight Analyses of Two Local Load Balancing Algorithms. SIAM J. Comput. 29 (1): 29-64 (1999) Sandeep N. Bhatt , David S. Greenberg , Frank Thomson Leighton, Pangfeng Liu : Tight Bounds for On-Line Tree Embeddings. SIAM J. Comput. 29 (2): 474-491 (1999) Matthew Andrews , Frank Thomson Leighton, Panagiotis Takis Metaxas , Lisa Zhang : Automatic Methods for Hiding Latency in Parallel and Distributed Computation. SIAM J. Comput. 29 (2): 615-647 (1999) Bonnie Berger , Frank Thomson Leighton: Protein folding in the hydrophobic-hydrophilic ( HP ) is NP-complete. RECOMB 1998 : 30-39 Nabil Kahale , Frank Thomson Leighton: Greedy Dynamic Routing on Arrays. J. Algorithms 29 (2): 390-410 (1998) Bonnie Berger , Frank Thomson Leighton: Protein Folding in the Hydrophobic-Hydrophilic(HP) Model is NP-Complete. Journal of Computational Biology 5 (1): 27-40 (1998) Frank Thomson Leighton, C. Greg Plaxton : Hypercubic Sorting Networks. SIAM J. Comput. 27 (1): 1-47 (1998) Edward G. Coffman Jr. , Nabil Kahale , Frank Thomson Leighton: Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times. SIAM J. Comput. 27 (5): 1221-1236 (1998) Frank Thomson Leighton, Bruce M. Maggs , Ramesh K. Sitaraman : On the Fault Tolerance of Some Popular Bounded-Degree Networks. SIAM J. Comput. 27 (5): 1303-1333 (1998) Matthew Andrews , Antonio Fernández , Mor Harchol-Balter , Frank Thomson Leighton, Lisa Zhang : General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate). FOCS 1997 : 294-302 Stephen Guattery , Frank Thomson Leighton, Gary L. Miller : The Path Resistance Method for Bounding lambda 2 of a Laplacian. SODA 1997 : 201-210 David R. Karger , Eric Lehman , Frank Thomson Leighton, Rina Panigrahy , Matthew S. Levine , Daniel Lewin : Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. STOC 1997 : 654-663 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : An Optimal Strategies for Cycle-Stealing in Networks of Workstations. IEEE Trans. Computers 46 (5): 545-557 (1997) Richard R. Koch , Frank Thomson Leighton, Bruce M. Maggs , Satish Rao , Arnold L. Rosenberg , Eric J. Schwabe : Work-preserving emulations of fixed-connection networks. J. ACM 44 (1): 104-147 (1997) Frank Thomson Leighton, Yuan Ma , C. Greg Plaxton : Breaking the Theta (n log² n) Barrier for Sorting with Faults. J. Comput. Syst. Sci. 54 (2): 265-304 (1997) Daniel J. Kleitman , Frank Thomson Leighton, Yuan Ma : On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates. J. Comput. Syst. Sci. 55 (3): 385-401 (1997) Leslie Ann Goldberg , Mark Jerrum , Frank Thomson Leighton, Satish Rao : Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers. SIAM J. Comput. 26 (4): 1100-1119 (1997) Frank Thomson Leighton, Yuan Ma , Torsten Suel : On Probabilistic Networks for Selection, Merging, and Sorting. Theory Comput. Syst. 30 (6): 559-582 (1997) Matthew Andrews , Baruch Awerbuch , Antonio Fernández , Jon M. Kleinberg , Frank Thomson Leighton, Zhiyong Liu : Universal Stability Results for Greedy Contention-Resolution Protocols. FOCS 1996 : 380-389 Frank Thomson Leighton: How to Pick a Winner Almost Every Time: Provably-Good Algorithms for Decision Making in the Face of Uncertainty. ISTCS 1996 : 2 Ingemar J. Cox , Joe Kilian , Frank Thomson Leighton, Talal Shamoon : A Secure, Robust Watermark for Multimedia. Information Hiding 1996 : 185-206 Matthew Andrews , Frank Thomson Leighton, Panagiotis Takis Metaxas , Lisa Zhang : Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). SPAA 1996 : 52-61 Matthew Andrews , Frank Thomson Leighton, Panagiotis Takis Metaxas , Lisa Zhang : Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). STOC 1996 : 257-265 Bonnie Berger , Jon M. Kleinberg , Frank Thomson Leighton: Reconstructing a Three-Dimensional Model with Arbitrary Errors. STOC 1996 : 449-458 Baruch Awerbuch , Yossi Azar , Amos Fiat , Frank Thomson Leighton: Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract). STOC 1996 : 519-530 Sandeep N. Bhatt , Fan R. K. Chung , Jia-Wei Hong , Frank Thomson Leighton, Bojana Obrenic , Arnold L. Rosenberg , Eric J. Schwabe : Optimal Emulations by Butterfly-Like Networks. J. ACM 43 (2): 293-330 (1996) Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off. J. Parallel Distrib. Comput. 33 (1): 55-68 (1996) Donald D. Chinn , Frank Thomson Leighton, Martin Tompa : Minimal Adaptive Routing on the Mesh with Bounded Queue Size. J. Parallel Distrib. Comput. 34 (2): 154-170 (1996) Sanjeev Arora , Frank Thomson Leighton, Bruce M. Maggs : On-Line Algorithms for Path Selection in a Nonblocking Network. SIAM J. Comput. 25 (3): 600-625 (1996) Johan Håstad , Frank Thomson Leighton, Brian Rogoff : Analysis of Backoff Protocols for Multiple Access Channels. SIAM J. Comput. 25 (4): 740-774 (1996) Joe Kilian , Frank Thomson Leighton: Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract). CRYPTO 1995 : 208-221 Frank Thomson Leighton, Bruce M. Maggs : Fast algorithms for finding O(congestion+dilation) packet routing schedules. HICSS (2) 1995 : 555-563 Andrew Chou , Jeremy R. Cooperstock , Ran El-Yaniv , Michael Klugerman , Frank Thomson Leighton: The Statistical Adversary Allows Optimal Money-Making Trading Strategies. SODA 1995 : 467-476 Nabil Kahale , Frank Thomson Leighton: Greedy Dynamic Routing on Arrays. SODA 1995 : 558-566 Frank Thomson Leighton, Yuan Ma , Torsten Suel : On Probabilistic Networks for Selection, Merging, and Sorting. SPAA 1995 : 106-118 Nabil Kahale , Frank Thomson Leighton, Yuan Ma , C. Greg Plaxton , Torsten Suel , Endre Szemerédi : Lower bounds for sorting networks. STOC 1995 : 437-446 Bhaskar Ghosh , Frank Thomson Leighton, Bruce M. Maggs , S. Muthukrishnan , C. Greg Plaxton , Rajmohan Rajaraman , Andréa W. Richa , Robert Endre Tarjan , David Zuckerman : Tight analyses of two local load balancing algorithms. STOC 1995 : 548-558 Frank Thomson Leighton, Fillia Makedon , Ioannis G. Tollis : A 2n-2 Step Algorithm for Routing in an n*n Array with Constant-Size Queues. Algorithmica 14 (4): 291-304 (1995) Bonnie Berger , Martin L. Brady , Donna J. Brown , Frank Thomson Leighton: Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing. J. ACM 42 (2): 500-542 (1995) Frank Thomson Leighton, Fillia Makedon , Serge A. Plotkin , Clifford Stein , Éva Stein , Spyros Tragoudas : Fast Approximation Algorithms for Multicommodity Flow Problems. J. Comput. Syst. Sci. 50 (2): 228-243 (1995) Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Salvage-Embeddings of Complete Trees. SIAM J. Discrete Math. 8 (4): 617-637 (1995) Daniel J. Kleitman , Frank Thomson Leighton, Yuan Ma : On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates FOCS 1994 : 332-346 Baruch Awerbuch , Rainer Gawlick , Frank Thomson Leighton, Yuval Rabani : On-line Admission Control and Circuit Routing for High Performance Computing and Communication FOCS 1994 : 412-423 Frederic T. Chong , Eric A. Brewer , Frank Thomson Leighton, Thomas F. Knight Jr. : Packaging and Multiplexing of Hierarchical Scalable Expanders. PCRCW 1994 : 200-214 Donald D. Chinn , Frank Thomson Leighton, Martin Tompa : Minimal Adaptive Routing on the Mesh with Bounded Queue Size. SPAA 1994 : 354-363 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff. SPAA 1994 : 85-93 Eric A. Brewer , Frederic T. Chong , Tom Leighton: Scalable expanders: exploiting hierarchical random wiring. STOC 1994 : 144-152 Baruch Awerbuch , Tom Leighton: Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. STOC 1994 : 487-496 Frank Thomson Leighton, Bruce M. Maggs , Satish Rao : Packet Routing and Job-Shop Scheduling in O (Congestion + Dilation) Steps. Combinatorica 14 (2): 167-186 (1994) Frank Thomson Leighton, Bruce M. Maggs , Abhiram G. Ranade , Satish Rao : Randomized Routing and Sorting on Fixed-Connection Networks. J. Algorithms 17 (1): 157-205 (1994) Frank Thomson Leighton: A 2 d -1 Lower Bound for Two-Layer Knock-Knee Channel Routing. SIAM J. Discrete Math. 7 (2): 230-237 (1994) Frank Thomson Leighton: Methods for Message Routing in Parallel Machines. Theor. Comput. Sci. 128 (1&2): 31-62 (1994) Frank Thomson Leighton, Silvio Micali : Secret-Key Agreement without Public-Key Cryptography. CRYPTO 1993 : 456-479 Baruch Awerbuch , Frank Thomson Leighton: A Simple Local-Control Approximation Algorithm for Multicommodity Flow FOCS 1993 : 459-468 Frank Thomson Leighton, Yuan Ma : Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract) FOCS 1993 : 734-743 Baruch Awerbuch , Frank Thomson Leighton: Multicommodity Flows: A Survey of Recent Research. ISAAC 1993 : 297-302 Frank Thomson Leighton, Yuan Ma : Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks With Destructive Faults. SPAA 1993 : 30-41 Leslie Ann Goldberg , Mark Jerrum , Frank Thomson Leighton, Satish Rao : A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer. SPAA 1993 : 300-309 Michael Formann , Torben Hagerup , James Haralambides , Michael Kaufmann , Frank Thomson Leighton, Antonios Symvonis , Emo Welzl , Gerhard J. Woeginger : Drawing Graphs in the Plane with High Resolution. SIAM J. Comput. 22 (5): 1035-1052 (1993) Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Tolerating Faults in Synchronization Networks. CONPAR 1992 : 1-12 Frank Thomson Leighton, Bruce M. Maggs , Ramesh K. Sitaraman : On the Fault Tolerance of Some Popular Bounded-Degree Networks FOCS 1992 : 542-552 Frank Thomson Leighton, Bruce M. Maggs : The Role of Randomness in the Design of Interconnection Networks. Heinz Nixdorf Symposium 1992 : 131-145 Frank Thomson Leighton, Bruce M. Maggs : The Role of Randomness in the Design of Interconnection Networks. IFIP Congress (1) 1992 : 291-305 Frank Thomson Leighton: Methods for Message Routing in Parallel Machines STOC 1992 : 77-96 Dinesh Bhatia , Frank Thomson Leighton, Fillia Makedon , Carolyn Haibt Norton : Improved Algorithms for Routing on Two-Dimensional Grids. WG 1992 : 114-122 Frank Thomson Leighton, Bruce M. Maggs : Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks. IEEE Trans. Computers 41 (5): 578-587 (1992) Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Efficient Embeddings of Trees in Hypercubes. SIAM J. Comput. 21 (1): 151-162 (1992) Frank Thomson Leighton, Mark Newman , Abhiram G. Ranade , Eric J. Schwabe : Dynamic Tree Embeddings in Butterflies and Hypercubes. SIAM J. Comput. 21 (4): 639-654 (1992) Lenwood S. Heath , Frank Thomson Leighton, Arnold L. Rosenberg : Comparing Queues and Stacks as Mechanisms for Laying out Graphs SIAM J. Discrete Math. 5 (3): 398-412 (1992) Maria M. Klawe , Frank Thomson Leighton: A Tight Lower Bound on the Size of Planar Permutation Networks. SIAM J. Discrete Math. 5 (4): 558-563 (1992) Frank Thomson Leighton, Yuan Ma , C. Greg Plaxton : Highly Fault-Tolerant Sorting Circuits FOCS 1991 : 458-469 Frank Thomson Leighton, Eric J. Schwabe : Efficient Algorithms for Dynamic Allocation of Distributed Memory FOCS 1991 : 470-479 Sandeep N. Bhatt , David S. Greenberg , Frank Thomson Leighton, Pangfeng Liu : Tight Bounds for On-Line Tree Embeddings. SODA 1991 : 344-350 B. Aiello , Frank Thomson Leighton: Coding Theory, Hypercube Embeddings, and Fault Tolerance. SPAA 1991 : 125-136 Frank Thomson Leighton, Fillia Makedon , Serge A. Plotkin , Clifford Stein , Éva Tardos , Spyros Tragoudas : Fast Approximation Algorithms for Multicommodity Flow Problems STOC 1991 : 101-111 Andrea S. LaPaugh , Frank Thomson Leighton: Editors' Introduction. Algorithmica 6 (1): 1-3 (1991) Frank Thomson Leighton: Letter from the Editor. J. ACM 38 (3): 515-515 (1991) William Aiello , Frank Thomson Leighton, Bruce M. Maggs , Mark Newman : Fast Algorithms for Bit-Serial Routing on a Hypercube. Mathematical Systems Theory 24 (4): 253-271 (1991) Frank Thomson Leighton, C. Greg Plaxton : A (fairly) Simple Circuit that (usually) Sorts FOCS 1990 : 264-274 Christos Kaklamanis , Anna R. Karlin , Frank Thomson Leighton, Victor Milenkovic , Prabhakar Raghavan , S. Rao , Clark D. Thomborson , A. Tsantilas : Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) FOCS 1990 : 285-296 Michael Formann , Torben Hagerup , James Haralambides , Michael Kaufmann , Frank Thomson Leighton, Antonios Symvonis , Emo Welzl , Gerhard J. Woeginger : Drawing Graphs in the Plane with High Resolution FOCS 1990 : 86-95 Dinesh Bhatia , Frank Thomson Leighton, Fillia Makedon : Efficient Reconfiguration of WSI Arrays. ICSI 1990 : 47-56 Maria M. Klawe , Frank Thomson Leighton: A Tight Lower Bound on the Size of Planar Permutation Networks. SIGAL International Symposium on Algorithms 1990 : 281-287 Edward G. Coffman Jr. , Leopold Flatto , Frank Thomson Leighton: First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space. SODA 1990 : 272-279 Frank Thomson Leighton: Average Case Analysis of Greedy Routing algorithms on Arrays. SPAA 1990 : 2-10 B. Aiello , Frank Thomson Leighton, Bruce M. Maggs , M. Newman : Fast Algorithms for Bit-Serial Routing on a Hypercube. SPAA 1990 : 55-64 Sanjeev Arora , Frank Thomson Leighton, Bruce M. Maggs : On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract) STOC 1990 : 149-158 Alok Aggarwal , Mark Hansen , Frank Thomson Leighton: Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract) STOC 1990 : 331-340 Alok Aggarwal , Frank Thomson Leighton: A Tight Lower Bound for the Train Reversal Problem. Inf. Process. Lett. 35 (6): 301-304 (1990) Francine Berman , David S. Johnson , Frank Thomson Leighton, Peter W. Shor , Larry Snyder : Generalized Planar Matching. J. Algorithms 11 (2): 153-184 (1990) Thang Bui , C. Heigham , C. Jones , Frank Thomson Leighton: Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms. DAC 1989 : 775-778 Frank Thomson Leighton, Bruce M. Maggs : Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies FOCS 1989 : 384-389 Frank Thomson Leighton, Mark Newman , Abhiram G. Ranade , Eric J. Schwabe : Dynamic Tree Embeddings in Butterflies and Hypercubes. SPAA 1989 : 224-234 Frank Thomson Leighton, Fillia Makedon , Ioannis G. Tollis : A 2 n -2 Step Algorithm for Routing in an nxn Array with Constant Size Queues. SPAA 1989 : 328-335 Richard R. Koch , Frank Thomson Leighton, Bruce M. Maggs , Satish Rao , Arnold L. Rosenberg : Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) STOC 1989 : 227-240 Johan Håstad , Frank Thomson Leighton, Mark Newman : Fast Computation Using Faulty Hypercubes (Extended Abstract) STOC 1989 : 251-263 Tom Leighton, Peter W. Shor : Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms. Combinatorica 9 (2): 161-187 (1989) Edward G. Coffman Jr. , Frank Thomson Leighton: A Provably Efficient Algorithm for Dynamic Storage Allocation. J. Comput. Syst. Sci. 38 (1): 2-35 (1989) Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM J. Discrete Math. 2 (2): 145-155 (1989) Larry Finkelstein , Daniel J. Kleitman , Frank Thomson Leighton: Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures. AWOC 1988 : 247-256 Frank Thomson Leighton, Bruce M. Maggs , Satish Rao : Universal Packet Routing Algorithms (Extended Abstract) FOCS 1988 : 256-269 Frank Thomson Leighton, Satish Rao : An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms FOCS 1988 : 422-431 Sandeep N. Bhatt , Fan R. K. Chung , Jia-Wei Hong , Frank Thomson Leighton, Arnold L. Rosenberg : Optimal Simulations by Butterfly Networks (Preliminary Version) STOC 1988 : 192-204 Johan Håstad , Frank Thomson Leighton, Brian Rogoff : Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract) STOC 1987 : 241-253 Johan Håstad , Frank Thomson Leighton, Mark Newman : Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract) STOC 1987 : 274-284 Richard M. Karp , Frank Thomson Leighton, Ronald L. Rivest , Clark D. Thompson , Umesh V. Vazirani , Vijay V. Vazirani : Global Wire Routing in Two-Dimensional Arrays. Algorithmica 2 : 113-129 (1987) Thang Nguyen Bui , Soma Chaudhuri , Frank Thomson Leighton, Michael Sipser : Graph bisection algorithms with good average case behavior. Combinatorica 7 (2): 171-191 (1987) Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Optimal Simulations of Tree Machines (Preliminary Version) FOCS 1986 : 274-282 Edward G. Coffman Jr. , Frank Thomson Leighton: A Provably Efficient Algorithm for Dynamic Storage Allocation STOC 1986 : 77-90 Frank Thomson Leighton, Peter W. Shor : Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms STOC 1986 : 91-103 Frank Thomson Leighton, Ronald L. Rivest : Estimating a probability using finite memory. IEEE Transactions on Information Theory 32 (6): 733-742 (1986) Frank Thomson Leighton, Arnold L. Rosenberg : Three-Dimensional Circuit Layouts. SIAM J. Comput. 15 (3): 793-813 (1986) Frank Thomson Leighton: Tight Bounds on the Complexity of Parallel Sorting. IEEE Trans. Computers 34 (4): 344-354 (1985) Frank Thomson Leighton, Charles E. Leiserson : Wafer-Scale Integration of Systolic Arrays. IEEE Trans. Computers 34 (5): 448-461 (1985) Thang Bui , Soma Chaudhuri , Frank Thomson Leighton, Michael Sipser : Graph Bisection Algorithms with Good Average Case Behavior FOCS 1984 : 181-192 Jon Louis Bentley , David S. Johnson , Frank Thomson Leighton, Catherine C. McGeoch , Lyle A. McGeoch : Some Unexpected Expected Behavior Results for Bin Packing STOC 1984 : 279-288 Frank Thomson Leighton: Tight Bounds on the Complexity of Parallel Sorting STOC 1984 : 71-80 Sandeep N. Bhatt , Frank Thomson Leighton: A Framework for Solving VLSI Graph Layout Problems. J. Comput. Syst. Sci. 28 (2): 300-343 (1984) Frank Thomson Leighton: New Lower Bound Techniques for VLSI. Mathematical Systems Theory 17 (1): 47-70 (1984) Frank Thomson Leighton, Ronald L. Rivest : Estimating a Probability Using Finite Memory (Extended Abstract). FCT 1983 : 255-269 Richard M. Karp , Frank Thomson Leighton, Ronald L. Rivest , Clark D. Thompson , Umesh V. Vazirani , Vijay V. Vazirani : Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) FOCS 1983 : 453-459 Brenda S. Baker , Sandeep N. Bhatt , Frank Thomson Leighton: An Approximation Algorithm for Manhattan Routing (Extended Abstract) STOC 1983 : 477-486 Daniel J. Kleitman , Frank Thomson Leighton, Margaret Lepley , Gary L. Miller : An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. J. Comput. Syst. Sci. 26 (3): 339-361 (1983) Frank Thomson Leighton, Charles E. Leiserson : Wafer-Scale Integration of Systolic Arrays (Extended Abstract) FOCS 1982 : 297-311 Frank Thomson Leighton: A Layout Strategy for VLSI which Is Provably Good (Extended Abstract) STOC 1982 : 85-98 Frank Thomson Leighton: New Lower Bound Techniques for VLSI FOCS 1981 : 1-12 Daniel J. Kleitman , Frank Thomson Leighton, Margaret Lepley , Gary L. Miller : New Layouts for the Shuffle-Exchange Graph (Extended Abstract) STOC 1981 : 278-292 1 [ 138 ] [ 140 ] 2 [ 39 ] [ 40 ] 3 [ 42 ] [ 54 ] 4 [ 50 ] 5 [ 105 ] [ 106 ] [ 109 ] [ 118 ] [ 125 ] [ 137 ] [ 141 ] 6 [ 41 ] [ 99 ] 7 [ 72 ] [ 74 ] [ 80 ] [ 85 ] [ 103 ] [ 109 ] [ 141 ] 8 [ 103 ] 9 [ 6 ] 10 [ 12 ] 11 [ 89 ] [ 104 ] [ 122 ] [ 124 ] [ 130 ] 12 [ 38 ] 13 [ 46 ] [ 63 ] 14 [ 6 ] [ 10 ] [ 20 ] [ 25 ] [ 29 ] [ 55 ] [ 61 ] [ 68 ] [ 82 ] [ 87 ] [ 101 ] [ 102 ] [ 115 ] [ 126 ] 15 [ 89 ] 16 [ 81 ] [ 84 ] 17 [ 89 ] 18 [ 13 ] [ 37 ] 19 [ 21 ] 20 [ 13 ] [ 21 ] 21 [ 83 ] [ 100 ] 22 [ 81 ] [ 84 ] 23 [ 95 ] 24 [ 142 ] 25 [ 20 ] [ 25 ] [ 29 ] [ 61 ] [ 68 ] [ 82 ] [ 87 ] [ 101 ] [ 102 ] [ 115 ] [ 144 ] 26 [ 19 ] [ 30 ] [ 44 ] [ 120 ] 27 [ 95 ] 28 [ 107 ] 29 [ 95 ] 30 [ 109 ] [ 118 ] [ 137 ] [ 141 ] 31 [ 103 ] 32 [ 28 ] 33 [ 44 ] 34 [ 47 ] [ 69 ] 35 [ 85 ] 36 [ 91 ] [ 127 ] 37 [ 70 ] [ 111 ] 38 [ 142 ] 39 [ 144 ] 40 [ 55 ] [ 126 ] 41 [ 117 ] [ 131 ] 42 [ 47 ] [ 69 ] 43 [ 40 ] 44 [ 47 ] [ 69 ] 45 [ 118 ] [ 135 ] [ 137 ] 46 [ 23 ] [ 24 ] [ 32 ] [ 98 ] 47 [ 59 ] 48 [ 37 ] 49 [ 25 ] [ 102 ] 50 [ 150 ] 51 [ 70 ] [ 111 ] 52 [ 12 ] [ 38 ] 53 [ 37 ] 54 [ 92 ] [ 94 ] [ 120 ] [ 123 ] 55 [ 48 ] 56 [ 116 ] 57 [ 48 ] 58 [ 7 ] [ 22 ] 59 [ 47 ] [ 69 ] 60 [ 97 ] [ 107 ] 61 [ 136 ] 62 [ 45 ] [ 58 ] 63 [ 104 ] [ 109 ] [ 130 ] [ 141 ] 64 [ 148 ] [ 149 ] 65 [ 1 ] [ 5 ] [ 28 ] [ 86 ] [ 112 ] 66 [ 95 ] 67 [ 84 ] 68 [ 33 ] [ 114 ] 69 [ 52 ] 70 [ 116 ] [ 136 ] 71 [ 4 ] [ 14 ] 72 [ 1 ] [ 5 ] 73 [ 116 ] 74 [ 116 ] [ 135 ] 75 [ 55 ] [ 126 ] 76 [ 109 ] [ 141 ] 77 [ 139 ] 78 [ 57 ] [ 71 ] [ 73 ] [ 86 ] [ 92 ] [ 93 ] [ 110 ] [ 112 ] [ 113 ] [ 128 ] 79 [ 27 ] [ 33 ] [ 36 ] [ 41 ] [ 42 ] [ 50 ] [ 62 ] [ 65 ] [ 66 ] [ 67 ] [ 78 ] [ 79 ] [ 91 ] [ 96 ] [ 99 ] [ 114 ] [ 119 ] [ 127 ] [ 132 ] 80 [ 34 ] [ 46 ] [ 53 ] [ 63 ] [ 88 ] [ 90 ] 81 [ 12 ] 82 [ 12 ] 83 [ 105 ] [ 106 ] [ 125 ] 84 [ 75 ] [ 150 ] 85 [ 48 ] 86 [ 1 ] [ 5 ] [ 117 ] [ 131 ] 87 [ 91 ] [ 127 ] 88 [ 42 ] 89 [ 23 ] [ 32 ] [ 35 ] [ 50 ] [ 60 ] 90 [ 63 ] 91 [ 102 ] 92 [ 116 ] 93 [ 49 ] [ 57 ] [ 91 ] [ 92 ] [ 113 ] [ 121 ] [ 127 ] 94 [ 53 ] [ 88 ] 95 [ 85 ] 96 [ 48 ] 97 [ 91 ] [ 127 ] 98 [ 35 ] [ 60 ] [ 78 ] 99 [ 48 ] 100 [ 26 ] [ 27 ] [ 33 ] [ 70 ] [ 78 ] [ 79 ] [ 111 ] [ 114 ] [ 129 ] [ 134 ] [ 139 ] 101 [ 91 ] [ 127 ] [ 132 ] 102 [ 7 ] [ 8 ] [ 17 ] [ 22 ] 103 [ 24 ] [ 98 ] 104 [ 16 ] [ 20 ] [ 25 ] [ 29 ] [ 33 ] [ 59 ] [ 61 ] [ 68 ] [ 82 ] [ 87 ] [ 101 ] [ 102 ] [ 114 ] [ 115 ] 105 [ 35 ] [ 56 ] [ 60 ] [ 102 ] [ 114 ] [ 133 ] 106 [ 107 ] 107 [ 18 ] [ 31 ] [ 38 ] 108 [ 13 ] [ 21 ] 109 [ 67 ] [ 119 ] 110 [ 38 ] 111 [ 134 ] [ 139 ] 112 [ 53 ] [ 88 ] 113 [ 88 ] 114 [ 92 ] [ 93 ] [ 110 ] 115 [ 47 ] [ 69 ] 116 [ 92 ] 117 [ 150 ] 118 [ 53 ] 119 [ 91 ] [ 127 ] 120 [ 48 ] 121 [ 7 ] [ 22 ] 122 [ 34 ] [ 90 ] 123 [ 83 ] [ 100 ] 124 [ 53 ] [ 88 ] 125 [ 48 ] 126 [ 7 ] [ 22 ] 127 [ 7 ] [ 22 ] 128 [ 47 ] [ 69 ] 129 [ 47 ] [ 69 ] 130 [ 105 ] [ 106 ] [ 118 ] [ 125 ] [ 137 ] 131 [ 91 ] [ 127 ]  ©2005 Association for Computing Machinery |
