Cache-Friendly Compressed Boolean Matrices
Authors:
- 22 September 2025
- book chapter
- Published by Springer Nature
- p. 95-108
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Evaluating regular path queries on compressed adjacency matricesThe VLDB Journal, 2024
- Evaluating Regular Path Queries on Compressed Adjacency Matrices2023
- I/O-Optimal Cache-Oblivious Sparse Matrix-Sparse Matrix Multiplication2022
- Cache Oblivious Sparse Matrix Multiplication2018
- Compact Data Structures2016
- Compact representation of Web graphs with extended functionalityInformation Systems, 2014
- A Uniform Paradigm to Succinctly Encode Various Families of TreesAlgorithmica, 2012
- Representing Trees of Higher DegreeAlgorithmica, 2005
- Tables1996
- Space-efficient static trees and graphs1989