Please use this identifier to cite or link to this item:
|Title:||Encoding 2-D Range Maximum Queries|
|Authors:||Golin, M. J.|
Rao, S. S.
|Citation:||Theoretical Computer Science, 2016, 609(2) pp. 316–327|
|Abstract:||We consider the two-dimensional range maximum query (2D-RMQ) problem: given an array $A$ of ordered values, to pre-process it so that we can find the position of the smallest element in the sub-matrix defined by a (user-specified) range of rows and range of columns. We focus on determining the effective entropy of 2D-RMQ, i.e., how many bits are needed to encode $A$ so that 2D-RMQ queries can be answered without access to $A$. We give tight upper and lower bounds on the expected effective entropy for the case when $A$ contains independent identically-distributed random values, and new upper and lower bounds for arbitrary $A$, for the case when $A$ contains few rows. The latter results improve upon previous upper and lower bounds by Brodal et al. (ESA 2010). In some cases we also give data structures whose space usage is close to the effective entropy and answer 2D-RMQ queries rapidly.|
|Rights:||Copyright © 2015 Elsevier. This manuscript version is made available after the end of the embargo period under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/|
|Description:||The file associated with this record is under a 24-month embargo from publication in accordance with the publisher's self-archiving policy, available at http://www.elsevier.com/about/company-information/policies/sharing. The full text may be available in the publisher links provided above.|
|Appears in Collections:||Published Articles, Dept. of Computer Science|
Files in This Item:
|TCS-sub-all.pdf||Post-review (final submitted)||334.12 kB||Unknown||View/Open|
Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.