T
Tom Leighton
Researcher at Massachusetts Institute of Technology
Publications - 119
Citations - 10845
Tom Leighton is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Upper and lower bounds & Sorting. The author has an hindex of 48, co-authored 119 publications receiving 10457 citations. Previous affiliations of Tom Leighton include Akamai Technologies & Princeton University.
Papers
More filters
Proceedings ArticleDOI
Optimal simulations of tree machines
TL;DR: This paper investigates simulations of tree machines; the fact that divide-and-conquer algorithms are programmed naturally on trees motivates the investigation, and constructs a universal bounded-degree network on N nodes for which every N node binary tree is a spanning tree.
Journal ArticleDOI
Improving Performance on the Internet: Given the Internet’s bottlenecks, how can we build fast, scalable content-delivery systems?
TL;DR: It is shown that the limiting bottleneck is the middle mile, or the time data spends traveling back and forth across the Internet, between origin server and end user.
Proceedings ArticleDOI
Graph Bisection Algorithins With Good Average Case Behavior
TL;DR: A polynomial time algorithm that finds the minimum bisection for almost all d-regular labelled simple graphs with 2n nodes and bisection width b and chooses the former course with high probability for many natural classes of graphs.
Proceedings ArticleDOI
A simple local-control approximation algorithm for multicommodity flow
Baruch Awerbuch,Tom Leighton +1 more
TL;DR: A very simple (1+/spl epsi/)-approximation algorithm for the multicommodity flow problem that performs as well as or better than previously known algorithms, at least for certain test problems.
Journal ArticleDOI
Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules
TL;DR: This paper shows how to find a schedule O(c+d) steps using constant-size queues, with probability , for any positive constant β, where is the sum of the lengths of the paths taken by the packets in the network.