stxxl / foxxllLinks
FOundation of stXXl and thriLL
β14Updated 2 years ago
Alternatives and similar repositories for foxxll
Users that are interested in foxxll are comparing it to the libraries listed below
Sorting:
- An efficient external-memory algorithm for the construction of minimal perfect hash functionsβ66Updated last year
- πΆ Compressed bitvector/container supporting efficient random access and rank queriesβ46Updated last year
- Dynamic succinct/compressed data structuresβ115Updated last month
- Ultra fast MSD radix sorterβ10Updated 5 years ago
- Succinct Data Structure Libraryβ109Updated 12 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLogβ48Updated 4 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Constructionβ51Updated 6 years ago
- Parallel Wavelet Tree and Wavelet Matrix Constructionβ25Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPSΒ²Ra)β35Updated last year
- Compact Data Structures Libraryβ103Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.β36Updated 3 years ago
- C library to compute the Hamming weight of arraysβ51Updated 7 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).β55Updated 6 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindingsβ158Updated last year
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating thβ¦β117Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental rβ¦β108Updated 11 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.β14Updated 7 years ago
- A collection of string sorting algorithmsβ55Updated 4 years ago
- Compact Tree Representationβ16Updated 8 years ago
- AVX512F and AVX2 versions of quick sortβ104Updated 8 years ago
- TU DOrtmund lossless COMPression frameworkβ19Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(β¦β50Updated last year
- SIMD recipes, for various platforms (collection of code snippets)β49Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set unionβ41Updated 6 years ago
- Bloom-filter based minimal perfect hash function libraryβ274Updated 6 months ago
- A fast and memory efficient hashmap using sorting to resolve collisionsβ43Updated 5 years ago
- Wavelet tree based on a fixed block boosting techniqueβ16Updated 4 years ago
- Succinct Data Structure Library 3.0β101Updated last month
- 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
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequencesβ55Updated 2 years ago