Given two strings A[1..n] and B[1..m], and a set of operations allowed t...
Algorithms for approximate nearest-neighbor search (ANNS) have been the ...
Semisort is a fundamental algorithmic primitive widely used in the desig...
Computing strongly connected components (SCC) is a fundamental problems ...
Biconnectivity is one of the most fundamental graph problems. The canoni...
This paper studies parallel algorithms for the longest increasing subseq...
To design efficient parallel algorithms, some recent papers showed that ...
Many modern programming languages are shifting toward a functional style...
Parallelism has become extremely popular over the past decade, and there...
We present a general technique for garbage collecting old versions for
m...
In this paper, we study the single-source shortest-path (SSSP) problem w...
We present a general transformation that takes any concurrent data struc...
In this paper we develop optimal algorithms in the binary-forking model ...
In this paper we show that many sequential randomized incremental algori...
The future of main memory appears to lie in the direction of new non-vol...
In this paper, we design parallel write-efficient geometric algorithms t...
The range, segment and rectangle query problems are fundamental problems...
The range and segment query problems are fundamental problems in
computa...
In this paper we consider single writer multiple reader concurrency - an...