T. Leighton

2.7k citations
39 papers · 1.6k · h-index 20

Impact in

Papers in

T. Leighton

36 papers receiving 1.5k citations

Peers

T. Leighton
Comparison fields: 5 of 67
  • Computer Networks and Communications 1.1k
  • Hardware and Architecture 272
  • Computational Theory and Mathematics 516
  • Computer Graphics and Computer-Aided Design 78
  • Management Science and Operations Research 182
Replace Artur Czumaj with:
Artur Czumaj Germany
R.J. Lipton United States
Burkhard Monien Germany
Boaz Patt-Shamir Israel
Sandy Irani United States
Giorgio Ausiello Italy
Micah Adler United States
Friedhelm Meyer auf der Heide Germany
Michael F. Plass United States
Magnús M. Halldórsson Iceland
T. Leighton relative to Artur Czumaj Germany Artur Czumaj's profile →
Citations per field
00.5×1.5×
Artur Czumaj · 1×
Citations per year

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-authors

The 25 scholars most cited alongside T. 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 T. Leighton Line = papers co-authored together T. Leighton links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

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

#Work
1 1988277
2 2004170
3 198898
4 198992
5 198780
6 198978
7 198976
8 200276
9 199575
10 198970
11 199069
12 200265
13 198963
14 198951
15 198743
16 200236
17 199236
18 199030
19 198429
20 198925

About T. Leighton

T. Leighton is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering, Computational Theory and Mathematics, Hardware and Architecture and Artificial Intelligence, having authored 39 papers that have together received 1.6k indexed citations. Recurring topics across this work include Interconnection Networks and Systems (18 papers), Complexity and Algorithms in Graphs (9 papers), Advanced Graph Theory Research (8 papers), VLSI and FPGA Design Techniques (7 papers), Advanced Optical Network Technologies (6 papers), Optimization and Search Problems (6 papers), Distributed systems and fault tolerance (6 papers) and Parallel Computing and Optimization Techniques (3 papers). The work is most often cited by research in Computer Networks and Communications (1.1k citations), Hardware and Architecture (272 citations), Computational Theory and Mathematics (516 citations), Computer Graphics and Computer-Aided Design (78 citations) and Management Science and Operations Research (182 citations). T. Leighton has collaborated with scholars based in United States, Sweden and Singapore. Frequent 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 Curt Jones. Their work appears in journals such as Algorithmica, COMBINATORICA, Journal of Computer and System Sciences, Theory of Computing Systems and Combinatorics Probability Computing.

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