| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Frank Thomson Leighton 134 Frank Thomson Leighton: The Challenges of Delivering Content on the Internet. PODS 2001 133 Fan R. K. Chung , Ronald Graham , Frank Thomson Leighton: Guessing secrets. SODA 2001 : 723-726 132 Frank Thomson Leighton: The Challenges of Delivering Content on the Internet. WADS 2001 : 338 131 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. JACM 48 (1): 39-69 (2001) 130 Micah Adler , Frank Thomson Leighton: Compression Using Efficient Multicasting. JCSS 63 (1): 127-145 (2001) 129 Micah Adler , Frank Thomson Leighton: Compression using efficient multicasting. STOC 2000 : 153-162 128 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) 127 Mor Harchol-Balter , Frank Thomson Leighton, Daniel Lewin : Resource Discovery in Distributed Networks. PODC 1999 : 229-237 126 Frank Thomson Leighton, Satish Rao , Aravind Srinivasan : New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SODA 1999 : 643-652 125 Frank Thomson Leighton, Eric J. Schwabe : Efficient Algorithms for Dynamic Allocation of Distributed Memo. Algorithmica 24 (2): 139-171 (1999) 124 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) 123 Bonnie Berger , Jon M. Kleinberg , Frank Thomson Leighton: Reconstructing a Three-Dimensional Model with Arbitrary Errors. JACM 46 (2): 212-235 (1999) 122 Frank Thomson Leighton, Satish Rao : Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM 46 (6): 787-832 (1999) 121 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) 120 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) 119 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) 118 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) 117 Bonnie Berger , Frank Thomson Leighton: Protein folding in the hydrophobic-hydrophilic ( HP ) is NP-complete. RECOMB 1998 : 30-39 116 Nabil Kahale , Frank Thomson Leighton: Greedy Dynamic Routing on Arrays. J. Algorithms 29 (2): 390-410 (1998) 115 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) 114 Frank Thomson Leighton, C. Greg Plaxton : Hypercubic Sorting Networks. SIAM J. Comput. 27 (1): 1-47 (1998) 113 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) 112 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) 111 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 110 Stephen Guattery , Frank Thomson Leighton, Gary L. Miller : The Path Resistance Method for Bounding lambda 2 of a Laplacian. SODA 1997 : 201-210 109 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 108 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : An Optimal Strategies for Cycle-Stealing in Networks of Workstations. IEEE Transactions on Computers 46 (5): 545-557 (1997) 107 Richard R. Koch , Frank Thomson Leighton, Bruce M. Maggs , Satish B. Rao , Arnold L. Rosenberg , Eric J. Schwabe : Work-preserving emulations of fixed-connection networks. JACM 44 (1): 104-147 (1997) 106 Frank Thomson Leighton, Yuan Ma , C. Greg Plaxton : Breaking the Theta (n log² n) Barrier for Sorting with Faults. JCSS 54 (2): 265-304 (1997) 105 Daniel J. Kleitman , Frank Thomson Leighton, Yuan Ma : On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates. JCSS 55 (3): 385-401 (1997) 104 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) 103 Frank Thomson Leighton, Yuan Ma , Torsten Suel : On Probabilistic Networks for Selection, Merging, and Sorting. Theory of Computing Systems 30 (6): 559-582 (1997) 102 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 101 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 100 Ingemar J. Cox , Joe Kilian , Frank Thomson Leighton, Talal Shamoon : A Secure, Robust Watermark for Multimedia. Information Hiding 1996 : 185-206 99 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 98 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 97 Bonnie Berger , Jon M. Kleinberg , Frank Thomson Leighton: Reconstructing a Three-Dimensional Model with Arbitrary Errors. STOC 1996 : 449-458 96 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 95 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. JACM 43 (2): 293-330 (1996) 94 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off. Journal of Parallel and Distributed Computing 33 (1): 55-68 (1996) 93 Donald D. Chinn , Frank Thomson Leighton, Martin Tompa : Minimal Adaptive Routing on the Mesh with Bounded Queue Size. Journal of Parallel and Distributed Computing 34 (2): 154-170 (1996) 92 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) 91 Johan Håstad , Frank Thomson Leighton, Brian Rogoff : Analysis of Backoff Protocols for Multiple Access Channels. SIAM J. Comput. 25 (4): 740-774 (1996) 90 Joe Kilian , Frank Thomson Leighton: Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract). CRYPTO 1995 : 208-221 89 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 88 Nabil Kahale , Frank Thomson Leighton: Greedy Dynamic Routing on Arrays. SODA 1995 : 558-566 87 Frank Thomson Leighton, Yuan Ma , Torsten Suel : On Probabilistic Networks for Selection, Merging, and Sorting. SPAA 1995 : 106-118 86 Nabil Kahale , Frank Thomson Leighton, Yuan Ma , C. Greg Plaxton , Torsten Suel , Endre Szemerédi : Lower bounds for sorting networks. STOC 1995 : 437-446 85 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 84 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) 83 Bonnie Berger , Martin L. Brady , Donna Brown , Frank Thomson Leighton: Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing. JACM 42 (2): 500-542 (1995) 82 Frank Thomson Leighton, Fillia Makedon , Serge A. Plotkin , Clifford Stein , Éva Stein , Spyros Tragoudas : Fast Approximation Algorithms for Multicommodity Flow Problems. JCSS 50 (2): 228-243 (1995) 81 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Salvage-Embeddings of Complete Trees. SIAM Journal on Discrete Mathematics 8 (4): 617-637 (1995) 80 Daniel J. Kleitman , Frank Thomson Leighton, Yuan Ma : On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates. FOCS 1994 : 332-346 79 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 78 Frederic T. Chong , Eric A. Brewer , Frank Thomson Leighton, Thomas F. Knight Jr. : Packaging and Multiplexing of Hierarchical Scalable Expanders. PCRCW 1994 : 200-214 77 Donald D. Chinn , Frank Thomson Leighton, Martin Tompa : Minimal Adaptive Routing on the Mesh with Bounded Queue Size. SPAA 1994 : 354-363 76 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 75 Eric A. Brewer , Frederic T. Chong , Frank Thomson Leighton: Scalable Expanders: Exploiting Hierarchical Random Wiring. STOC 1994 : 144-152 74 Baruch Awerbuch , Frank Thomson Leighton: Improved Approximation Algorithms for the Multi-Commodity Flow Problem and Local Competitive Routing in Dynamic Networks. STOC 1994 : 487-496 73 Frank Thomson Leighton, Bruce M. Maggs , Satish B. Rao : Packet Routing and Job-Shop Scheduling in O (Congestion + Dilation) Steps. Combinatorica 14 (2): 167-186 (1994) 72 Frank Thomson Leighton, Bruce M. Maggs , Abhiram G. Ranade , Satish B. Rao : Randomized Routing and Sorting on Fixed-Connection Networks. J. Algorithms 17 (1): 157-205 (1994) 71 Frank Thomson Leighton: A 2 d -1 Lower Bound for Two-Layer Knock-Knee Channel Routing. SIAM Journal on Discrete Mathematics 7 (2): 230-237 (1994) 70 Frank Thomson Leighton: Methods for Message Routing in Parallel Machines. TCS 128 (1&2): 31-62 (1994) 69 Frank Thomson Leighton, Silvio Micali : Secret-Key Agreement without Public-Key Cryptography. CRYPTO 1993 : 456-479 68 Baruch Awerbuch , Frank Thomson Leighton: A Simple Local-Control Approximation Algorithm for Multicommodity Flow. FOCS 1993 : 459-468 67 Frank Thomson Leighton, Yuan Ma : Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract). FOCS 1993 : 734-743 66 Baruch Awerbuch , Frank Thomson Leighton: Multicommodity Flows: A Survey of Recent Research. ISAAC 1993 : 297-302 65 Frank Thomson Leighton, Yuan Ma : Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks With Destructive Faults. SPAA 1993 : 30-41 64 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 63 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) 62 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Tolerating Faults in Synchronization Networks. CONPAR 1992 : 1-12 61 Frank Thomson Leighton, Bruce M. Maggs , Ramesh K. Sitaraman : On the Fault Tolerance of Some Popular Bounded-Degree Networks. FOCS 1992 : 542-552 60 Frank Thomson Leighton, Bruce M. Maggs : The Role of Randomness in the Design of Interconnection Networks. IFIP Congress (1) 1992 : 291-305 59 Frank Thomson Leighton: Methods for Message Routing in Parallel Machines. STOC 1992 : 77-96 58 Dinesh Bhatia , Frank Thomson Leighton, Fillia Makedon , Carolyn Haibt Norton : Improved Algorithms for Routing on Two-Dimensional Grids. WG 1992 : 114-122 57 Frank Thomson Leighton, Bruce M. Maggs : Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks. IEEE Transactions on Computers 41 (5): 578-587 (1992) 56 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) 55 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) 54 Lenwood S. Heath , Frank Thomson Leighton, Arnold L. Rosenberg : Comparing Queues and Stacks as Mechanisms for Laying out Graphs. SIAM Journal on Discrete Mathematics 5 (3): 398-412 (1992) 53 Maria M. Klawe , Frank Thomson Leighton: A Tight Lower Bound on the Size of Planar Permutation Networks. SIAM Journal on Discrete Mathematics 5 (4): 558-563 (1992) 52 Frank Thomson Leighton, Yuan Ma , C. Greg Plaxton : Highly Fault-Tolerant Sorting Circuits. FOCS 1991 : 458-469 51 Frank Thomson Leighton, Eric J. Schwabe : Efficient Algorithms for Dynamic Allocation of Distributed Memory. FOCS 1991 : 470-479 50 Sandeep N. Bhatt , David S. Greenberg , Frank Thomson Leighton, Pangfeng Liu : Tight Bounds for On-Line Tree Embeddings. SODA 1991 : 344-350 49 B. Aiello , Frank Thomson Leighton: Coding Theory, Hypercube Embeddings, and Fault Tolerance. SPAA 1991 : 125-136 48 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 47 Andrea S. LaPaugh , Frank Thomson Leighton: Editors' Introduction. Algorithmica 6 (1): 1-3 (1991) 46 Frank Thomson Leighton: Letter from the Editor. JACM 38 (3): 515-515 (1991) 45 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) 44 Frank Thomson Leighton, C. Greg Plaxton : A (fairly) Simple Circuit that (usually) Sorts. FOCS 1990 : 264-274 43 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 42 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 41 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 40 Frank Thomson Leighton: Average Case Analysis of Greedy Routing algorithms on Arrays. SPAA 1990 : 2-10 39 B. Aiello , Frank Thomson Leighton, Bruce M. Maggs , M. Newman : Fast Algorithms for Bit-Serial Routing on a Hypercube. SPAA 1990 : 55-64 38 Sanjeev Arora , Frank Thomson Leighton, Bruce M. Maggs : On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract). STOC 1990 : 149-158 37 Alok Aggarwal , Mark Hansen , Frank Thomson Leighton: Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract). STOC 1990 : 331-340 36 Alok Aggarwal , Frank Thomson Leighton: A Tight Lower Bound for the Train Reversal Problem. Information Processing Letters 35 (6): 301-304 (1990) 35 Francine Berman , David Johnson , Frank Thomson Leighton, Peter W. Shor , Larry Snyder : Generalized Planar Matching. J. Algorithms 11 (2): 153-184 (1990) 34 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 33 Frank Thomson Leighton, Bruce M. Maggs : Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies. FOCS 1989 : 384-389 32 Frank Thomson Leighton, Mark Newman , Abhiram G. Ranade , Eric J. Schwabe : Dynamic Tree Embeddings in Butterflies and Hypercubes. SPAA 1989 : 224-234 31 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 30 Richard 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 29 Johan Håstad , Frank Thomson Leighton, Mark Newman : Fast Computation Using Faulty Hypercubes (Extended Abstract). STOC 1989 : 251-263 28 Edward G. Coffman Jr. , Frank Thomson Leighton: A Provably Efficient Algorithm for Dynamic Storage Allocation. JCSS 38 (1): 2-35 (1989) 27 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Universal Graphs for Bounded-Degree Trees and Planar Graphs. SIAM Journal on Discrete Mathematics 2 (2): 145-155 (1989) 26 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 25 Frank Thomson Leighton, Bruce M. Maggs , Satish Rao : Universal Packet Routing Algorithms (Extended Abstract). FOCS 1988 : 256-269 24 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 23 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 22 Johan Håstad , Frank Thomson Leighton, Brian Rogoff : Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract). STOC 1987 : 241-253 21 Johan Håstad , Frank Thomson Leighton, Mark Newman : Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract). STOC 1987 : 274-284 20 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) 19 Sandeep N. Bhatt , Fan R. K. Chung , Frank Thomson Leighton, Arnold L. Rosenberg : Optimal Simulations of Tree Machines (Preliminary Version). FOCS 1986 : 274-282 18 Edward G. Coffman Jr. , Frank Thomson Leighton: A Provably Efficient Algorithm for Dynamic Storage Allocation. STOC 1986 : 77-90 17 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 16 Frank Thomson Leighton, Arnold L. Rosenberg : Three-Dimensional Circuit Layouts. SIAM J. Comput. 15 (3): 793-813 (1986) 15 Frank Thomson Leighton: Tight Bounds on the Complexity of Parallel Sorting. IEEE Transactions on Computers 34 (4): 344-354 (1985) 14 Frank Thomson Leighton, Charles E. Leiserson : Wafer-Scale Integration of Systolic Arrays. IEEE Transactions on Computers 34 (5): 448-461 (1985) 13 Thang Bui , Soma Chaudhuri , Frank Thomson Leighton, Michael Sipser : Graph Bisection Algorithms with Good Average Case Behavior. FOCS 1984 : 181-192 12 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 11 Frank Thomson Leighton: Tight Bounds on the Complexity of Parallel Sorting. STOC 1984 : 71-80 10 Sandeep N. Bhatt , Frank Thomson Leighton: A Framework for Solving VLSI Graph Layout Problems. JCSS 28 (2): 300-343 (1984) 9 Frank Thomson Leighton: New Lower Bound Techniques for VLSI. Mathematical Systems Theory 17 (1): 47-70 (1984) 8 Frank Thomson Leighton, Ronald L. Rivest : Estimating a Probability Using Finite Memory (Extended Abstract). FCT 1983 : 255-269 7 Richard M. Karp , Frank Thomson Leighton, Ronald L. Rivest , C. D. Thompson , Umesh V. Vazirani , Vijay V. Vazirani : Global Wire Routing in Two-Dimensional Arrays (Extended Abstract). FOCS 1983 : 453-459 6 Brenda S. Baker , Sandeep N. Bhatt , Frank Thomson Leighton: An Approximation Algorithm for Manhattan Routing (Extended Abstract). STOC 1983 : 477-486 5 Daniel J. Kleitman , Frank Thomson Leighton, Margaret Lepley , Gary L. Miller : An Asymptotically Optimal Layout for the Shuffle-Exchange Graph. JCSS 26 (3): 339-361 (1983) 4 Frank Thomson Leighton, Charles E. Leiserson : Wafer-Scale Integration of Systolic Arrays (Extended Abstract). FOCS 1982 : 297-311 3 Frank Thomson Leighton: A Layout Strategy for VLSI which Is Provably Good (Extended Abstract). STOC 1982 : 85-98 2 Frank Thomson Leighton: New Lower Bound Techniques for VLSI. FOCS 1981 : 1-12 1 Daniel J. Kleitman , Frank Thomson Leighton, Margaret Lepley , Gary L. Miller : New Layouts for the Shuffle-Exchange Graph (Extended Abstract). STOC 1981 : 278-292  DiSC'02 © 2003 Association for Computing Machinery |
