ByteHamster / SicHashLinks
A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
☆19Updated 2 months ago
Alternatives and similar repositories for SicHash
Users that are interested in SicHash are comparing it to the libraries listed below
Sorting:
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- External memory suffix array construction using inducing☆11Updated 4 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆35Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆31Updated 4 months ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated this week
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 8 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- TU DOrtmund lossless COMPression framework☆19Updated 8 months ago
- Ultra fast MSD radix sorter☆11Updated 4 years ago
- ☆17Updated 2 months ago
- Bit packed vector of integral values☆27Updated 4 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Succinct Data Structure Library 3.0☆94Updated last month
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.