Affiliation:
1. Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur 208 016, India
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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Hardware and Architecture,Theoretical Computer Science,Software