| Autor: |
Jayapaul, Varunkumar, Jo, Seungbum, Raman, Rajeev, Raman, Venkatesh, Satti, Srinivasa Rao |
| Zdroj: |
Journal of Discrete Algorithms; Jan2016, Vol. 36, p63-75, 13p |
| Abstrakt: |
Given a sequence of n elements from a totally ordered set, and a position in the sequence, the nearest larger neighbor ( NLN ) query returns the position of the element which is closest to the query position, and is larger than the element at the query position. The problem of finding the nearest larger neighbors of all the elements in a one-dimensional array has attracted interest due to its applications for parenthesis matching and in computational geometry [1–3] . We consider a data structure version of this problem, which is to preprocess a given sequence of elements to construct a data structure that can answer NLN queries efficiently. We consider time-space tradeoffs for the problem in both the indexing and the encoding models when the input is in a one dimensional array, and also initiate the study of this problem on two-dimensional arrays. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
Full Text from ScienceDirect