Standout Papers

Introduction to Algorithms 1985 2026 1998 2012 7.5k
  1. Introduction to Algorithms (1991)
    V. J. Rayward‐Smith, Thomas H. Cormen et al. Journal of the Operational Research Society
  2. Fat-trees: Universal networks for hardware-efficient supercomputing (1985)
    Charles E. Leiserson IEEE Transactions on Computers
  3. Retiming synchronous circuitry (1991)
    Charles E. Leiserson, James B. Saxe Algorithmica
  4. Scheduling multithreaded computations by work stealing (1999)
    Robert D. Blumofe, Charles E. Leiserson Journal of the ACM

Immediate Impact

17 by Nobel laureates 44 from Science/Nature 62 standout
Sub-graph 1 of 22

Citing Papers

Discovering faster matrix multiplication algorithms with reinforcement learning
2022 StandoutNatureNobel
Connectomes across development reveal principles of brain maturation
2021 StandoutNature
1 intermediate paper

Works of Charles E. Leiserson being referenced

Cilk: An Efficient Multithreaded Runtime System
1996
Introduction to Algorithms
1991 Standout

Author Peers

Author Last Decade Papers Cites
Charles E. Leiserson 4395 2687 2025 2649 63 10.5k
V. J. Rayward‐Smith 2951 1128 1372 2914 71 9.8k
Alfred V. Aho 3502 3238 1080 6626 69 13.5k
E. Dijkstra 2982 845 1746 2009 53 14.2k
John E. Hopcroft 3065 966 1461 4162 128 12.5k
Thomas H. Cormen 2575 1089 1153 2247 13 7.5k
Richard M. Karp 4630 1200 1227 3194 174 14.2k
Brian W. Kernighan 1794 1147 1318 2001 47 6.7k
George Karypis 2105 981 1408 3455 149 12.7k
Leslie G. Valiant 2284 1039 696 4771 63 9.1k
Jeffrey D. Ullman 5708 2556 648 7565 158 15.1k

All Works

Loading papers...

Rankless by CCL
2026