Charles E. Leiserson
Impact in
- Hardware and Architecture top 0.01%
- Parallel Computing and Optimization Techniques
- Embedded Systems Design Techniques
- Computer Networks and Communications top 0.02%
- Interconnection Networks and Systems
- Distributed and Parallel Computing Systems
- Advanced Data Storage Technologies
- Distributed systems and fault tolerance
Papers in
-
- Interconnection Networks and Systems 41
- Distributed and Parallel Computing Systems 29
- Optimization and Search Problems 20
- Distributed systems and fault tolerance 19
- Advanced Data Storage Technologies 19
-
- Parallel Computing and Optimization Techniques 71
- Embedded Systems Design Techniques 12
- Co-authors
- Ronald L. Rivest (10 shared papers)Thomas H. Cormen (8 shared papers)V. J. Rayward‐Smith (1 shared paper)Robert D. Blumofe (9 shared papers)Clifford Stein (5 shared papers)Keith H. Randall (10 shared papers)Matteo Frigo (8 shared papers)James B. Saxe (4 shared papers)
- Journals
- ACM SIGPLAN Notices (7 papers)Journal of Parallel and Distributed Computing (3 papers)Journal of the ACM (3 papers)Theory of Computing Systems (2 papers)Algorithmica (2 papers)
- Partner nations
- United StatesSingaporeCanada
In The Last Decade
Charles E. Leiserson
135 papers receiving 23.4k citations
Charles E. Leiserson's Hit Papers
Peers
Comparison fields: 5 of 196
- Hardware and Architecture 9.4k
- Computer Networks and Communications 13.1k
- Computer Graphics and Computer-Aided Design 937
- Computational Theory and Mathematics 4.0k
- Artificial Intelligence 6.3k
Countries citing papers authored by Charles E. Leiserson
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
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-authors
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.
All Works
Showing the 20 most-cited of 141 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Introduction to Algorithms Hit paper breakdown → | 1991 | 11618 |
| 2 | Introduction to Algorithms, third edition Hit paper breakdown → | 2009 | 1443 |
| 3 | Introduction to Algorithms, Second Edition Hit paper breakdown → | 2001 | 1198 |
| 4 | Fat-trees: Universal networks for hardware-efficient supercomputing Hit paper breakdown → | 1985 | 903 |
| 5 | The implementation of the Cilk-5 multithreaded language Hit paper breakdown → | 1998 | 787 |
| 6 | Scheduling multithreaded computations by work stealing Hit paper breakdown → | 1999 | 773 |
| 7 | Retiming synchronous circuitry Hit paper breakdown → | 1991 | 730 |
| 8 | Cilk Hit paper breakdown → | 1995 | 694 |
| 9 | EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs Hit paper breakdown → | 2020 | 626 |
| 10 | Systolic Arrays for (VLSI). Hit paper breakdown → | 1978 | 506 |
| 11 | Cilk: An Efficient Multithreaded Runtime System Hit paper breakdown → | 1996 | 489 |
| 12 | Cache-oblivious algorithms Hit paper breakdown → | 2003 | 426 |
| 13 | 1981 | 317 | |
| 14 | 2005 | 311 | |
| 15 | Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks Hit paper breakdown → | 2009 | 271 |
| 16 | There’s plenty of room at the Top: What will drive computer performance after Moore’s law? Hit paper breakdown → | 2020 | 253 |
| 17 | 1996 | 239 | |
| 18 | 2011 | 215 | |
| 19 | 2002 | 215 | |
| 20 | 1992 | 201 |
About Charles E. Leiserson
Charles E. Leiserson is a scholar working on Computer Networks and Communications, Hardware and Architecture, Electrical and Electronic Engineering, Computational Theory and Mathematics and Artificial Intelligence, having authored 141 papers that have together received 25.7k indexed citations. Recurring topics across this work include Parallel Computing and Optimization Techniques (71 papers), Interconnection Networks and Systems (41 papers), Distributed and Parallel Computing Systems (29 papers), VLSI and FPGA Design Techniques (23 papers), Optimization and Search Problems (20 papers), Distributed systems and fault tolerance (19 papers), Advanced Data Storage Technologies (19 papers) and Embedded Systems Design Techniques (12 papers). The work is most often cited by research in Hardware and Architecture (9.4k citations), Computer Networks and Communications (13.1k citations), Computer Graphics and Computer-Aided Design (937 citations), Computational Theory and Mathematics (4.0k citations) and Artificial Intelligence (6.3k 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, Matteo Frigo, James B. Saxe, 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, Theory of Computing Systems and Algorithmica.
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.