Frank Thomson Leighton
Affiliations: MIT, Cambridge, US
According to our database^{1},
Frank Thomson Leighton
authored at least 156 papers
between 1981 and 2014.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2018, "For his leadership in the establishment of content delivery networks, and his contributions to algorithm design".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on id.loc.gov
On csauthors.net:
Bibliography
2014
SIAM J. Discret. Math., 2014
2013
SIAM J. Discret. Math., 2013
2010
Discret. Comput. Geom., 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
2009
Commun. ACM, 2009
2008
SIAM J. Discret. Math., 2008
2007
ACM Trans. Algorithms, 2007
SIAM J. Comput., 2007
SIAM J. Comput., 2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Proceedings of the TwentySixth Annual ACM Symposium on Principles of Distributed Computing, 2007
2006
Theor. Comput. Sci., 2006
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006
Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms, 2006
Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms, 2006
2005
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
The Challenges of Delivering Content and Applications on the Internet.
Proceedings of the 2nd Symposium on Networked Systems Design and Implementation (NSDI 2005), 2005
2003
J. ACM, 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
The Value of Knowing a Demand Curve: Bounds on Regret for Online PostedPrice Auctions.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
Proceedings of the Topics in Cryptology, 2003
2001
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
SIAM J. Comput., 2001
J. Comput. Syst. Sci., 2001
Universalstability results and performance bounds for greedy contentionresolution protocols.
J. ACM, 2001
Electron. Notes Discret. Math., 2001
Electron. J. Comb., 2001
Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA 2001), 2001
2000
General Dynamic Routing with PerPacket Delay Guarantees of <i>O</i>(Distance + 1/Session Rate).
SIAM J. Comput., 2000
1999
Tight Bounds on the Size of FaultTolerant Merging and Sorting Networks with Destructive Faults.
SIAM J. Comput., 1999
SIAM J. Comput., 1999
SIAM J. Comput., 1999
SIAM J. Comput., 1999
Multicommodity maxflow mincut theorems and their use in designing approximation algorithms.
J. ACM, 1999
J. ACM, 1999
The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian.
Comb. Probab. Comput., 1999
Comb., 1999
Algorithmica, 1999
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999
1998
SIAM J. Comput., 1998
SIAM J. Comput., 1998
SIAM J. Comput., 1998
J. Comput. Biol., 1998
J. Algorithms, 1998
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998
Proceedings of the ThirtyFirst Annual Hawaii International Conference on System Sciences, 1998
1997
IEEE Trans. Image Process., 1997
IEEE Trans. Computers, 1997
Doubly Logarithmic Communication Algorithms for OpticalCommunication Parallel Computers.
SIAM J. Comput., 1997
Theory Comput. Syst., 1997
J. Comput. Syst. Sci., 1997
On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates.
J. Comput. Syst. Sci., 1997
J. ACM, 1997
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms, 1997
General Dynamic Routing with PerPacket Delay Guarantees of O(distance + 1 / session rate).
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
SIAM J. Comput., 1996
SIAM J. Comput., 1996
J. Parallel Distributed Comput., 1996
J. Parallel Distributed Comput., 1996
J. ACM, 1996
Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).
Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing, 1996
Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).
Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing, 1996
Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996
How to Pick a Winner Almost Every Time: ProvablyGood Algorithms for Decision Making in the Face of Uncertainty.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996
Proceedings of the Information Hiding, First International Workshop, Cambridge, UK, May 30, 1996
Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
1995
SIAM J. Discret. Math., 1995
J. Comput. Syst. Sci., 1995
J. ACM, 1995
Algorithmica, 1995
Proceedings of the TwentySeventh Annual ACM Symposium on Theory of Computing, 1995
Proceedings of the Sixth Annual ACMSIAM Symposium on Discrete Algorithms, 1995
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS28), 1995
Fair Cryptosystems, Revisited: A Rigorous Approach to KeyEscrow (Extended Abstract).
Proceedings of the Advances in Cryptology, 1995
1994
Theor. Comput. Sci., 1994
Preconditioned, Adaptive, MultipoleAccelerated Iterative Methods for ThreeDimensional FirstKind Integral Equations of Potential Theory.
SIAM J. Sci. Comput., 1994
SIAM J. Discret. Math., 1994
J. Algorithms, 1994
Comb., 1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Improved approximation algorithms for the multicommodity flow problem and local competitive routing in dynamic networks.
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994
Proceedings of the Parallel Computer Routing and Communication, 1994
Proceedings of the International Symposium on Parallel Architectures, 1994
Online Admission Control and Circuit Routing for High Performance Computing and Communication
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1993
SIAM J. Comput., 1993
A Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract)
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
Proceedings of the Advances in Cryptology, 1993
1992
Fast Algorithms for Routing Around Faults in Multibutterflies and RandomlyWired Splitter Networks.
IEEE Trans. Computers, 1992
SIAM J. Discret. Math., 1992
SIAM J. Discret. Math., 1992
SIAM J. Comput., 1992
SIAM J. Comput., 1992
Proceedings of the GraphTheoretic Concepts in Computer Science, 1992
The Role of Randomness in the Design of Interconnection Networks.
Proceedings of the Algorithms, Software, Architecture, 1992
Proceedings of the Parallel Processing: CONPAR 92, 1992
1991
SIGARCH Comput. Archit. News, 1991
Math. Syst. Theory, 1991
Letter from the Editor.
J. ACM, 1991
Algorithmica, 1991
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
1990
J. Algorithms, 1990
Inf. Process. Lett., 1990
Online Algorithms for Path Selection in a Nonblocking Network (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Solving QueryRetrieval Problems by Compacting Voronoi Diagrams (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990
Proceedings of the First Annual ACMSIAM Symposium on Discrete Algorithms, 1990
Efficient Reconfiguration of WSI Arrays.
Proceedings of the First International Conference on Systems Integration, 1990
Proceedings of the 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
SIAM J. Discret. Math., 1989
J. Comput. Syst. Sci., 1989
Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms.
Comb., 1989
A Randomized Data Structure for Ordered Sets.
Adv. Comput. Res., 1989
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
A 2<i>n</i>2 Step Algorithm for Routing in an <i>nxn</i> Array with Constant Size Queues.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989
Expanders Might Be Practical: Fast Algorithms for Routing Around Faults on Multibutterflies
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
Improving the Performance of the KernighanLin and Simulated Annealing Graph Bisection Algorithms.
Proceedings of the 26th ACM/IEEE Design Automation Conference, 1989
1988
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
An Approximate MaxFlow MinCut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
Comb., 1987
Algorithmica, 1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
1986
IEEE Trans. Inf. Theory, 1986
SIAM J. Comput., 1986
Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
IEEE Trans. Computers, 1985
IEEE Trans. Computers, 1985
1984
Math. Syst. Theory, 1984
J. Comput. Syst. Sci., 1984
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984
1983
J. Comput. Syst. Sci., 1983
Parallel Computation Using Meshes of Trees.
Proceedings of the WG '83, 1983
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
Proceedings of the Fundamentals of Computation Theory, 1983
1982
J. Comb. Theory, Ser. B, 1982
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982
1981
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981