Compact rich-functional binary relation representations
From MaRDI portal
Recommendations
- Compact binary relation representations with rich functionality
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
- A succinct data structure for self-indexing ternary relations
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Collapsing binary data for algebraic multidimensional representation
Cited in
(12)- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
- Efficient fully-compressed sequence representations
- Collapsing binary data for algebraic multidimensional representation
- Space-efficient data-analysis queries on grids
- ASA-graphs for efficient data representation and processing
- GLOUDS: representing tree-like graphs
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Compact binary relation representations with rich functionality
- A succinct data structure for self-indexing ternary relations
- Minimal storage representations for binary relations
- Wavelet trees for all
- Faster dynamic compressed \(d\)-ary relations
This page was built for publication: Compact rich-functional binary relation representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557019)