craignm / sequitur
Automatically exported from code.google.com/p/sequitur
☆49Updated 10 months ago
Alternatives and similar repositories for sequitur:
Users that are interested in sequitur are comparing it to the libraries listed below
- Sequitur and RePair grammar induction algorithms implementation☆26Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- The Parrot stable and deterministic multi-threading system.☆25Updated 11 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- ☆49Updated 5 years ago
- Automated multicore scalability testing tool☆88Updated 9 years ago
- Python bindings to Succinct Data Structure Library 2.0☆30Updated 5 years ago
- Tool for drawing diagrams on a grid, combining grids of SVGs into a big SVG figure☆62Updated 2 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs☆13Updated 7 years ago
- Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox☆24Updated 10 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- RWMutex for sharing of multicore machines.☆17Updated 5 years ago
- Succinct data structures in C/C++☆87Updated 7 months ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- FRP: Fast Random Projections☆43Updated 4 years ago
- fine-grained, cgroup-based tool for profiling memory usage over time of a process tree☆46Updated 10 months ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Parallel Sequitur Project☆13Updated 12 years ago
- Compact Data Structures Library☆124Updated 10 years ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 6 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- VATA Tree Automata Library☆32Updated 8 months ago
- Feed-forward Bloom filters☆52Updated 13 years ago