Encoding Nearest Larger Values
From MaRDI portal
Publication:2942276
DOI10.1007/978-3-319-19929-0_33zbMath1432.68100OpenAlexW3122775100MaRDI QIDQ2942276
Rajeev Raman, Patrick K. Nicholson
Publication date: 20 August 2015
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2381/39591
Cites Work
- Combined data structure for previous- and next-smaller-values
- Encoding 2D range maximum queries
- Faster entropy-bounded compressed suffix trees
- A uniform paradigm to succinctly encode various families of trees
- Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
- Space Efficient Data Structures for Nearest Larger Neighbor
- Encoding range minima and range top-2 queries
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Finding Nearest Larger Neighbors
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem
This page was built for publication: Encoding Nearest Larger Values
