Tree data structures, such as red-black trees, quad trees, treaps, or tries, are fundamental
tools in computer science. A classical problem in concurrency is to obtain expressive …

Concurrent B+ trees have been widely used in many systems. With the scale of data
requests increasing exponentially, the systems are facing tremendous performance …

Maintaining a dynamic k-core decomposition is an important problem that identifies dense
subgraphs in dynamically changing graphs. Recent work by Liu et al.[SPAA 2022] presents …

To use the computational power of modern computing machines, we have to deal with
concurrent programs. Writing efficient concurrent programs is notoriously difficult, primarily …

Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide
range of applications to social and communication networks and used as a building block in …

In this paper we present two versions of a parallel finger structure FS on p processors that
supports searches, insertions and deletions, and has a finger at each end. This is to our …

In this thesis we study the problem of designing and analyzing multithreaded parallel data
structures. We wish to have parallel data structures designed for asynchronous multi …