The effective entropy of next/previous larger/smaller value queries

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


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.

Original languageEnglish
Pages (from-to)39-43
Number of pages5
JournalInformation Processing Letters
StatePublished - 1 May 2019


  • Data structures
  • Encoding model
  • Next/previous larger values

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'The effective entropy of next/previous larger/smaller value queries'. Together they form a unique fingerprint.

Cite this