2 citations · 3 across the 10 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DC2025
BLEST: Blazingly Efficient BFS using Tensor Cores
Deniz Elbek, Kamer Kaya
Breadth-First Search (BFS) is a fundamental graph kernel that underpins a wide range of applications. While modern GPUs provide specialised Matrix-Multiply-Accumulate (MMA) units,…
cs.DC2025★ 2 cited
SUperman: Efficient Permanent Computation on GPUs
Deniz Elbek, Fatih Taşyaran, Bora Uçar +1
The permanent is a function, defined for a square matrix, with applications in various domains including quantum computing, statistical physics, complexity theory, combinatorics, a…
cs.DC2025
Fully-Automated Code Generation for Efficient Computation of Sparse Matrix Permanents on GPUs
Deniz Elbek, Kamer Kaya
Registers are the fastest memory components within the GPU's complex memory hierarchy, accessed by names rather than addresses. They are managed entirely by the compiler through a…