Simultaneous encodings for range and next/previous larger/smaller value queries
From MaRDI portal
Publication:344773
DOI10.1016/j.tcs.2016.01.043zbMath1353.68061arXiv1612.07493OpenAlexW2264466221MaRDI QIDQ344773
Srinivasa Rao Satti, Seungbum Jo
Publication date: 24 November 2016
Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.07493
encodingrange minimum queries\(2d\)-Min heapbalanced parenthesis sequencenext/previous larger values
Related Items
Simultaneous encodings for range and next/previous larger/smaller value queries, Space-efficient data structure for next/previous larger/smaller value queries, The effective entropy of next/previous larger/smaller value queries
Cites Work
- Unnamed Item
- Simultaneous encodings for range and next/previous larger/smaller value queries
- Ultra-succinct representation of ordered trees with applications
- Combined data structure for previous- and next-smaller-values
- Finding range minima in the middle: approximations and applications
- Representing trees of higher degree
- Encoding 2D range maximum queries
- Succinct data structures for flexible text retrieval systems
- A uniform paradigm to succinctly encode various families of trees
- Space Efficient Suffix Trees
- Succinct Representation of Balanced Parentheses and Static Trees
- Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
- Succinct Representations of Binary Trees for Range Minimum Queries
- Space Efficient Data Structures for Nearest Larger Neighbor
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Succinct ordinal trees based on tree covering
- Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Succinct Trees in Practice
