mklarqvist / StormBitmaps
Fast algorithms for computing XX^T for binary matrices
☆14Updated 5 years ago
Alternatives and similar repositories for StormBitmaps:
Users that are interested in StormBitmaps are comparing it to the libraries listed below
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated last year
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Multiplying... backward?☆13Updated 4 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- A C++ library for integer array compression☆29Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Parallel boolean circuit evaluation☆20Updated 6 years ago
- For details, see the blog post:☆32Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- ☆13Updated 6 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Popular hash table implementation benchmarks☆27Updated 7 years ago
- Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64☆10Updated 4 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Fast open addressing hash table☆41Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 10 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 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