Combined Data Structure for Previous-And Next-Smaller-Values

The authors consider the situation where a static array A[1, n] can be preprocessed such that the following three queries can be answered in constant time: previous- and next-smaller-value-queries, where given a position i in A, one searches for the next position p to the left (or right) of i with A[p]

Provided by: Karlsruhe Institute of Technology (KIT) Topic: Software Date Added: Feb 2011 Format: PDF

Find By Topic