Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …

A comprehensive update of the leading algorithms text, with new material on matchings in
bipartite graphs, online algorithms, machine learning, and other topics. Some books on …

Before there were computers, there were algorithms. But now that there are computers, there
are even more algorithms, and algorithms lie at the heart of computing. This book provides a …

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a
modern and active area of computer science. Every computer scientist and every …

A method, apparatus and computer program product for storing data in a disk storage
system is presented. A high-performance dictionary data structure is defined. The dictionary …

This dissertation presents an automated system to generate highly efficient, platform-
adapted implementations of sparse matrix kernels. We show that conventional …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Various applications model problems as streaming graphs, which need to quickly apply a
stream of updates and run algorithms on the updated graph. Furthermore, many dynamic …

This paper proposes and evaluate Prefetching B+-Trees (pB+-Trees), which use prefetching
to accelerate two important operations on B+-Tree indices: searches and range scans. To …

This article presents asymptotically optimal algorithms for rectangular matrix transpose, fast
Fourier transform (FFT), and sorting on computers with multiple levels of caching. Unlike …