Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values (1993)
| Citations: | 36 - 7 self |
BibTeX
@MISC{Berkman93optimaldoubly,
author = {Omer Berkman and Baruch Schieber and Uzi Vishkin},
title = {Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values},
year = {1993}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The all nearest smaller values problem is defined as follows. Let A = (a 1 ; a 2 ; : : : ; an ) be n elements drawn from a totally ordered domain. For each a i , 1 i n, find the two nearest elements in A that are smaller than a i (if such exist): the left nearest smaller element a j (with j ! i) and the right nearest smaller element a k (with k ? i). We give an O(log log n) time optimal parallel algorithm for the problem on a CRCW PRAM. We apply this algorithm to achieve optimal O(log log n) time parallel algorithms for four problems: (i) Triangulating a monotone polygon, (ii) Preprocessing for answering range minimum queries in constant time, (iii) Reconstructing a binary tree from its inorder and either preorder or postorder numberings, (vi) Matching a legal sequence of parentheses. We also show that any optimal CRCW PRAM algorithm for the triangulation problem requires \Omega\Gammauir log n) time. Dept. of Computing, King's College London, The Strand, London WC2R 2LS, England. ...
