| gvinciguerra/PGM-index |
693 |
|
0 |
0 |
over 2 years ago |
0 |
|
5 |
apache-2.0 |
C++ |
| 🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes |
| apeman/awesome_computer_science |
111 |
|
0 |
0 |
over 2 years ago |
0 |
|
0 |
mpl-2.0 |
|
| The complete syllabus of Computer Science and Engineering. Roadmap, Checklist for Beginners. |
| Thermadiag/seq |
74 |
|
0 |
0 |
over 2 years ago |
0 |
|
0 |
mit |
C++ |
| The seq library is a collection of original C++14 STL-like containers and related tools |
| gvinciguerra/PyGM |
39 |
|
0 |
0 |
over 5 years ago |
3 |
July 14, 2020 |
0 |
apache-2.0 |
Python |
| 🐍 Python library implementing sorted containers with state-of-the-art query performance and compressed memory usage |
| bytedance/terark-zip |
35 |
|
0 |
0 |
over 4 years ago |
0 |
|
1 |
bsd-3-clause |
C++ |
| A data structure and algorithm library built for TerarkDB |
| wjakob/dset |
29 |
|
0 |
0 |
almost 11 years ago |
0 |
|
0 |
zlib |
C++ |
| Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank |
| aboffa/CoCo-trie |
25 |
|
0 |
0 |
over 2 years ago |
0 |
|
0 |
gpl-3.0 |
C++ |
| COllapsed and COmpressed trie: a data-aware compressed string dictionary |
| dylan-profiler/compressio |
22 |
|
0 |
0 |
over 3 years ago |
5 |
October 13, 2020 |
0 |
mit |
Python |
| Lossless in-memory compression of pandas DataFrames and Series powered by the visions type system. Up to 10x less RAM needed for the same data. |
| dpt/DPTLib |
21 |
|
0 |
0 |
about 2 years ago |
0 |
|
0 |
bsd-2-clause |
C |
| My C libraries |
| theodesp/unionfind |
15 |
|
1 |
3 |
about 5 years ago |
1 |
January 12, 2020 |
4 |
mit |
Go |
| An idiomatic implementation of a weighted Union Find data structure with path compression in Go. |