Two trends have emerged of late in scientific computing. The first one is the adoption of high
level interactive programming environments such as MATLAB, R and Python. This is largely …

Traditionally, the field of scientific computing has been dominated by numerical methods.
However, modern scientific codes often combine numerical methods with combinatorial …

Existing algorithms for creating communicators in MPI programs will not scale well to future
exascale supercomputers containing millions of cores. In this work, we present a novel …

DASH is a new programming approach offering distributed data structures and parallel
algorithms in the form of a C++ template library. This article describes recent developments …

An important aspect of precision medicine consists in patient-centered contextualization
analyses that are used as part of biomedical interactive tools. Such analyses often harness …

Sorting is one of the most critical non-numerical algorithms and covers use cases in a wide
spectrum of scientific applications. Although we can build upon excellent research over the …

We introduce asymptotically optimal algorithms for gathering and scattering a small-to-
moderate sized set of data on a coarse grained parallel computer. We use these operations …

Bulk-synchronous parallelism (BSP) is a simple and efficient paradigm for parallel algorithm
design and analysis. In this paper, we present a new simple deterministic BSP algorithm for …

Given a sequence A of real numbers, we wish to find a list of all non-overlapping contiguous
subsequences of A that are maximal. A maximal subsequence M of A has the property that …

Given a sequence (A) of real numbers, we wish to find a list of all nonoverlapping
contiguous subsequences of (A) that are maximal. A maximal subsequence (M) of (A) has …