Lower bound for succinct range minimum query

DOI10.1145/3357713.3384260OpenAlexW3035682613MaRDI QIDQ5145023

Mingmou Liu, Huacheng Yu

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.05738

zbMATH Keywords

lower bounddata structurerange minimum querycell-probe complexity

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (4)

Improved range minimum queries ⋮ Space-time trade-offs for the LCP array of Wheeler DFAs ⋮ On the minimum total length of interval systems expressing all intervals, and range-restricted queries ⋮ Range minimum queries in minimal space

This page was built for publication: Lower bound for succinct range minimum query

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145023)