Alternatives and similar repositories for GpuRecSplit

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

• marvinwilliams / multiqueue
  ☆17Updated last month
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• ByteHamster / PaCHash
  Packed and Compressed Hash Tables
  ☆15Updated last month
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 2 months 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
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated last month
• 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
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆12Updated last week
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years 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 last month
• ReStoreCpp / ReStore
  REplicated STORagE
  ☆13Updated 2 years ago
• bkille / BitLib
  Provides a bit-vector, an optimized replacement of the infamous std::vector<ool>. In addition to the bit-vector, the library also pro…
  ☆73Updated 11 months ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆109Updated 4 months ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆31Updated 3 months ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆119Updated 3 months 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
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• simd-sorting / fast-and-robust
  ☆31Updated 3 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆44Updated last month
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆162Updated 3 months ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆17Updated 3 years ago
• kamping-site / kamping
  KaMPIng: (Near) zero-overhead MPI wrapper for modern C++
  ☆50Updated last week
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆20Updated 4 years ago
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆38Updated last week
• cmuparlay / flock
  Library for lock-free locks
  ☆77Updated last year
• Vectorized / Static-Sort
  A simple C++ header-only library for fastest sorting of small arrays. Generates sorting networks on compile time via templates.
  ☆52Updated 4 years ago
• jmuehlig / perf-cpp
  Lightweight recording and sampling of performance counters for specific code segments directly from your C++ application.
  ☆62Updated this week
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆29Updated 6 years ago