• Publications
  • Influence
Introduction to Algorithms
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Expand
Introduction to Algorithms, Second Edition
The complexity class P is formally defined as the set of concrete decision problems that are polynomial-time solvable, and encodings are used to map abstract problems to concrete problems. Expand
Cilk: An Efficient Multithreaded Runtime System
It is shown that on real and synthetic applications, the “work” and “critical-path length” of a Cilk computation can be used to model performance accurately, and it is proved that for the class of “fully strict” (well-structured) programs, the Cilk scheduler achieves space, time, and communication bounds all within a constant factor of optimal. Expand
The implementation of the Cilk-5 multithreaded language
Cilk-5's novel "two-clone" compilation strategy and its Dijkstra-like mutual-exclusion protocol for implementing the ready deque in the work-stealing scheduler are presented. Expand
Introduction to Algorithms, third edition
Pseudo-code explanation of the algorithms coupled with proof of their accuracy makes this book a great resource on the basic tools used to analyze the performance of algorithms. Expand
Retiming synchronous circuitry
This paper describes a circuit transformation calledretiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuitExpand
Fat-trees: Universal networks for hardware-efficient supercomputing
  • C. Leiserson
  • Computer Science
  • IEEE Transactions on Computers
  • 1 October 1985
The author presents a new class of universal routing networks, called fat-trees, which might be used to interconnect the processors of a general-purpose parallel supercomputer, and proves that a fat-tree of a given size is nearly the best routing network of that size. Expand
Cache-Oblivious Algorithms
It is proved that an optimal cache-oblivious algorithm designed for two levels of memory is also optimal across a multilevel cache hierarchy, and it is shown that the assumption of optimal replacement made by the ideal-cache model can be simulated efficiently by LRU replacement. Expand