Tom Leighton

7.0k citations
81 papers · 3.8k · 1 hit paper · h-index 22

Impact in

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

Papers in

Tom Leighton

77 papers receiving 3.4k citations

Tom Leighton's Hit Papers

Consistent hashing and random trees 1997 · 1.2k citations
1.2k0+9+19Years since publication4008001.2k

Peers

Tom Leighton
Comparison fields: 5 of 94
  • Computer Networks and Communications 2.9k
  • Computational Theory and Mathematics 893
  • Hardware and Architecture 336
  • Computer Graphics and Computer-Aided Design 152
  • Discrete Mathematics and Combinatorics 72
Replace Shlomo Moran with:
Shlomo Moran Israel
Arnold L. Rosenberg United States
Baruch Schieber United States
Allan Borodin Canada
Nikhil Bansal United States
Jan Van Leeuwen Netherlands
Yossi Azar Israel
Bruce M. Maggs United States
Paul G. Spirakis Greece
Baruch Awerbuch United States
Tom Leighton relative to Shlomo Moran Israel Shlomo Moran's profile →
Citations per field
00.5×1.5×2.0×
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 81 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Consistent hashing and random trees
Hit paper breakdown →
19971235
2 1999492
3 1985262
4 1991131
5 1999120
6 2009116
7 2001115
8 1996106
9 199499
10 198699
11 198480
12 199962
13 199650
14 199149
15 199839
16 199238
17 200934
18 200833
19 199932
20 199032

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 81 papers that have together received 3.8k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (25 papers), Interconnection Networks and Systems (24 papers), Optimization and Search Problems (22 papers), Advanced Graph Theory Research (20 papers), Algorithms and Data Compression (10 papers), Distributed systems and fault tolerance (8 papers), Mobile Ad Hoc Networks (7 papers) and VLSI and FPGA Design Techniques (7 papers). The work is most often cited by research in Computer Networks and Communications (2.9k citations), Computational Theory and Mathematics (893 citations), Hardware and Architecture (336 citations), Computer Graphics and Computer-Aided Design (152 citations) and Discrete Mathematics and Combinatorics (72 citations). Tom Leighton has collaborated with scholars based in United States, Israel and Spain. Frequent co-authors include Satish Rao, Rina Panigrahy‎, Eric Lehman, Matthew Levine, David R. Karger, Baruch Awerbuch, Mor Harchol‐Balter, Ankur Moitra, Mohammad Taghi Hajiaghayi and Johan Håstad. Their work appears in journals such as SIAM Journal on Computing, SIAM Journal on Discrete Mathematics, Journal of the ACM, Journal of Computer and System Sciences and Journal of Algorithms.

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