This paper addresses the problem of designing scalable concurrent priority queues for large
scale multiprocessors machines with up to several hundred processors. Priority queues are …

The single-source shortest-path (SSSP) problem is a notoriously hard problem in the
parallel context. In practice, the Δ-stepping algorithm of Meyer and Sanders has been widely …

We describe a new parallel data structure, namely parallel heap, for exclusive-read
exclusive-write parallel random access machines. To our knowledge, it is the first such data …

We present a parallel priority queue that supports the following operations in constant time:
parallel insertionof a sequence of elements ordered according to key, parallel decrease …

In this paper we present a framework for 3D hand tracking and dynamic gesture recognition
using a single camera. Hand tracking is performed in a two step process: we first generate …

We explore two ways of incorporating parallelism into priority queues. The first is to speed
up the execution of individual priority operations so that they can be performed one …

We efficiently map a priority queue on the hypercube architecture in a load balanced
manner, with no additional communication overhead, and present optimal parallel …

Although barrier synchronization has long been considered a useful construct for parallel
programming, it has generally been either layered on top of a communication system or …

An adaptive parallel algorithm for inducing a priority queue structure on an n-element array
is presented. The algorithm is extended to provide optimal parallel construction algorithms …

In this paper we present a new randomized selection algorithm on the Bulk-Synchronous
Parallel (BSP) model of computation, along with an application of this algorithm to dynamic …