activity
20212025
most citedALTO: Adaptive Linearized Storage of Sparse Tensors

33 citations · 34 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG2025

ReLATE: Accelerating Tensor Decomposition via Safe and Efficient Learning of Sparse Encodings

Ahmed E. Helal, Fabio Checconi, Jan Laukemann +4

Tensor decomposition (TD) is essential for analyzing high-dimensional sparse data, yet its irregular computations and memory-access patterns pose major performance challenges on mo…

cs.DC2025

MAGNUS: Generating Data Locality to Accelerate Sparse Matrix-Matrix Multiplication on CPUs

Jordi Wolfson-Pou, Jan Laukemann, Fabrizio Petrini

Sparse general matrix-matrix multiplication (SpGEMM) is a critical operation in many applications. Current multithreaded implementations are based on Gustavson's algorithm and ofte…

cs.DC2024★ 1 cited

Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation

Jan Laukemann, Ahmed E. Helal, S. Isaac Geronimo Anderson +7

High-dimensional sparse data emerge in many critical application domains such as healthcare and cybersecurity. To extract meaningful insights from massive volumes of these multi-di…

cs.DC2022

Efficient, Out-of-Memory Sparse MTTKRP on Massively Parallel Architectures

Andy Nguyen, Ahmed E. Helal, Fabio Checconi +6

Tensor decomposition (TD) is an important method for extracting latent information from high-dimensional (multi-modal) sparse data. This study presents a novel framework for accele…

cs.DC2021★ 33 cited

ALTO: Adaptive Linearized Storage of Sparse Tensors

Ahmed E. Helal, Jan Laukemann, Fabio Checconi +4

The analysis of high-dimensional sparse data is becoming increasingly popular in many important domains. However, real-world sparse tensors are challenging to process due to their…