1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DS2026★ 1 cited
Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
Joel Andersson, Matti Karppa
We present an implementation of Pagh's compressed matrix multiplication algorithm, a randomized algorithm that constructs sketches of matrices to compute an unbiased estimate of th…
cs.DS2022★ 1 cited
HyperLogLogLog: Cardinality Estimation With One Log More
Matti Karppa, Rasmus Pagh
We present HyperLogLogLog, a practical compression of the HyperLogLog sketch that compresses the sketch from bits down to $m \log_2\log_2\log_2 m + O(m+\log\log n)…
cs.DS2019
Engineering Boolean Matrix Multiplication for Multiple-Accelerator Shared-Memory Architectures
Matti Karppa, Petteri Kaski
We study the problem of multiplying two bit matrices with entries either over the Boolean algebra or over the binary field . We engineer high-per…