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

A high-performance implementation of Sparse Matrix-Vector Multiplication in C++ with serial, parallel (OpenMP), and GPU-accelerated (CUDA) versions, demonstrating the performance benefits of parallelism across different architectures.

Secure unlocking over Wifi with a remote control

Comparison of PageRank algorithm using various datatypes.

Dynamic data structure for sparse graphs.

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

High-performance parallel bi-directional BFS implementation optimized for large-scale graphs using OpenMP, achieving sub-40ms traversal on million-node datasets with adaptive direction switching and lock-free frontier construction.

Comparing space usage of regular vs hybrid CSR.

Benchmarks for the sparse matrix–vector multiplication (SpMV) with matrix formats in TNL.

Simple implementation of the CSR Graph Representation.

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

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

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

Template repository for custom backends in MS Annika.

Generation random matrix for computing sddmm

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

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

A Method for efficiently processing SpMV using SIMD and load balancing

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

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