Apr 12, 2022 · This paper presents PaC-trees, a purely-functional data structure supporting functional interfaces for sets, maps, and sequences that provides a significant ...

A PaC-tree is a balanced binary search tree which blocks the leaves and compresses the blocks using arrays. We provide novel techniques for compressing and ...

Importantly it is only designed for graphs, supporting only a small part of the functionality of CPAM. The tree representation in Aspen is also very different.

This paper presents PaC-trees, a purely-functional data structure supporting functional interfaces for sets, maps, and sequences that provides a significant ...

Jun 9, 2022 · This paper presents C-trees, a compressed purely-functional search tree data structure that significantly improves on the space usage and ...

... In this paper, we introduce Bring Your Own (BYO), a unified programming framework for benchmarking and evaluating graph containers. We use BYO to perform a ...

PaC-trees are designed to be efficient in terms of space and time complexity while maintaining the benefits of functional data structures. 2. Proving tree ...

Jul 23, 2024 · [9] PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections Laxman Dhulipala, Guy Blelloch, Yan Gu, and Yihan Sun ; [8] ...

PaC-trees: supporting parallel and compressed purely-functional collections. ... parallel cartesian tree algorithm and its application to parallel suffix tree ...

CPAM (Compressed Parallel Augmented Maps) is a parallel C++ library providing an implementation of the PaC-tree data structure, which is used to provide an ...