google / zuckerliLinks
☆28Updated 3 years ago
Alternatives and similar repositories for zuckerli
Users that are interested in zuckerli are comparing it to the libraries listed below
Sorting:
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 2 years ago
- A small DFA for under 16 states☆53Updated 7 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- ☆22Updated 3 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- Succinct data structures in C/C++☆92Updated last year
- 8-bit Xor Filter in C99☆62Updated 6 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆159Updated last month
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Updated 8 months ago
- Learned Monotone Minimal Perfect Hashing☆31Updated 8 months ago
- Poireau: a sampling allocation debugger☆98Updated 3 years ago
- Fast WebAssembly Baseline Compiler☆61Updated 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
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- ☆112Updated last year
- A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs☆13Updated 7 years ago
- SIMDized check which bytes are in a set☆28Updated 7 years ago
- ☆12Updated 2 years ago
- Information about AVX-512 support on recent Intel processors☆45Updated 3 years ago
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆20Updated 4 years ago
- C library to remove white space from strings as fast as possible☆156Updated last year
- A benchmark for sorting algorithms☆62Updated 4 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated 2 years ago
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆119Updated 3 months ago
- ☆24Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Updated 3 years ago
- Markup source code showing optimizations☆36Updated 5 years ago