Succinct Representations of Binary Trees for Range Minimum Queries
From MaRDI portal
Publication:2914344
DOI10.1007/978-3-642-32241-9_34zbMath1364.68150OpenAlexW87354433MaRDI QIDQ2914344
Rajeev Raman, Srinivasa Rao Satti, Pooya Davoodi
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/conference_contribution/Succinct_Representations_of_Binary_Trees_for_Range_Minimum_Queries/10148150
Related Items
Two dimensional range minimum queries and Fibonacci lattices, GLOUDS: representing tree-like graphs, Space efficient data structures for nearest larger neighbor, Simultaneous encodings for range and next/previous larger/smaller value queries, Space Efficient Data Structures for Nearest Larger Neighbor, Space-efficient algorithms for computing minimal/shortest unique substrings, A simple linear-space data structure for constant-time range minimum query, Efficient dynamic range minimum query, Linear-space data structures for range mode query in arrays, Fully Functional Static and Dynamic Succinct Trees, Fast Compressed Tries through Path Decompositions, Orthogonal Range Searching for Text Indexing, Linear-space data structures for range frequency queries on arrays and trees
