14 citations · 15 across the 3 of their papers we have counts for
3 papers
CODAG: Characterizing and Optimizing Decompression Algorithms for GPUs
Jeongmin Park, Zaid Qureshi, Vikram Mailthody +10
Data compression and decompression have become vital components of big-data applications to manage the exponential growth in the amount of data collected and stored. Furthermore, b…
Parallelizing Maximal Clique Enumeration on GPUs
Mohammad Almasri, Yen-Hsiang Chang, Izzat El Hajj +3
We present a GPU solution for exact maximal clique enumeration (MCE) that performs a search tree traversal following the Bron-Kerbosch algorithm. Prior works on parallelizing MCE o…
Parallel K-Clique Counting on GPUs
Mohammad Almasri, Izzat El Hajj, Rakesh Nagi +2
Counting k-cliques in a graph is an important problem in graph analysis with many applications such as community detection and graph partitioning. Counting k-cliques is typically d…