Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT an...
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
In this paper we analyze an algorithm which solves the point projection and the "inversion" problems for parametric curves and surfaces. It consists of a geometric secon...
A treecode algorithm is presented for computing the electrostatic potential and electric field in a system of charged particles. The algorithm is grid-free and with N particles it...