Better size estimation for sparse matrix products

DOI10.1007/s00453-012-9692-9zbMath1311.68188arXiv1006.4173OpenAlexW2569499781MaRDI QIDQ2249750

Andrea Campagna, Rasmus Resen Amossen, Rasmus Pagh

Publication date: 3 July 2014

Published in: Algorithmica, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.4173

zbMATH Keywords

algorithmsrelational algebramatrix multiplication

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Database theory (68P15) Approximation algorithms (68W25) Randomized algorithms (68W20) Boolean and Hadamard matrices (15B34)

Related Items (2)

GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU ⋮ Unnamed Item

Uses Software

• Find

Cites Work

• A fast output-sensitive algorithm for Boolean matrix multiplication
• Structure prediction and computation of sparse matrix products
• Size-estimation framework with applications to transitive closure and reachability
• Fast sparse matrix multiplication
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Selecting the Median
• On Estimating Path Aggregates over Streaming Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Better size estimation for sparse matrix products