A multi-threaded implementation of vertex-centric graph processing for CPUs.

Min-𝜖 Cosine 𝑘-Nearest Neighbor Graph Construction using Inverted Index Algorithm for CMPE255 Extra Credit Project at SJSU

Graph Reorder And Converter (e.g, Parallel OpenMP Implementation of Edge List to CSR with Sorted Neighbors) - by Yulin Che (https://github.com/CheYulin)

Regular Path Query finds all pairs of vertices that are connected with a path that conforms to the regular expression.

Generation random matrix for computing sddmm

Simple implementation of the CSR Graph Representation.

A Method for efficiently processing SpMV using SIMD and load balancing

A parallel packed CSR data structure for large-scale dynamic graphs

Dynamic data structure for sparse graphs.

(R) Efficient methods and operators for the sparse matrix classes in 'Matrix' (esp. CSR format or "RsparseMatrix")

Secure unlocking over Wifi with a remote control

Compute the graph minor when given the cluster configuration. Implemented in three versions using OpenMPI, pthreads and OpenCilk.

Template repository for custom backends in MS Annika.

Comparison of PageRank algorithm using various datatypes.

Comparing space usage of regular vs hybrid CSR.

Design of high-performance OpenMP-based parallel Graph Edgelist and Compressed Sparse Row (CSR) loader, aka GVEL.

SystemRDL 2.0 language compiler front-end

high-performance modeling of beam dynamics in particle accelerators with collective effects

This tool is for making X.509 Cert, CRL, CSR and KeyPair(RSA and ECDSA)