We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two r...
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show th...
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...