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 …

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 …

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 …

Sorting is an important problem that forms an essential component of many high-
performance applications. Here, we explore the design space of sorting algorithms in recon …

The weak heap is a priority queue that was introduced as a competitive structure for sorting.
Its array-based form supports the operations find-min in O (1) worst-case time, and insert …

Quicksort was first introduced in 1961 by Hoare. Many variants have been developed, the
best of which are among the fastest generic-sorting algorithms available, as testified by the …

Branch mispredictions is an important factor affecting the running time in practice. In this
paper we consider tradeoffs between the number of branch mispredictions and the number …

Data-structure dynamization is a general approach for making static data structures
dynamic. It is used extensively in geometric settings and in the guise of so-called merge (or …

The cost of accessing shared objects that are stored in remote memory, while neglecting
accesses to shared objects that are cached in the local memory, can be evaluated by the …