Tom Leighton

7.1k citations
129 papers · 7.8k · 2 hit papers · h-index 42

Impact in

Papers in

Tom Leighton

125 papers receiving 7.2k citations

Tom Leighton's Hit Papers

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

Peers

Tom Leighton
Comparison fields: 5 of 60
  • Computer Networks and Communications 2.5k
  • Computational Theory and Mathematics 1.2k
  • Hardware and Architecture 243
  • Computer Vision and Pattern Recognition 583
  • Computer Graphics and Computer-Aided Design 79
Replace Clifford Stein with:
Clifford Stein United States
Haim Y. Kaplan Israel
Nikhil Bansal United States
Ashish Goel United States
Frank Thomson Leighton United States
Chandra Chekuri United States
Bruce MacDowell Maggs United States
Gerhard J. Woeginger Netherlands
Edith Cohen United States
Sanjeev Khanna United States
Tom Leighton relative to Clifford Stein United States Clifford Stein's profile →
Citations per field
00.5×1.5×2.0×
Clifford Stein · 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 129 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Consistent hashing and random trees
Hit paper breakdown →
19971400
2
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Hit paper breakdown →
1999639
3 1988342
4 1998328
5 1996318
6 2002317
7 1985308
8 2004175
9 1991159
10 1999155
11 2001153
12 2009141
13 1986131
14 1996130
15 1994129
16 1988121
17 1989100
18 1989100
19 198495
20 198793

About Tom Leighton

Tom Leighton is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Artificial Intelligence, Hardware and Architecture and Computer Vision and Pattern Recognition, having authored 129 papers that have together received 7.8k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (30 papers), Interconnection Networks and Systems (30 papers), VLSI and FPGA Design Techniques (5 papers), Cryptography and Data Security (5 papers), Optimization and Search Problems (4 papers), Caching and Content Delivery (4 papers), Network Traffic and Congestion Control (3 papers) and Advanced Steganography and Watermarking Techniques (3 papers). The work is most often cited by research in Computer Networks and Communications (2.5k citations), Computational Theory and Mathematics (1.2k citations), Hardware and Architecture (243 citations), Computer Vision and Pattern Recognition (583 citations) and Computer Graphics and Computer-Aided Design (79 citations). Tom Leighton has collaborated with scholars based in United States, Japan and Israel. Frequent co-authors include Satish B. Rao, Eric Lehman, Rina Panigrahy‎, David R. Karger, Bonnie Berger, Baruch Awerbuch, Joe Kilian, Bruce MacDowell Maggs, Talal G. Shamoon and Ingemar Johansson Cox. Their work appears in journals such as SIAM Journal on Computing, Journal of the ACM, Journal of Computer and System Sciences, SIAM Journal on Discrete Mathematics 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