Share This Author
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.
Cilk: an efficient multithreaded runtime system
- R. Blumofe, C. Joerg, Bradley C. Kuszmaul, C. Leiserson, K. H. Randall, Yuli Zhou
- Computer ScienceACM SIGPLAN Symposium on Principles & Practice of…
- 1 August 1995
This paper shows that on real and synthetic applications, the “work” and “critical path” of a Cilk computation can be used to accurately model performance, and proves 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.
The implementation of the Cilk-5 multithreaded language
- Matteo Frigo, C. Leiserson, K. H. Randall
- Computer ScienceACM-SIGPLAN Symposium on Programming Language…
- 1 May 1998
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.
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.
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.
Introduction to Algorithms, 2nd edition.
Scheduling multithreaded computations by work stealing
- R. Blumofe, C. Leiserson
- Computer ScienceProceedings 35th Annual Symposium on Foundations…
- 1 September 1999
This paper gives the first provably good work-stealing scheduler for multithreaded computations with dependencies, and shows that the expected time to execute a fully strict computation on P processors using this scheduler is 1:1.
- Matteo Frigo, C. Leiserson, H. Prokop, S. Ramachandran
- Computer Science40th Annual Symposium on Foundations of Computer…
- 17 October 1999
It is proved that an optimal cache-oblivious algorithm designed for two levels of memory is also optimal for multiple levels and that the assumption of optimal replacement in the ideal-cache model can be simulated efficiently by LRU replacement.
Introduction to Algorithms, 3rd Edition
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 circuit…