Semisort is a fundamental algorithmic primitive widely used in the design and analysis of
efficient parallel algorithms. It takes input as an array of records and a function extracting a …

Computing biconnected components (BCC) of a graph is a fundamental graph problem. The
canonical parallel BCC algorithm is the Tarjan-Vishkin algorithm, which has O (n+ m) …

Integer sorting is a fundamental problem in computer science. This paper studies parallel
integer sort both in theory and in practice. In theory, we show tighter bounds for a class of …

Influence Maximization is an important problem in data science. Current solutions with
theoretical guarantees are space-inefficient and have limited parallelism, limiting their …

In this paper, we share our experience in teaching parallel algorithms with the binary-forking
model. With hardware advances, multicore computers are now ubiquitous. This has created …

In this paper, we introduce PASGAL (Parallel And Scalable Graph Algorithm Library), a
parallel graph library that scales to a variety of graph types, many processors, and large …

As multi-core processors become more widely available, parallel computing has entered its
prime era. Despite significant advances in hardware and extensive theoretical research …