Tom Leighton

7.1k citations
91 papers · 5.1k · 2 hit papers · h-index 28

Impact in

    • Caching and Content Delivery
    • Peer-to-Peer Network Technologies
    • Interconnection Networks and Systems
    • Advanced Data Storage Technologies
    • Optimization and Search Problems
    • Distributed systems and fault tolerance
    • Complexity and Algorithms in Graphs
    • Advanced Graph Theory Research

Papers in

Tom Leighton

88 papers receiving 4.6k citations

Tom Leighton's Hit Papers

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms 1999 · 594 citations
5940+9+19Years since publication4008001.2k

Peers

Tom Leighton
Comparison fields: 5 of 105
  • Computer Networks and Communications 3.6k
  • Computational Theory and Mathematics 1.2k
  • Computer Graphics and Computer-Aided Design 221
  • Hardware and Architecture 402
  • Discrete Mathematics and Combinatorics 99
Replace Shlomo Moran with:
Shlomo Moran Israel
Paul G. Spirakis Greece
Arnold L. Rosenberg United States
Amotz Bar-Noy United States
Allan Borodin Canada
Bruce M. Maggs United States
Baruch Schieber United States
Nikhil Bansal United States
Vijaya Ramachandran United States
Howard Karloff United States
Tom Leighton relative to Shlomo Moran Israel Shlomo Moran's profile →
Citations per field
00.5×1.7×
Shlomo Moran · 1×
Citations per year

Countries citing papers authored by Tom Leighton

Since Specialization
Citations

This map shows the geographic impact of Tom Leighton's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tom Leighton with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tom Leighton more than expected).

Fields of papers citing papers by Tom Leighton

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tom Leighton. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tom Leighton. The network helps show where Tom Leighton may publish in the future.

Co-authors

The 25 scholars most cited alongside Tom Leighton, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Tom Leighton Line = papers co-authored together Tom Leighton links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 91 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Consistent hashing and random trees
Hit paper breakdown →
19971399
2
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Hit paper breakdown →
1999594
3 1996321
4 1985308
5 1991160
6 2001154
7 1999145
8 2009133
9 1986128
10 1996127
11 1994121
12 198495
13 199983
14 200371
15 199864
16 199658
17 199154
18 199250
19 200948
20 200845

About Tom Leighton

Tom Leighton is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering and Hardware and Architecture, having authored 91 papers that have together received 5.1k indexed citations. Recurring topics across this work include Interconnection Networks and Systems (28 papers), Complexity and Algorithms in Graphs (25 papers), Optimization and Search Problems (23 papers), Advanced Graph Theory Research (22 papers), Algorithms and Data Compression (11 papers), VLSI and FPGA Design Techniques (9 papers), Distributed systems and fault tolerance (9 papers) and Mobile Ad Hoc Networks (7 papers). The work is most often cited by research in Computer Networks and Communications (3.6k citations), Computational Theory and Mathematics (1.2k citations), Computer Graphics and Computer-Aided Design (221 citations), Hardware and Architecture (402 citations) and Discrete Mathematics and Combinatorics (99 citations). Tom Leighton has collaborated with scholars based in United States, Israel and Spain. Frequent co-authors include Satish Rao, David R. Karger, Eric Lehman, Rina Panigrahy‎, Matthew Levine, Baruch Awerbuch, Joe Kilian, Ingemar J. Cox, T. Shamoon and Mor Harchol‐Balter. Their work appears in journals such as SIAM Journal on Computing, Journal of the ACM, SIAM Journal on Discrete Mathematics, Journal of Computer and System Sciences and Theoretical Computer Science.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact