thm-mni-ii / seaLinks
Space efficient (graph) algorithms
☆18Updated 4 years ago
Alternatives and similar repositories for sea
Users that are interested in sea are comparing it to the libraries listed below
Sorting:
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 8 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- Compact Tree Representation☆16Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 7 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Succinct C++☆24Updated 4 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- SUccinct Retrieval Framework☆20Updated 9 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Updated 3 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- Efficient Prefix-Sum data structures in C++.☆25Updated last year
- ☆12Updated 7 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- C++11 library for fast fuzzy searching☆14Updated 9 years ago