Tom Leighton
- Computer Networks and Communications top 0.2%
- Interconnection Networks and Systems 24
- Optimization and Search Problems 22
- Distributed systems and fault tolerance 8
- Mobile Ad Hoc Networks 7
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs 25
- Advanced Graph Theory Research 20
- Hardware and Architecture top 2%
-
- Algorithms and Data Compression 10
-
- VLSI and FPGA Design Techniques 7
- Co-authors
- Satish RaoDavid R. KargerMatthew LevineEric LehmanRina PanigrahyBaruch AwerbuchMor Harchol‐BalterAnkur Moitra
- Cited by
- Computer Networks and CommunicationsComputational Theory and MathematicsHardware and Architecture
- Journals
- SIAM Journal on Computing (7 papers)SIAM Journal on Discrete Mathematics (5 papers)Journal of the ACM (5 papers)
- Partner nations
- United StatesIsraelUnited Kingdom
In The Last Decade
Tom Leighton
77 papers receiving 3.4k citations
Hit Papers
Peers
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
Countries citing papers authored by Tom Leighton
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
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-authorship network
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.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 33 | |
| 2 | 2007 | 3 | |
| 3 | 2006 | 8 | |
| 4 | 2006 | 5 | |
| 5 | 2006 | 19 | |
| 6 | 2006 | 4 | |
| 7 | 2006 | 11 | |
| 8 | The Challenges of Delivering Content and Applications on the Internet | 2005 | 2 |
| 9 | 2005 | 12 | |
| 10 | 2005 | 10 | |
| 11 | Consistent hashing and random treesbreakdown → | 1997 | 1235 |
| 12 | 1996 | 3 | |
| 13 | 1995 | 18 | |
| 14 | Secret-key agreement without public-key | 1994 | 15 |
| 15 | 1994 | 2 | |
| 16 | Proceedings of the third annual ACM symposium on Parallel algorithms and architectures | 1991 | 6 |
| 17 | Empirical Evaluation of Randomly-Wired Multistage Networks (Extended Abstract) | 1990 | 6 |
| 18 | Nearly optimal algorithms and bounds for multilayer channel routing | 1989 | 0 |
| 19 | A Survey of Algorithms for Integrating Wafer-Scale Systolic Arrays. | 1986 | 8 |
| 20 | Parallel Computation Using Meshes of Trees. | 1983 | 23 |
About Tom Leighton
Tom Leighton is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, 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), VLSI and FPGA Design Techniques (7 papers) and Mobile Ad Hoc Networks (7 papers). The work is most often cited by research in Computer Networks and Communications (2.9k citations), Computational Theory and Mathematics (893 citations) and Hardware and Architecture (336 citations). Tom Leighton has collaborated with scholars based in United States, Israel and United Kingdom. Frequent co-authors include Satish Rao, David R. Karger, Matthew Levine, Eric Lehman, Rina Panigrahy, 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 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.