TY - JOUR
T1 - The effective entropy of next/previous larger/smaller value queries
AU - Tsur, Dekel
N1 - Publisher Copyright:
© 2019 Elsevier B.V.
PY - 2019/5/1
Y1 - 2019/5/1
N2 - We study the problem of storing the minimum number of bits required to answer next/previous larger/smaller value queries on an array A of n numbers, without storing A. We show that these queries can be answered by storing at most 3.701n bits (the time for answering queries is O(n)). Our result improves the result of Jo and Satti (2016) [12] that gives an upper bound of 4.088n bits for this problem.
AB - We study the problem of storing the minimum number of bits required to answer next/previous larger/smaller value queries on an array A of n numbers, without storing A. We show that these queries can be answered by storing at most 3.701n bits (the time for answering queries is O(n)). Our result improves the result of Jo and Satti (2016) [12] that gives an upper bound of 4.088n bits for this problem.
KW - Data structures
KW - Encoding model
KW - Next/previous larger values
UR - http://www.scopus.com/inward/record.url?scp=85060712091&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2019.01.011
DO - 10.1016/j.ipl.2019.01.011
M3 - Article
AN - SCOPUS:85060712091
VL - 145
SP - 39
EP - 43
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
ER -