e/All nearest smaller values

Information
has gloss	eng: In computer science, the all nearest smaller values problem involves computing, for each value in a sequence of numbers, the previous smaller value that has the closest position in the sequence to the given value. This problem was identified by as a versatile subroutine for many other tasks in parallel computing; they developed efficient parallel algorithms for the problem in the Parallel Random Access Machine model, and later researchers have studied algorithms for it in other models of parallel computation. It may also be solved efficiently on a non-parallel computer, in linear time using a stack-based algorithm.
lexicalization	eng: all nearest smaller values
instance of	e/Search algorithm