kamping-site / kassert
Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and assertions.
☆11Updated 5 months ago
Related projects: ⓘ
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆12Updated last year
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated 3 weeks ago
- ☆13Updated 4 months ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆27Updated this week
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated last month
- REplicated STORagE☆11Updated last year
- Winning Solver of PACE Challenge 2019 Track A☆12Updated 3 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated this week
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- Generate pgfplots or gnuplots from embedded SQL statements☆24Updated last month
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆32Updated this week
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 6 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Packed and Compressed Hash Tables☆14Updated 9 months ago
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆57Updated this week
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆14Updated last week
- Implementation of the sacabench framework☆15Updated 3 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Parallel Weighted Random Sampling☆19Updated 3 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆115Updated this week
- Learned Monotone Minimal Perfect Hashing☆20Updated 2 weeks ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆25Updated 2 weeks ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆18Updated this week
- Maximum independent sets and vertex covers of large sparse graphs.☆68Updated last month
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆29Updated 6 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆159Updated 3 years ago
- ☆12Updated 4 months ago
- Vienna Graph Clustering☆15Updated 3 years ago
- Management of Benchmark Instances and Instance Attributes☆16Updated last week
- Implementation of the HYPE hypergraph partitioner.☆17Updated 4 years ago