2 citations · 3 across the 10 of their papers we have counts for
4 papers · 1 filter
The Quick and the Dead: Estimating Sparse-Matrix Permanents with Adaptive Work Filtering
Deniz Elbek, Yiğit Manafi, Zeynep Gürdal +2
Rasmussen's permanent estimator is a simple and unbiased estimator for the permanent of a binary matrix, but its practical performance can be limited by trajectories that terminate…
Graph-Aware Exact Branch-and-Bound with Device Profiles for Static Qubit Allocation
Kamer Kaya
Static qubit allocation maps a circuit's logical qubits to a sparse physical device while minimising an interaction-weighted physical-distance cost function, yielding a rectangular…
Graph Traversal on Tensor Cores: A BFS Framework for Modern GPUs
Deniz Elbek, Kamer Kaya
Modern GPUs have Tensor Cores (TCs) capable of extremely high-throughput matrix operations, yet graph algorithms remain difficult to accelerate because of their irregular and data-…
Diagonal Packing for Efficient Homomorphic Sparse Matrix-Vector Multiplication
Kemal Mutluergil, Deniz Elbek, Kamer Kaya +1
Homomorphic encryption (HE) enables computation over encrypted data but incurs a substantial overhead. For sparse matrix-vector multiplication, the widely used Halevi-Shoup scheme…