stxxl / foxxllLinks
FOundation of stXXl and thriLL
☆14Updated last year
Alternatives and similar repositories for foxxll
Users that are interested in foxxll are comparing it to the libraries listed below
Sorting:
- External memory suffix array construction using inducing☆11Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- Relative data structures based on the BWT☆12Updated 7 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 2 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆32Updated 5 months ago
- Dynamic succinct/compressed data structures☆112Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆110Updated 5 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 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
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Succinct Data Structure Library 3.0☆94Updated 2 months ago