☆16Jun 19, 2014Updated 11 years ago
Alternatives and similar repositories for SortingAlgorithmsBenchmark
Users that are interested in SortingAlgorithmsBenchmark are comparing it to the libraries listed below
Sorting:
- A simple sparse bitmap implementation in java☆22Jan 28, 2016Updated 10 years ago
- Imagemin loader module for webpack.☆10Jul 29, 2023Updated 2 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 5 months ago
- A Lightweight Graph Processing Framework for Multi-GPUs☆14Apr 15, 2015Updated 10 years ago
- Counting the collisions with perl hash tables per function☆12Jun 5, 2019Updated 6 years ago
- Artifact of paper "Exploiting Recent SIMD Architectural Advances for Irregular Applications"☆11Jun 23, 2016Updated 9 years ago
- rans optimized tricks☆26Apr 27, 2018Updated 7 years ago
- ☆14Aug 12, 2020Updated 5 years ago
- Draft specification for supporting BigInts in JavaScript’s Math methods.☆41May 29, 2025Updated 9 months ago
- public-domain implementation of entropy coder from ANS family.☆21Jun 10, 2019Updated 6 years ago
- Companion source code for GTC 2014 talk☆11Mar 25, 2014Updated 11 years ago
- Burrows-Wheeler-Scott transform☆14Jun 7, 2013Updated 12 years ago
- ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks☆11Apr 11, 2017Updated 8 years ago
- Graph algorithms and data structures☆17May 30, 2022Updated 3 years ago
- A scalable distributed graph partitioner. Ongoing research.☆15Apr 23, 2017Updated 8 years ago
- A C implementation of a Boldi-Vigna graph decompressor☆17Jul 5, 2016Updated 9 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 11 months ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Sep 19, 2014Updated 11 years ago
- experimental sexp parsing using SIMD☆11Feb 13, 2023Updated 3 years ago
- A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction☆24May 4, 2014Updated 11 years ago
- UNMAINTAINED☆45Apr 21, 2018Updated 7 years ago
- A proposal for a futures programming model for ISO C++☆23Aug 1, 2018Updated 7 years ago
- Link-cut trees visualisation on Qt C++☆10Mar 20, 2021Updated 5 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Nov 16, 2020Updated 5 years ago
- An interpretation of the content stream structure as described by ISO 32000☆12Jan 31, 2023Updated 3 years ago
- Efficient graph clustering software for normalized cut and ratio association on undirected graphs. Copyright(c) 2008 Brian Kulis, Yuqiang…☆22Jul 1, 2012Updated 13 years ago
- ☆13Jun 23, 2022Updated 3 years ago
- An experimental SQL connector for containers and streams of the C++ Standard Library☆37Nov 27, 2018Updated 7 years ago
- Faster Montgomery and Joye ladder formulas for short Weierstrass elliptic curves☆22Jul 1, 2020Updated 5 years ago
- Standardized debug☆34May 25, 2021Updated 4 years ago
- ☆11Nov 29, 2017Updated 8 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Sep 2, 2021Updated 4 years ago
- Dolphin - a Deep Learning on MIC architecture Project.☆25Oct 30, 2014Updated 11 years ago
- SDS 385: Statistical Models for Big Data☆17Oct 25, 2017Updated 8 years ago
- ☆11Feb 21, 2023Updated 3 years ago
- Simple C++ code to benchmark fast division algorithms☆54May 6, 2021Updated 4 years ago
- Find the path of a value in a complex JavaScript object graph/tree.☆10Oct 12, 2025Updated 5 months ago
- A C++ Pregel Clone with dynamic load balancing, based on a paper "Mizan: A System for Dynamic Load Balancing in Large-scale Graph Process…☆27Dec 3, 2013Updated 12 years ago
- A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)☆12Apr 24, 2020Updated 5 years ago