Alternatives and similar repositories for ips4o

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

• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆120Updated 5 months ago
• 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
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆310Updated 4 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆172Updated 5 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆97Updated 5 years ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆151Updated 2 years ago
• berkeley-container-library / bcl
  The Berkeley Container Library
  ☆124Updated last year
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆45Updated last week
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆32Updated 5 months ago
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• WojciechMula / sse-popcount
  SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html
  ☆345Updated last year
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆278Updated last year
• 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
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• google / hashtable-benchmarks
  ☆107Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆278Updated 5 months ago
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆402Updated 4 months ago
• lemire / testingmlp
  Testing memory-level parallelism
  ☆68Updated last year
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆415Updated 5 months ago
• emeryberger / Heap-Layers
  Heap Layers: An Extensible Memory Allocation Infrastructure
  ☆396Updated last week
• tlk00 / BitMagic
  BitMagic Library
  ☆425Updated 2 months ago
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆264Updated 2 years ago
• lorenzhs / ssssort
  Super Scalar Sample Sort in modern C++
  ☆20Updated 4 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆117Updated 4 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago