Combined data structure for previous- and next-smaller-values
From MaRDI portal
Publication:533896
DOI10.1016/j.tcs.2011.01.036zbMath1215.68084OpenAlexW2105634337MaRDI QIDQ533896
Publication date: 10 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.036
Related Items
Space efficient data structures for nearest larger neighbor, Simultaneous encodings for range and next/previous larger/smaller value queries, Representation of ordered trees with a given degree distribution, Encoding Nearest Larger Values, Space Efficient Data Structures for Nearest Larger Neighbor, Space-efficient data structure for next/previous larger/smaller value queries, Encoding nearest larger values, Improved algorithms for the range next value problem and applications, Fast relative Lempel-Ziv self-index for similar sequences, The effective entropy of next/previous larger/smaller value queries, Burrows-Wheeler transform and LCP array construction in constant space, An Encoding for Order-Preserving Matching., Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
Cites Work
- Unnamed Item
- Unnamed Item
- Representing trees of higher degree
- Wee LCP
- Faster entropy-bounded compressed suffix trees
- Waiting patterns for a printer
- Compressed suffix trees with full functionality
- Space Efficient Suffix Trees
- Succinct Representation of Balanced Parentheses and Static Trees
- Succinct ordinal trees with level-ancestor queries
- Compressed representations of sequences and full-text indexes
- A Compressed Enhanced Suffix Array Supporting Fast String Matching
- A Uniform Approach Towards Succinct Representation of Trees
- Optimal Succinctness for Range Minimum Queries
- 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 Ordinal Trees Based on Tree Covering
- Fully-Compressed Suffix Trees
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
