Path_decomposed_tries
Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
| Project Name | Stars | Downloads | Repos Using This | Packages Using This | Most Recent Commit | Total Releases | Latest Release | Open Issues | License | Language |
|---|---|---|---|---|---|---|---|---|---|---|
| Recipe | 186 | 10 months ago | 4 | apache-2.0 | C++ | |||||
| RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019) | ||||||||||
| Pfds | 90 | 5 years ago | 4 | other | Scheme | |||||
| functional data structures for scheme | ||||||||||
| Path_decomposed_tries | 44 | 11 years ago | other | C++ | ||||||
| Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition". | ||||||||||
| Farray | 14 | a year ago | 3 | bsd-2-clause | C++ | |||||
| Initialize / Fill C++ array fast - O(1) time with only 1 extra bit of memory. | ||||||||||
| Text Sequence | 12 | 4 years ago | apache-2.0 | C++ | ||||||
| Text sequence data structures | ||||||||||
| Bitvector | 12 | 8 years ago | C++ | |||||||
| This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures." | ||||||||||
| Balloon | 9 | 8 years ago | 1 | July 05, 2016 | apache-2.0 | Go | ||||
| A forward-secure append-only persistent authenticated data structure | ||||||||||
| Papers | 5 | 2 years ago | ||||||||
| The most influential papers about distributed systems, databases, algorithms and data structures | ||||||||||
Alternatives To Path_decomposed_triesSelect To Compare
Alternative Project Comparisons
Popular Paper Projects
Popular Data Structure Projects
Popular Learning Resources Categories
Get A Weekly Email With Trending Projects For These Categories
No Spam. Unsubscribe easily at any time.
C Plus Plus
Paper
Cmake
Data Structure
Boost