Path queries on functions
From MaRDI portal
Publication:1740690
DOI10.1016/J.TCS.2018.10.021zbMath1473.68060OpenAlexW2897193193MaRDI QIDQ1740690
Gonzalo Navarro, Meng He, Travis Gagie
Publication date: 2 May 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.10.021
Related Items (1)
Cites Work
- Unnamed Item
- Space-efficient data-analysis queries on grids
- Succinct representations of permutations and functions
- Succinct representation of labeled trees
- Representing trees of higher degree
- A simple storage scheme for strings achieving entropy bounds
- Range majorities and minorities in arrays
- A uniform paradigm to succinctly encode various families of trees
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- Succinct Data Structures for Path Queries
- Succinct Indices for Path Minimum, with Applications to Path Reporting
- Succinct ordinal trees with level-ancestor queries
- Time-Optimal Top-$k$ Document Retrieval
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Succinct ordinal trees based on tree covering
- Data Structures for Path Queries
- Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries
- Path queries on functions
- Orthogonal range searching on the RAM, revisited
- Theory and practice of monotone minimal perfect hashing
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
This page was built for publication: Path queries on functions
