The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frank Thomson Leighton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  155. Extensions and limits to vertex sparsification. [Citation Graph (, )][DBLP]


Search in 1.425secs, Finished in 1.430secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002