Space Efficient Data Structures for Nearest Larger Neighbor
From MaRDI portal
Publication:2946053
DOI10.1007/978-3-319-19315-1_16zbMath1350.68075OpenAlexW997942159MaRDI QIDQ2946053
Venkatesh Raman, Seungbum Jo, Varunkumar Jayapaul, Srinivasa Rao Satti
Publication date: 15 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Space_Efficient_Data_Structures_for_Nearest_Larger_Neighbor/10178036
Related Items
Space efficient data structures for nearest larger neighbor, Simultaneous encodings for range and next/previous larger/smaller value queries, Encoding Nearest Larger Values
Cites Work
- Combined data structure for previous- and next-smaller-values
- On space efficient two dimensional range minimum data structures
- Encoding 2D range maximum queries
- Faster entropy-bounded compressed suffix trees
- Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
- Succinct Representations of Binary Trees for Range Minimum Queries
- Optimal Succinctness for Range Minimum Queries
- Finding Nearest Larger Neighbors
- Universal codeword sets and representations of the integers
- 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
