Alternatives and similar repositories for DySECT

Users that are interested in DySECT are comparing it to the libraries listed below

• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆110Updated 5 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated last year
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆32Updated 5 months ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆30Updated 2 months ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• marvinwilliams / multiqueue
  ☆17Updated 3 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 9 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated last year
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆30Updated 6 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆124Updated 3 months ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 8 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆45Updated last week
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• skarupke / two_bit_mutex
  Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
  ☆25Updated 2 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 2 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆278Updated 5 months ago
• 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
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 4 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆17Updated 6 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆163Updated 5 months ago