T. Leighton

2.7k total citations
39 papers, 1.6k citations indexed

About

T. Leighton is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering and Computational Theory and Mathematics. According to data from OpenAlex, T. Leighton has authored 39 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computer Networks and Communications, 17 papers in Electrical and Electronic Engineering and 16 papers in Computational Theory and Mathematics. Recurrent topics in T. Leighton's work include Interconnection Networks and Systems (18 papers), Complexity and Algorithms in Graphs (9 papers) and Advanced Graph Theory Research (8 papers). T. Leighton is often cited by papers focused on Interconnection Networks and Systems (18 papers), Complexity and Algorithms in Graphs (9 papers) and Advanced Graph Theory Research (8 papers). T. Leighton collaborates with scholars based in United States, Sweden and Singapore. T. Leighton's co-authors include Srinivasa Rao Satti, Bruce M. Maggs, Robert Kleinberg, Johan Håstad, Baruch Awerbuch, Fillia Makedon, Mark Newman, Peter W. Shor, Ioannis G. Tollis and Tan-Trung Bui and has published in prestigious journals such as Journal of Computer and System Sciences, Algorithmica and COMBINATORICA.

In The Last Decade

T. Leighton

36 papers receiving 1.5k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
T. Leighton United States 20 1.1k 537 516 272 182 39 1.6k
Boaz Patt-Shamir Israel 24 1.4k 1.2× 232 0.4× 557 1.1× 214 0.8× 128 0.7× 124 1.7k
Burkhard Monien Germany 25 926 0.8× 287 0.5× 723 1.4× 260 1.0× 276 1.5× 118 1.9k
Artur Czumaj Germany 20 595 0.5× 105 0.2× 511 1.0× 136 0.5× 308 1.7× 121 1.4k
Magnús M. Halldórsson Iceland 25 1.3k 1.1× 521 1.0× 1.0k 2.0× 48 0.2× 235 1.3× 138 2.3k
R.J. Lipton United States 19 562 0.5× 196 0.4× 441 0.9× 244 0.9× 214 1.2× 50 2.5k
Sandy Irani United States 26 1.7k 1.5× 327 0.6× 261 0.5× 510 1.9× 191 1.0× 59 2.5k
F. Bruce Shepherd Canada 22 1.2k 1.0× 320 0.6× 868 1.7× 130 0.5× 103 0.6× 80 1.7k
Mohammad Taghi Hajiaghayi United States 21 895 0.8× 303 0.6× 469 0.9× 18 0.1× 339 1.9× 75 1.4k
Harald Räcke United States 16 904 0.8× 279 0.5× 525 1.0× 67 0.2× 101 0.6× 50 1.3k
Micah Adler United States 28 1.6k 1.5× 253 0.5× 159 0.3× 283 1.0× 53 0.3× 74 2.0k

Countries citing papers authored by T. Leighton

Since Specialization
Citations

This map shows the geographic impact of T. 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 T. Leighton with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites T. Leighton more than expected).

Fields of papers citing papers by T. Leighton

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by T. 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 T. Leighton. The network helps show where T. Leighton may publish in the future.

Co-authorship network of co-authors of T. Leighton

This figure shows the co-authorship network connecting the top 25 collaborators of T. Leighton. A scholar is included among the top collaborators of T. Leighton based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with T. Leighton. T. Leighton is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kleinberg, Robert & T. Leighton. (2004). The value of knowing a demand curve: bounds on regret for online posted-price auctions. 594–605. 170 indexed citations
2.
Andrews, Matthew, et al.. (2002). General dynamic routing with per-packet delay guarantees of O(distance+1/session rate). 294–302. 6 indexed citations
3.
Bhatia, Dinesh, T. Leighton, & Fillia Makedon. (2002). Efficient reconfiguration of WSI arrays. 220. 47–56.
4.
Leighton, T., Fillia Makedon, & Spyros Tragoudas. (2002). Approximation algorithms for VLSI partition problems. 2865–2868. 11 indexed citations
5.
Awerbuch, Baruch, et al.. (2002). On-line admission control and circuit routing for high performance computing and communication. 412–423. 36 indexed citations
6.
Leighton, T., et al.. (2002). On the design of reliable Boolean circuits that contain partially unreliable gates. 332–346. 5 indexed citations
7.
Leighton, T. & Eric J. Schwabe. (2002). Efficient algorithms for dynamic allocation of distributed memory. 470–479. 1 indexed citations
8.
Leighton, T., Yuan Ma, & C. Gregory Plaxton. (2002). Highly fault-tolerant sorting circuits. 32. 458–469. 4 indexed citations
9.
Leighton, T., Fillia Makedon, Serge Plotkin, et al.. (1995). Fast Approximation Algorithms for Multicommodity Flow Problems. Journal of Computer and System Sciences. 50(2). 228–243. 75 indexed citations
10.
Leighton, T.. (1994). Failsafe Key Escrow Systems (Extended Abstract). DSpace@MIT (Massachusetts Institute of Technology). 3 indexed citations
11.
Aggarwal, Alok, et al.. (1990). Solving query-retrieval problems by compacting Voronoi diagrams. 331–340. 30 indexed citations
12.
Arora, Sanjeev, T. Leighton, & Bruce M. Maggs. (1990). On-line algorithms for path selection in a nonblocking network. 149–158. 69 indexed citations
13.
Leighton, T., Mark Newman, Abhiram Ranade, & Eric J. Schwabe. (1989). Dynamic tree embeddings in butterflies and hypercubes. 224–234. 25 indexed citations
14.
Leighton, T., et al.. (1989). Work-preserving emulations of fixed-connection networks. 227–240. 51 indexed citations
15.
Håstad, Johan & T. Leighton. (1989). Fast computation using faulty hypercubes. 251–263. 76 indexed citations
16.
Leighton, T., Bruce M. Maggs, & Srinivasa Rao Satti. (1988). Universal packet routing algorithms. 256–269. 98 indexed citations
17.
Håstad, Johan, T. Leighton, & Mark Newman. (1987). Reconfiguring a hypercube in the presence of faults. 274–284. 80 indexed citations
18.
Håstad, Johan, et al.. (1987). Analysis of backoff protocols for multiple access channels. 241–253. 43 indexed citations
19.
Leighton, T. & Arnold L. Rosenberg. (1984). Three-dimensional circuit layouts. DSpace@MIT (Massachusetts Institute of Technology). 2 indexed citations
20.
Chaudhuri, S.K., et al.. (1984). Graph Bisection Algorithins With Good Average Case Behavior. 181–192. 29 indexed citations

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

Breakdown of academic impact, for papers by Boaz Patt-Shamir Breakdown of academic impact, for papers by Burkhard Monien Breakdown of academic impact, for papers by Artur Czumaj Breakdown of academic impact, for papers by Magnús M. Halldórsson Breakdown of academic impact, for papers by R.J. Lipton Breakdown of academic impact, for papers by Sandy Irani Breakdown of academic impact, for papers by F. Bruce Shepherd Breakdown of academic impact, for papers by Mohammad Taghi Hajiaghayi Breakdown of academic impact, for papers by Harald Räcke Breakdown of academic impact, for papers by Micah Adler
Rankless by CCL
2026