$k^2$-octopus: An Adaptive Data Structure for Binary Matrices
- 5 November 2026
- book chapter
- Published by Springer Nature
- p. 18-33
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Depth First Representations of $k^2$-trees2025
- Cache-Friendly Compressed Boolean Matrices2025
- Evaluating regular path queries on compressed adjacency matricesThe VLDB Journal, 2024
- Sparse Binary Relation Representations for Genome Graph Annotation2019
- Compressed $\text {k}\mathsf {^d}\text {-tree}$ k d -tree for temporal graphsKnowledge and Information Systems, 2015
- Delta-K 2-tree for Compact Representation of Web Graphs2014
- From Theory to Practice: Plug and Play with Succinct Data Structures2014
- Compact Querieable Representations of Raster Data2013
- k2-Trees for Compact Web Graph Representation2009
- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time1999