mklarqvist / StormBitmapsLinks
Fast algorithms for computing XX^T for binary matrices
☆14Updated 6 years ago
Alternatives and similar repositories for StormBitmaps
Users that are interested in StormBitmaps are comparing it to the libraries listed below
Sorting:
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- High-performance dictionary coding☆106Updated 8 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
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- A small DFA for under 16 states☆52Updated 7 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- A benchmark for sorting algorithms☆61Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Parallel boolean circuit evaluation☆26Updated 6 years ago
- Vectorized intersections (research code)☆16Updated 8 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Compact Data Structures Library☆128Updated 11 years ago
- A Minimal Perfect Hash Function Library☆168Updated 4 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Vectorized version of the PCG random number generator☆83Updated 6 months ago
- ☆12Updated 8 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Sux4J is an effort to bring succinct data structures to Java.☆170Updated 3 months ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago