DenseZDD: a compact and fast index for families of sets

DOI10.3390/a11080128zbMath1458.68045OpenAlexW2887822454MaRDI QIDQ2331660

Hiroki Arimura, Jun Kawahara, Kunihiko Sadakane, Shuhei Denzumi, Koji Tsuda, Shin-ichi Minato

Publication date: 30 October 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a11080128

zbMATH Keywords

succinct data structureset familyzero-suppressed binary decision diagram

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

DenseZDD ⋮ DenseZDD: a compact and fast index for families of sets

Uses Software

• SAPPORO BDD
• Graphillion
• LCM

Cites Work

• Unnamed Item
• Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
• DenseZDD: a compact and fast index for families of sets
• ESP-index: a compressed index based on edit-sensitive parsing
• Fully Functional Static and Dynamic Succinct Trees
• Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets
• Graph-Based Algorithms for Boolean Function Manipulation
• Universal codeword sets and representations of the integers
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Practical Entropy-Compressed Rank/Select Dictionary
• Chain reduction for binary and zero-suppressed decision diagrams

This page was built for publication: DenseZDD: a compact and fast index for families of sets