Alternatives and similar repositories for PaCHash

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

• marvinwilliams / multiqueue
  ☆17Updated 2 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated last month
• 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 last month
• ByteHamster / GpuRecSplit
  Parallel space-efficient minimal perfect hash function on SIMD and GPU
  ☆14Updated last month
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆44Updated this week
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated last month
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated last month
• 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
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆38Updated 2 weeks ago
• stanford-mast / Silo
  Multi-platform topology-aware memory management library
  ☆13Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• kittobi1992 / cluster_editing
  KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…
  ☆10Updated 2 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆119Updated 4 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 3 months ago
• cmpxchg16 / tsx.me
  Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox
  ☆24Updated 10 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated this week
• lemire / fast_division
  Simple C++ code to benchmark fast division algorithms
  ☆50Updated 4 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 10 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆78Updated last year
• kamping-site / kamping
  KaMPIng: (Near) zero-overhead MPI wrapper for modern C++
  ☆50Updated last week