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 …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Breadth-first search (BFS) has wide applications in electronic design automation (EDA) as
well as in other fields. Researchers have tried to accelerate BFS on the GPU, but the two …

Graph abstractions are extensively used to understand and solve challenging computational
problems in various scientific and engineering domains. They have particularly gained …

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

Breadth-first search (BFS) is a basic graph exploration technique. We give the first external
memory algorithm for sparse undirected graphs with sublinear I/O. The best previous …

Many modern applications store and process datasets much larger than the main memory of
even state-of-the-art high-end machines. Thus massive and dynamically changing datasets …

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

There is arguably no field in greater need of a comprehensive handbook than computer
engineering. The unparalleled rate of technological advancement, the explosion of …

Algorithms that have to process large data sets have to take into account that the cost of
memory access depends on where the data is stored. Traditional algorithm design is based …