mklarqvist / StormBitmapsLinks
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
Sorting:
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 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
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- finding set bits in large bitmaps☆15Updated 9 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
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- ☆13Updated 6 years ago
- Parallel boolean circuit evaluation☆20Updated 6 years ago
- benchmarking positional population count☆14Updated last year
- Vectorized intersections (research code)☆15Updated 8 years ago
- Long-term book project☆34Updated 3 years ago
- Benchmark and visualization of various compression algorithms☆23Updated 9 years ago
- Multiplying... backward?☆13Updated 4 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 4 years ago
- A collection of SIMD optimized general purpose hash functions☆45Updated 10 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Fast and Reliable (but not Secure) Hash☆53Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64☆10Updated 4 years ago