Charles E. Leiserson

39.8k citations
142 papers · 25.1k indexed · 13 hit papers · h-index 46

Impact in

    • Parallel Computing and Optimization Techniques
    • Embedded Systems Design Techniques
    • Interconnection Networks and Systems
    • Distributed and Parallel Computing Systems
    • Advanced Data Storage Technologies
    • Distributed systems and fault tolerance

Papers in

    • Parallel Computing and Optimization Techniques 71
    • Embedded Systems Design Techniques 13
    • Interconnection Networks and Systems 42
    • Distributed and Parallel Computing Systems 29
    • Optimization and Search Problems 20
    • Advanced Data Storage Technologies 19
    • Distributed systems and fault tolerance 19

Charles E. Leiserson

135 papers receiving 22.7k citations

Hit Papers

There’s plenty of room at the Top: What will drive computer performance after Moore’s law? 2020 · 232 citations
23219782026199420102.5k5.0k7.5k10.0k

Peers

Charles E. Leiserson
Comparison fields: 5 of 197
  • Hardware and Architecture 9.4k
  • Computer Networks and Communications 13.0k
  • Computer Graphics and Computer-Aided Design 938
  • Computational Theory and Mathematics 3.9k
  • Software 733
Replace Richard M. Karp with:
Richard M. Karp United States
Thomas H. Cormen United States
Donald E. Knuth United States
David S. Johnson United States
Ronald L. Rivest United States
M. R. Garey United States
Alfred V. Aho United States
V. J. Rayward‐Smith United Kingdom
Jeffrey D. Ullman United States
Robert E. Tarjan United States
Charles E. Leiserson relative to Richard M. Karp United States Richard M. Karp's profile →
Citations per field
00.5×2.9×
Richard M. Karp · 1×
Citations per year

Countries citing papers authored by Charles E. Leiserson

Since Specialization
Citations

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

Fields of papers citing papers by Charles E. Leiserson

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network

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

All Works

20 of 20 papers shown
#Work
1
There’s plenty of room at the Top: What will drive computer performance after Moore’s law?
Hit paper breakdown →
2020232
2 20175
3 20168
4
A simple deterministic algorithm for guaranteeing the forward progress of transactions
20150
5
Efficient Evaluation of Large Polynomials
20101
6
Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
19945
7
The network architecture of the connection machine CM-5 (extended abstract)
19942
8
The organization of permutation architectures with bused interconnections
19945
9
A TIMING ANALYSIS OF LEVEL-CLOCKED CIRCUITRY
199020
10
VLSI theory and parallel supercomputing
198915
11
Orderings for Parallel Sparse Symmetric Factorization
198723
12
Communication-Efficient Parallel Graph Algorithms.
19868
13
A Survey of Algorithms for Integrating Wafer-Scale Systolic Arrays.
19868
14
Retiming synchronous circuitry
19868
15
Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing.
198534
16
How to assemble tree machines
198440
17 198237
18 19821
19
Area-Efficient Graph Layouts (for VLSI).
1980161
20
Systolic Priority Queues
197956

About Charles E. Leiserson

Charles E. Leiserson is a scholar working on Hardware and Architecture, Computer Networks and Communications, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Artificial Intelligence, having authored 142 papers that have together received 25.1k indexed citations. Recurring topics across this work include Parallel Computing and Optimization Techniques (71 papers), Interconnection Networks and Systems (42 papers), Distributed and Parallel Computing Systems (29 papers), VLSI and FPGA Design Techniques (24 papers), Optimization and Search Problems (20 papers), Advanced Data Storage Technologies (19 papers), Distributed systems and fault tolerance (19 papers) and Embedded Systems Design Techniques (13 papers). The work is most often cited by research in Hardware and Architecture (9.4k citations), Computer Networks and Communications (13.0k citations), Computer Graphics and Computer-Aided Design (938 citations), Computational Theory and Mathematics (3.9k citations) and Software (733 citations). Charles E. Leiserson has collaborated with scholars based in United States, Singapore and Canada. Frequent co-authors include Ronald L. Rivest, Thomas H. Cormen, V. J. Rayward‐Smith, Robert D. Blumofe, Clifford Stein, Keith H. Randall, James B. Saxe, Matteo Frigo, Bradley C. Kuszmaul and H. T. Kung. Their work appears in journals such as ACM SIGPLAN Notices, Journal of Parallel and Distributed Computing, Journal of the ACM, Algorithmica and SIAM Journal on 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

Rankless by CCL
2026