The success of the von Neumann model of sequential computation is attributable to the fact
that it is an efficient bridge between software and hardware: high-level languages can be …

Suffix trees and suffix arrays are widely used and largely interchangeable index structures
on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space …

A suffix array represents the suffixes of a string in sorted order. Being a simpler and more
compact alternative to suffix trees, it is an important tool for full text indexing and other string …

The single source shortest path problem for arbitrary directed graphs with n nodes, m edges
and nonnegative edge weights can sequentially be solved using O (n· log n+ m) operations …

Parallel computation | Guide books skip to main content ACM Digital Library home ACM home
Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …

Proof-of-work is a central concept in modern cryptocurrencies and denial-ofservice
protection tools, but the requirement for fast verification so far has made it an easy prey for …

We have implemented three parallel sorting algorithms on the Connection Machine
Supercomputer model CM-2: B atcher's bitonic sort, a parallel radix sor~ and a sample sort …

Publisher Summary This chapter focuses on general purpose parallel architectures.
Multiprocessor parallel computation has been considered in the context of problems with …

Abstract The Color Set Size problem is: Given a rooted tree of size n with l leaves colored
from 1 to m, m≤ l, for each vertex u find the number of different leaf colors in the subtree …

viii Preface reason for this change is that sequential processors have ceased to get
proportional performance improvements from increased circuit complexity. Although the …