The effective entropy of next/previous larger/smaller value queries
Data Structures and Algorithms
2018-08-14 v1
Abstract
We study the problem of storing the minimum number of bits required to answer next/previous larger/smaller value queries on an array of numbers, without storing . We show that these queries can be answered by storing at most bits. Our result improves the result of Jo and Satti [TCS 2016] that gives an upper bound of bits for this problem.
Keywords
Cite
@article{arxiv.1808.03658,
title = {The effective entropy of next/previous larger/smaller value queries},
author = {Dekel Tsur},
journal= {arXiv preprint arXiv:1808.03658},
year = {2018}
}