Alternatives and similar repositories for veb-tree

Users that are interested in veb-tree are comparing it to the libraries listed below

• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆31Updated 6 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 4 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆55Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 8 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• goodell / cppmem
  totally unofficial git repo containing sources for the CppMem tool available at http://svr-pes20-cppmem.cl.cam.ac.uk/cppmem/help.html and…
  ☆26Updated 12 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• bloomberg / bde-allocator-benchmarks
  A set of benchmarking tools used to quantify the performance of BDE-style polymorphic allocators.
  ☆33Updated 9 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆41Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆65Updated last year
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 3 months ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆141Updated 5 years ago
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆65Updated 9 years ago
• gnzlbg / scattered
  C++ Scattered Containers
  ☆67Updated 7 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago