craignm / sequiturLinks
Automatically exported from code.google.com/p/sequitur
☆50Updated 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☆108Updated 8 years ago
- ♥ Janusz Brzozowski☆163Updated last year
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 10 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Succinct data structures in C/C++☆88Updated 11 months ago
- Optimizing database queries with array programming☆20Updated 4 years ago
- Compact Data Structures Library☆128Updated 11 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- RWMutex for sharing of multicore machines.☆17Updated 6 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- ☆50Updated 5 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- High-performance dictionary coding☆105Updated 8 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Automated multicore scalability testing tool☆88Updated 9 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- The StreamIt compiler infrastructure.☆71Updated 8 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- The Parrot stable and deterministic multi-threading system.☆25Updated 11 years ago
- A Profiler for Identifying the Major Sources of Performance Variance in Modern Applications☆95Updated 7 years ago
- Algorithm examples in PlusCal, the algorithm language of Lamport's TLA+☆61Updated 10 years ago
- Optimizing Synthesis with Metasketches, POPL 2016☆23Updated 8 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆138Updated 7 months ago
- A collection of succinct data structures☆209Updated last year
- Experimentation around 'emil-e/rapidcheck' by combining it with libFuzzer☆27Updated 7 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- Persistent Memory Graph Database☆43Updated 2 years ago
- Your worst case is our best case.☆140Updated 8 years ago