An I/O-efficient implementation of (Binary) Decision Diagrams
-
Updated
Aug 30, 2024 - C++
An I/O-efficient implementation of (Binary) Decision Diagrams
Contains implementations of cache-optimized and external memory algorithms.
A repo to allow validation of performance results in the knor paper and provide a fast, scalable k-means implementation.
External memory suffix array construction using inducing
Parallel external memory suffix array construction
External memory LZ-End parsing algorithm
Parallel external memory construction of BWT from SA
External memory decoder of LZ77 parsing
Implementation of External Memory Fractal Tree (a variant of the Buffered Repository Tree) in C++ through the STXXL library.
A framework for complex external datastructures and algorithms.
The solution for the problem of list ranking in the external memory.
My materials for course on External Memory Algorithms in YDAS
External Memory (Binary) Decision Diagrams
Add a description, image, and links to the external-memory topic page so that developers can more easily learn about it.
To associate your repository with the external-memory topic, visit your repo's landing page and select "manage topics."