F. Thomson Leighton

F. Thomson Leighton's AcademicInfluence.com Rankings

F. Thomson Leighton

Mathematics

#607

World Rank

#1136

Historical Rank

#268

USA Rank

Applied Mathematics

#10

World Rank

#11

Historical Rank

USA Rank

Graph Theory

#48

World Rank

#55

Historical Rank

USA Rank

Measure Theory

#653

World Rank

#893

Historical Rank

#264

USA Rank

mathematics Degrees

Download Badge

Mathematics

Why Is F. Thomson Leighton Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Frank Thomson "Tom" Leighton is the CEO of Akamai Technologies, the company he co-founded with the late Daniel Lewin in 1998. As one of the world's preeminent authorities on algorithms for network applications and cybersecurity, Dr. Leighton discovered a solution to free up web congestion using applied mathematics and distributed computing.

(See a Problem?)

F. Thomson Leighton's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Secure spread spectrum watermarking for multimedia (1997) (5991)
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1991) (3045)
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web (1997) (2170)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (1999) (861)
Secure spread spectrum watermarking for images, audio and video (1996) (600)
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms (1988) (510)
A Secure, Robust Watermark for Multimedia (1996) (506)
Tight Bounds on the Complexity of Parallel Sorting (1984) (506)
Protein Folding in the Hydrophobic-Hydrophilic(HP) Model is NP-Complete (1998) (480)
A Framework for Solving VLSI Graph Layout Problems (1983) (463)
A Graph Coloring Algorithm for Large Scheduling Problems. (1979) (440)
Graph bisection algorithms with good average case behavior (1984) (390)
The value of knowing a demand curve: bounds on regret for online posted-price auctions (2003) (349)
Packet routing and job-shop scheduling inO(congestion+dilation) steps (1994) (306)
New lower bound techniques for VLSI (1981) (297)
Fast approximation algorithms for multicommodity flow problems (1991) (291)
Wafer-scale integration of systolic arrays (1982) (289)
Embedding graphs in books: a layout problem with applications to VLSI design (1985) (262)
Analysis of backoff protocols for multiple access channels (1987) (232)
Resource discovery in distributed networks (1999) (224)
Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory (1994) (192)
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (1994) (188)
Universal-stability results and performance bounds for greedy contention-resolution protocols (2001) (188)
Universal packet routing algorithms (1988) (179)
Universal stability results for greedy contention-resolution protocols (1996) (176)
Improving Performance on the Internet (2008) (172)
Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules (1995) (162)
Optimal simulations of tree machines (1986) (157)
On-line algorithms for path selection in a nonblocking network (1990) (145)
Randomized Routing and Sorting on Fixed-Connection Networks (1994) (143)
A simple local-control approximation algorithm for multicommodity flow (1993) (142)
Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms (1989) (136)
Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits (1988) (130)
Comparing Queues and Stacks as Mechanisms for Laying out Graphs (1992) (130)
Finite common coverings of graphs (1982) (123)
Secret-Key Agreement without Public-Key Cryptography (1993) (119)
Reconfiguring a hypercube in the presence of faults (1987) (116)
Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms (1986) (115)
Fractal Merkle Tree Representation and Traversal (2003) (113)
On-line admission control and circuit routing for high performance computing and communication (1994) (112)
Some Results on Greedy Embeddings in Metric Spaces (2008) (112)
Average case analysis of greedy routing algorithms on arrays (1990) (110)
A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues (1989) (110)
ARRAYS AND TREES (1992) (107)
Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete (1998) (106)
Work-preserving emulations of fixed-connection networks (1989) (105)
Expanders might be practical: fast algorithms for routing around faults on multibutterflies (1989) (104)
Fast computation using faulty hypercubes (1989) (100)
Tight analyses of two local load balancing algorithms (1995) (97)
Global wire routing in two-dimensional arrays (1987) (93)
Drawing graphs in the plane with high resolution (1990) (92)
Three-Dimensional Circuit Layouts (1984) (92)
On the fault tolerance of some popular bounded-degree networks (1992) (90)
Making commitments in the face of uncertainty: how to pick a winner almost every time (extended abstract) (1996) (89)
Methods for message routing in parallel machines (1992) (89)
Efficient Embeddings of Trees in Hypercubes (1992) (84)
Dynamic tree embeddings in butterflies and hypercubes (1989) (84)
Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks (2003) (80)
Basic network creation games (2010) (79)
Hat Guessing Games (2008) (75)
A 2n−2 step algorithm for routing in ann ×n array with constant-size queues (1995) (74)
Planar Embedding of Planar Graphs (1983) (73)
Universal Graphs for Bounded-Degree Trees and Planar Graphs (1989) (72)
An approximation algorithm for manhattan routing (1983) (72)
Some unexpected expected behavior results for bin packing (1984) (71)
Coding theory, hypercube embeddings, and fault tolerance (1991) (69)
Estimating a probability using finite memory (1986) (66)
Asymptotically tight bounds for computing with faulty arrays of processors (1990) (64)
A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer (1993) (62)
New algorithmic aspects of the Local Lemma with applications to routing and partitioning (2002) (61)
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks (1992) (61)
Solving query-retrieval problems by compacting Voronoi diagrams (1990) (60)
Drawing Planar Graphs Using the Canonical Ordering (1996) (60)
Extensions and limits to vertex sparsification (2010) (60)
Optimal simulations by Butterfly Networks (1988) (59)
Fast algorithms for bit-serial routing on a hypercube (1990) (59)
A (fairly) simple circuit that (usually) sorts (1990) (57)
Vertex Sparsifiers and Abstract Rounding Algorithms (2010) (54)
An Optimal Strategies for Cycle-Stealing in Networks of Workstations (1997) (54)
Generalized Planar Matching (1990) (53)
Improving performance on the internet (2008) (51)
Online decision problems with large strategy sets (2005) (49)
Reconstructing a three-dimensional model with arbitrary errors (1996) (45)
Improved lower and upper bounds for universal TSP in planar metrics (2006) (43)
Oblivious routing on node-capacitated and directed graphs (2005) (41)
LAYOUT FOR THE SHUFFLE-EXCHANGE GRAPH AND LOWER BOUND TECHNIQUES FOR VLSI (1982) (41)
Parallel Computation Using Meshes of Trees (1983) (41)
Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) (1983) (40)
Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract) (1995) (40)
A provably efficient algorithm for dynamic storage allocation (1986) (39)
New layouts for the shuffle-exchange graph(Extended Abstract) (1981) (39)
Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults (1993) (38)
Mathematics for Computer Science (2017) (37)
Tight bounds for on-line tree embeddings (1991) (37)
Optimal emulations by butterfly-like networks (1996) (37)
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers (1997) (37)
The statistical adversary allows optimal money-making trading strategies (1995) (36)
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (1989) (36)
A layout strategy for VLSI which is provably good (Extended Abstract) (1982) (35)
General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) (1997) (35)
On the design of reliable Boolean circuits that contain partially unreliable gates (1994) (34)
Guessing secrets (2001) (33)
Multicommodity flow and circuit switching (1998) (32)
Reconstructing a three-dimensional model with arbitrary errors (1999) (31)
Hypercubic Sorting Networks (1998) (29)
Sign patterns of inverse-positive matrices (1979) (28)
Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off (1996) (27)
Oblivious routing in directed graphs with random demands (2005) (27)
Greedy dynamic routing on arrays (1995) (27)
Breaking the Theta (n log² n) Barrier for Sorting with Faults (1997) (24)
Minimal adaptive routing on the mesh with bounded queue size (1994) (24)
Circuit Switching: A Multicommodity Flow Based Approach (1995) (22)
Nearly optimal algorithms and bounds for multilayer channel routing (1995) (22)
On Probabilistic Networks for Selection, Merging, and Sorting (1995) (20)
New lower bounds for oblivious routing in undirected graphs (2006) (19)
Work-preserving emulations of fixed-connection networks (1997) (19)
Fast Computation Using Faulty Hypercubes (Extended Abstract) (1989) (18)
Applying the Classification Theorem for Finite Simple Groups to Minimize Pin Count in Uniform Permutation Architectures (1988) (17)
Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) (1989) (17)
Highly fault-tolerant sorting circuits (1991) (17)
Positive definite matrices and Catalan numbers (1980) (16)
An Asymptotically Optimal Layout for the Shuffle-Exchange Graph (1983) (15)
Universal Packet Routing Algorithms (Extended Abstract) (1988) (15)
On the max-flow min-cut ratio for directed multicommodity flows (2006) (15)
Multicommodity Flows: A Survey of Recent Research (1993) (15)
Online client-server load balancing without global information (2005) (14)
Empirical evaluation of randomly-wire multistage networks (1990) (14)
Containment properties of product and power graphs (2001) (13)
Layouts for the shuffle-exchange graph based on the complex plane diagram (1984) (12)
Correction: Basic Network Creation Games (2014) (12)
Scalable expanders: exploiting hierarchical random wiring (1994) (12)
Queues Served by a Rotating Ring (1995) (11)
The challenges of delivering content on the internet (2001) (11)
Semi-oblivious routing: lower bounds (2007) (11)
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian (1997) (10)
Circulants and the Characterization of Vertex-Transitive Graphs. (1983) (10)
Improved methods for hiding latency in high bandwidth networks (extended abstract) (1996) (10)
Optimal Tile Salvage. (1981) (10)
Syntax-directed Translation of Concurrent Programs into Self-timed Circuits (1988) (10)
Lower bounds for sorting networks (1995) (9)
Efficient embeddings and simulations for hypercubic networks (1991) (9)
Optimal Simulations of Tree Machines (Preliminary Version) (1986) (9)
First-fit allocation of queues: tight probabilistic bounds on wasted space (1990) (8)
Automatic methods for hiding latency in high bandwidth networks (extended abstract) (1996) (8)
Building a better butterfly: the multiplexed metabutterfly (1994) (8)
The Challenges of Delivering Content and Applications on the Internet (2004) (7)
Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times (1996) (7)
Improved Algorithms for Routing on Two-Dimensional Grids (1992) (7)
Parallel Algorithms and Architectures (1987) (7)
Wafer-Scale Integration of Systolic Arrays (1985) (7)
A Tight Lower Bound on the Size of Planar Permutation Networks (1990) (7)
HYPERCUBES AND RELATED NETWORKS (1992) (6)
Master-Key Cryptosystems (1996) (6)
A Faster Compaction Algorithm with Automatic Jog Insertion (1988) (6)
Optimal Simulations by Butterfly Networks (Preliminary Version) (1988) (6)
An (^{1/10.89}) primality testing algorithm (1981) (5)
On Optimal Strategies for Stealing Cycles (1995) (5)
Wafer-Scale Integration of Systolic Arrays (Extended Abstract) (1982) (5)
First-fit storage of linear lists: tight probabilistic bounds on wasted space (1990) (5)
Tables of binomial coefficients and Stirling numbers (1976) (4)
A Randomized Data Structure for Ordered Sets (1989) (4)
The Akamai approach to achieving performance and reliability on the internet (2007) (4)
A 2d-1 Lower Bound for Two-Layer Knock-Knee Channel Routing (1994) (3)
Consistent load balancing via spread minimization (2003) (3)
An efficient linear algebraic algorithm for the determination of isomorphism in pairs of undirected graphs (1976) (3)
On the Decomposition of Vertex-Transitive Graphs into Multicycles. (1983) (3)
Packaging and Multiplexing of Hierarchical Scalable Expanders (1994) (3)
Compression using efficient multicasting (2000) (3)
A Tight Lower Bound for the Train Reversal Problem (1990) (2)
Oblivious deadlock-free routing in a faulty hypercube (1999) (2)
Routing and Job-shop Scheduling in O(congestion (1996) (2)
Tolerating Faults in Synchronization Networks (1992) (2)
The Role of Randomness in the Design of Interconnection Networks (1992) (2)
Salvage-Embeddings of Complete Trees (1995) (2)
Efficient Algorithms for Dynamic Allocation of Distributed Memory (1991) (2)
Estimating a Probability Using Finite Memory (Extended Abstract) (1983) (2)
A Two-Dimensional Visual Tracking Array (1988) (2)
Depth First Search and Dynamic Programming Algorithms for Efficient CMOS Cell Generation (1988) (2)
Automatic Determination of Optimal Clocking Parameters in Synchronous MOS VLSI Circuits (1988) (2)
Verifying a Static RAM Design by Logic Simulation (1988) (2)
Toward a Mathematical Theory of Single-Layer Wire Routing (1988) (2)
Efficient reconfiguration of WSI arrays (1990) (2)
Semi-oblivious routing (2006) (1)
MESHES OF TREES (1992) (1)
Hamming Codes, Hypercube Embeddings, and Fault Tolerance (2007) (1)
TIGHT ANALYSES OF TWO LOCAL LOAD BALANCING (1999) (1)
An Evaluation of Reconfiguration Algorithms in Fault Tolerant Processor Arrays (1988) (1)
Proceedings of the second annual ACM symposium on Parallel algorithms and architectures (1990) (1)
Meshes with Reconfigurable Buses (1988) (1)
The Fluent Abstract Machine (1988) (0)
Invited Talk: From First Silicon to First Sales: The Other Half of the Design Cycle (1988) (0)
The Design and Testing of MIPS-X (1988) (0)
Table 1: Output from Ig-match Algorithm, Com- Pared with Results from the Rcut1.0 Program of Wei and Cheng. 5 Conclusions (1992) (0)
Advanced research in VLSI : proceedings of the Fifth MIT Conference, March 1988 (1988) (0)
Parallel Testing of Parametric Faults in a DRAM (1988) (0)
Scheduling trees using FIFO queues: a control-memory tradeoff (1994) (0)
The Path Resistance Method for Bounding lambda2 of a Laplacian (1997) (0)
Selected Papers from the Symposium on Parallel Algorithms and Architectures (1991) (0)
Dynamic Routing on Arrays References P N K=1 W K . an Easy Calculation Shows That W K = 2 F(k=n) N + O( 1 N 2 ), Where (2007) (0)
Automatic Methods for Hiding Latency in Parallel and Distributed Computation (1999) (0)
Invited Talk: Artificial Neural Networks (1988) (0)
A Dynamically Configurable Architecture For Prototyping Analog Circuits (1988) (0)
Large Algorithmic Methods for Dynamic System Management (2001) (0)
Standard Fm Mbc Rw-st Benchmark Size Areas Net Cut Areas Net Cut (0)
Layout Permutation Problems and Well-Partially-Ordered Sets (1988) (0)
Critical problems in very-large-scale computer systems. Semiannual technical report, 1 October 1989-31 March 1990 (1990) (0)
Global Wiire Routing in Two-Dimensional Arrayst (Extended Abstract) (1983) (0)
Invited Talk: Large Scale Integrated Circuits for Electronic Imaging (1988) (0)
LETTER TO THE EDITOR (2018) (0)
Invited Talk: The Memory Refresh Problem (1988) (0)
Global system hosting servers for documents using widely developed content distribution. (1999) (0)
A Coherent VLSI Environment (1987) (0)
A method to identify a person by means of authority proof (1990) (0)
A Pulse-Width Modulation Design Approach and Path-Programmable Logic for Artificial Neural Networks (1988) (0)
A Survey on LIME: A Generic Data Lineage Framework (2017) (0)
Invited Talk: Structure in Parallel Processor Arrays (1988) (0)
Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract) (1993) (0)
Editors' introduction (1991) (0)
USING WATERMARKING (2017) (0)
Invited Talk: Algorithms for Multi-Level Logic Synthesis (1988) (0)
Localized Client-Server Load Balancing without Global Information (2007) (0)
A Robust Watermarking Scheme for Digital Video Sequence using Entropy and Hadamard Transformation Technique (2016) (0)
Integrating Schematics and Programs for Design Capture (1988) (0)
Embedding Large Tree Machines into Small Ones (1988) (0)
Small-depth Counting Networks and Related Topics Small-depth Counting Networks and Related Topics (1994) (0)
A Global Approach to Circuit Size Reduction Extended Abstract (1988) (0)
Invited Talk: Design Representation and Design Management for Electronic Systems (1988) (0)
Apparatus and method for personal identification. (1989) (0)
How to Pick a Winner Almost Every Time: Provably-Good Algorithms for Decision Making in the Face of Uncertainty (1996) (0)
Homework Assignment 04 Technical Topic 01 : Content Delivery Networks (0)
Invited Talk: The Application of Wafer-Scale Technology to Neuromorphic Systems (1988) (0)
Proceedings of the first annual ACM symposium on Parallel algorithms and architectures (1989) (0)
4 Concluding Remarks Acknowledgements (1994) (0)
An Approximation Algorithm for Manhattan Routing (Extended Abstract) (1983) (0)
Global Wire Routing in Two-Dimensional Arrays 1 (1987) (0)
Critical problems in very-large-scale computer systems. Semiannual technical report, 1 April-30 September 1989 (1988) (0)
Results in computational geometry: geometric embeddings and query-retrieval problems (1991) (0)
A Framework for Solving VLSI (Very Large Scale Integration) Graph Layout Problems. (1983) (0)
So on Substituting into (14), One Can Conclude Lim N!1 (1997) (0)
Stochastic analysis of storage fragmentation (1986) (0)
Optimal Simulations by Butterfly Networks: Extended Abstract, (1987) (0)
Theoretical Aspects of VLSI (Very Large Scale Integration) Circuit Design. (1986) (0)
Global hosting system documents using servers for content distribution widely developed. (1999) (0)

This paper list is powered by the following services:

Other Resources About F. Thomson Leighton

en.wikipedia.org

What Schools Are Affiliated With F. Thomson Leighton?

F. Thomson Leighton is affiliated with the following schools:

F. Thomson Leighton's Academic­Influence.com Rankings

Why Is F. Thomson Leighton Influential?

F. Thomson Leighton's Published Works

Published Works

Other Resources About F. Thomson Leighton

What Schools Are Affiliated With F. Thomson Leighton?

Image Attributions

F. Thomson Leighton's AcademicInfluence.com Rankings