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…
  ☆112Updated 8 months ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆163Updated 8 months ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆123Updated 7 months ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆281Updated 2 weeks ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• 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
  ☆31Updated 6 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆311Updated 4 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆21Updated 4 years ago
• marvinwilliams / multiqueue
  ☆17Updated 5 months ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆48Updated 2 months ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆33Updated 8 years ago
• google / hashtable-benchmarks
  ☆109Updated last year
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• bonitao / cmph
  ☆20Updated 3 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated 7 months ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆15Updated last year
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆19Updated 6 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated 11 months ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆142Updated 6 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆85Updated 2 years ago
• MorphStore / TVLLib
  Template Vector Library
  ☆17Updated 4 years ago