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…
  ☆117Updated last year
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆165Updated last year
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆131Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 7 years ago
• google / hashtable-benchmarks
  ☆112Updated last year
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆50Updated 7 months ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆315Updated 4 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• bonitao / cmph
  ☆20Updated last week
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆40Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 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
  ☆26Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆175Updated 5 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆19Updated 7 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆21Updated 5 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆69Updated 5 years ago
• jwbuurlage / Bulk
  Modern library for bulk-synchronous parallel programs.
  ☆94Updated 2 years ago
• HowardHinnant / hash_append
  Implementation of hash_append proposal
  ☆67Updated 9 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated last year
• cmuparlay / concurrent_deferred_rc
  Concurrent Deferred Reference Counting
  ☆174Updated last year
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆358Updated last year
• simd-sorting / fast-and-robust
  ☆32Updated 4 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago