|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
1994 6th IEEE Symposium on Parallel and Distributed Processing
An optimal hypercube algorithm for the all nearest smaller values problem
Dallas, TX, USA
October 26-October 29
ISBN: 0-8186-6427-4
| ASCII Text | x | ||
| Kravets, Plaxton, "An optimal hypercube algorithm for the all nearest smaller values problem," Parallel and Distributed Processing, IEEE Symposium on, pp. 505-512, 1994 6th IEEE Symposium on Parallel and Distributed Processing, 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/SPDP.1994.346129, author = { Kravets and Plaxton}, title = {An optimal hypercube algorithm for the all nearest smaller values problem}, journal ={Parallel and Distributed Processing, IEEE Symposium on}, volume = {0}, year = {1994}, isbn = {0-8186-6427-4}, pages = {505-512}, doi = {http://doi.ieeecomputersociety.org/10.1109/SPDP.1994.346129}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Parallel and Distributed Processing, IEEE Symposium on TI - An optimal hypercube algorithm for the all nearest smaller values problem SN - 0-8186-6427-4 SP505 EP512 A1 - Kravets, A1 - Plaxton, PY - 1994 KW - optimal hypercube algorithm KW - all nearest smaller values problem KW - sequence KW - O(lg n) time KW - normal hypercube algorithm KW - monotone polygon KW - triangulating KW - Cartesian tree VL - 0 JA - Parallel and Distributed Processing, IEEE Symposium on ER - | |||
Given a sequence of n elements, the All Nearest Smaller Values (ANSV) problem is to find, for each element in the sequence, the nearest element to the left (right) that is smaller, or to report that no such element exists. Berkman, Schieber, and Vishkin (1993) give an ANSV algorithm that runs in O(lg n) time on an (n/lg n)-processor CREW PRAM. In this paper, we present an O(lg n)-time n-processor normal hypercube algorithm for the ANSV problem. Furthermore, we prove that any normal hypercube algorithm requires /spl Omega/(n) processors to solve the ANSV problem in O(lg n) time. We use our ANSV algorithm to give the first O(lg n)-time n-processor normal hypercube algorithms for triangulating a monotone polygon and for constructing a Cartesian tree.
Index Terms:
optimal hypercube algorithm, all nearest smaller values problem, sequence, O(lg n) time, normal hypercube algorithm, monotone polygon, triangulating, Cartesian tree
Citation:
Kravets, Plaxton, "An optimal hypercube algorithm for the all nearest smaller values problem," spdp, pp.505-512, 1994 6th IEEE Symposium on Parallel and Distributed Processing, 1994
Usage of this product signifies your acceptance of the Terms of Use.