craignm / sequiturLinks
Automatically exported from code.google.com/p/sequitur
☆51Updated last year
Alternatives and similar repositories for sequitur
Users that are interested in sequitur are comparing it to the libraries listed below
Sorting:
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- Compact Data Structures Library☆103Updated 3 years ago
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- Compact Data Structures Library☆129Updated 11 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- qp tries and crit-bit tries☆124Updated 3 years ago
- Succinct Data Structure Library☆109Updated 12 years ago
- Automated multicore scalability testing tool☆88Updated 10 years ago
- ♥ Janusz Brzozowski☆161Updated last year
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- High-performance dictionary coding☆109Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66Updated last year
- fine-grained, cgroup-based tool for profiling memory usage over time of a process tree☆50Updated last month
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Updated 3 years ago
- Fast decoder for VByte-compressed integers☆127Updated 2 months ago
- A benchmark of some prominent C/C++ hash table implementations☆104Updated 6 years ago
- RWMutex for sharing of multicore machines.☆18Updated 6 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆178Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- Experimentation around 'emil-e/rapidcheck' by combining it with libFuzzer☆27Updated 8 years ago
- ☆55Updated 10 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 10 years ago
- C Minimal Perfect Hashing Library☆88Updated 8 years ago
- Your worst case is our best case.☆144Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- C library to compute the Hamming weight of arrays☆51Updated 7 years ago
- A collection of succinct data structures☆211Updated 2 years ago