In this paper we develop optimal algorithms in the binary-forking model for a variety of
fundamental problems, including sorting, semisorting, list ranking, tree contraction, range …

The randomized incremental convex hull algorithm is one of the most practical and important
geometric algorithms in the literature. Due to its simplicity, and the fact that many points or …

A data-oblivious algorithm is an algorithm whose memory access pattern is independent of
the input values. We initiate the study of parallel data oblivious algorithms on realistic …

Parallelism has become extremely popular over the past decade, and there have been a lot
of new parallel algorithms and software. The randomized work-stealing (RWS) scheduler …

Parallelism is the key to achieving high performance in computing. However, writing efficient
and scalable parallel programs is notoriously difficult, and often requires significant …

Implementing correct and deterministic parallel programs is challenging. Even though
concurrency constructs exist in popular programming languages to facilitate the task of …

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 …

This paper studies a high-speed text-independent Automatic Speaker Recognition (ASR)
algorithm based on a multicore system's Gaussian Mixture Model (GMM). The high speech …

New non-volatile memory (NVM) technologies are projected to become the dominant type of
main memory in the near future. They promise byteaddressability, good read latencies, and …

May-happen-in-parallel analysis is a very important analysis which enables several
optimizations in parallel programs. Most of the work on MHP analysis has used forward flow …