Encoding nearest larger values

DOI10.1016/j.tcs.2017.02.017zbMath1386.68040OpenAlexW2295736397WikidataQ60692290 ScholiaQ60692290MaRDI QIDQ1698712

Peng Zhang

Publication date: 16 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2381/39591

zbMATH Keywords

data structuresencoding data structuressuccinct data structures

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Reverse-Safe Text Indexing ⋮ Fast algorithms for single and multiple pattern Cartesian tree matching

Cites Work

• Unnamed Item
• 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
• Space efficient data structures for nearest larger neighbor
• Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems
• 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