We present algorithms for finding a longest common increasing subsequence of two or more input sequences. For two sequences of lengths n and m, where m ≥ n, we present an algorithm with an… (More)

The multiple selection problem asks for the elements of rank r1, r2, . . . , rk from a linearly ordered set of n elements. Let B denote the information theoretic lower bound on the number of element… (More)

We explain the counterintuitive observation that finding “good” pivots (close to the median of the array to be partitioned) may not improve performance of quicksort. Indeed, an intentionally skewed… (More)

Point samples of a surface in R3 are the dominant output of a multitude of 3D scanning devices. The usefulness of these devices rests on being able to extract properties of the surface from the… (More)