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
Coding theory, hypercube embeddings, and fault tolerance
Bill Aiello,Tom Leighton +1 more
TL;DR: This paper aims to demonstrate the efforts towards in-situ applicability of EMMARM, which aims to provide real-time information about the response of the immune system to natural disasters.
Proceedings ArticleDOI
Some Results on Greedy Embeddings in Metric Spaces
Ankur Moitra,Tom Leighton +1 more
TL;DR: This work resolves a conjecture of Papadimitriou and Ratajczak that every 3-connected planar graph admits a greedy embedding into the Euclidean plane and provides the first non-trivial examples of graphs that admit no such embedding.
Proceedings ArticleDOI
Basic network creation games
TL;DR: This model has no parameter α for the link creation cost, so the results automatically apply for all values of alpha without additional effort; furthermore, equilibrium can be checked in polynomial time in the model, unlike previous models.
Journal ArticleDOI
A 2nź2 step algorithm for routing in ann ×n array with constant-size queues
TL;DR: A deterministic algorithm for solving any 1–1 packet-routing problem on ann ×n mesh in 2n−2 steps using constant-size queues and the time bound is optimal in the worst case.
Journal ArticleDOI
Hat Guessing Games
TL;DR: This paper considers several variants of the hat guessing problem, united by the common theme that the guessing strategies are required to be deterministic and the objective is to maximize the number of correct answers in the worst case.