tkbtkysms / solcaLinks
A Space-Optimal Grammar Compression
☆10Updated 4 years ago
Alternatives and similar repositories for solca
Users that are interested in solca are comparing it to the libraries listed below
Sorting:
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- LZ Double factor Factorization.☆11Updated 8 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Universe-sliced indexes in C++.☆18Updated 2 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
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Clustered Elias-Fano inverted indexes.☆15Updated 6 years ago
- Interleaving bits from two sources using SIMD instructions.☆14Updated 7 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- Compact Data Structures Library☆100Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 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
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Vectorized intersections (research code)☆15Updated 8 years ago
- A blend of the compact and sparse hash table implementations.☆14Updated 3 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago