All Nearest Smallers Made Simple

Abstract

In this paper, a parallel algorithm for all nearest smallers problem without using doubly logarithmic tree is described. It is shown that using only [Formula: see text] time routines for merging and prefix minima, we can easily get an [Formula: see text] time parallel algorithm for the all Nearest Smallers problem.