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 …

This paper presents two dynamic search trees attaining near-optimal performance on any
hierarchical memory. The data structures are independent of the parameters of the memory …

A recent direction in the design of cache-efficient and diskefficient algorithms and data
structures is the notion of cache obliviousness, introduced by Frigo, Leiserson, Prokop, and …

We consider the well-known problem of enumerating all triangles of an undirected graph.
Our focus is on determining the input/output (I/O) complexity of this problem. Let E be the …

We analyze the problem of sparse-matrix dense-vector multiplication (SpMV) in the I/O-
model. The task of SpMV is to compute y:= Ax, where A is a sparse N x N matrix and x and y …

This paper presents a simple dictionary structure designed for a hierarchical memory. The
proposed data structure is cache-oblivious and locality-preserving. A cache-oblivious data …

This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by
empirical methods a number of implementation issues and parameter choices for the cache …

We present data-oblivious algorithms in the external-memory model for compaction,
selection, and sorting. Motivation for such problems comes from clients who use outsourced …

We introduce the cache-adaptive model, which generalizes the external-memory model to
apply to environments in which the amount of memory available to an algorithm can …

Maximum independent set (MIS) is a fundamental problem in graph theory and it has
important applications in many areas such as social network analysis, graphical information …