… the two-dimensional range maximum query problem (2D-RMQ). The input to this problem
is a two dimensional m by n array A of N … We consider queries of the following types. A 1-sided …

… of encoding range minimum queries (RMQs): given an array … and create a data structure that
can answer the query RMQ(i,j), … our result to the encoding range top-2 query (RT2Q) problem…

… query range can be reported. We consider the space complexity of the encoding variant of
the problem where queries … matrix A, ie all information must be encoded in the data structure. …

… two-dimensional range maximum query (2D-RMQ) problem: given an array containing elements
from an ordered set, encode … 2D-RMQ, ie, how many bits are needed to encode an array …

… encoding for range Top-2 queries (RT2Q), and evaluate its performance. Given an array A[1,
n] of n elements from a total order, the range … and L(k) when 2d-max heap is represented by …

… build an encoding of the input so that subsequent queries can … only the encoding (ie, with no
access to the input at query time… the encoding data structures for a 1D array A[1,n], and a 2D …

… Furthermore, our result can encode the RMQs of a random array A in 1.919… encoding range
top-2 query (RT2Q) problem, which is like the encoding RMQ problem except that the query …

… range of A, without accessing the array A at query time. In this thesis, we design a practical
variant of an encoding for range Top-2 query (… , and L(k) when 2d-max heap is represented by …

… We consider the problem of encoding two-dimensional arrays, whose elements come from
… encoding for the sorted 1-sided Top-k queries on a 2D array A, to obtain an optimal encoding …

… of encoding two-dimensional arrays, whose elements come from a total order, for answering
\({\text{Top-}}{k}\) queries. … encoding which supports unsorted query using optimal space, if …