π³ A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
β15Jun 28, 2022Updated 3 years ago
Alternatives and similar repositories for BlockEpsilonTree
Users that are interested in BlockEpsilonTree are comparing it to the libraries listed below
Sorting:
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.β17Nov 10, 2021Updated 4 years ago
- πΆ Compressed bitvector/container supporting efficient random access and rank queriesβ46Sep 4, 2024Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text indexβ68May 31, 2023Updated 2 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.β14Dec 9, 2024Updated last year
- C++ Implementation of Zip Treesβ14Nov 5, 2022Updated 3 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.β14May 11, 2018Updated 7 years ago
- Performance Tests for string_view, C++17β14Jun 18, 2019Updated 6 years ago
- Succinct data structures in C/C++β94Oct 7, 2024Updated last year
- Compact Tree Representationβ16Mar 16, 2017Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequencesβ15Aug 7, 2018Updated 7 years ago
- π A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. (Python wrapper for daachorse)β20Mar 15, 2025Updated 11 months ago
- Space efficient (graph) algorithmsβ18Sep 10, 2020Updated 5 years ago
- Experimental Business Process Model Notation 2 with Goβ23May 8, 2025Updated 9 months ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model