Abstract
Given an array of n real numbers A=(a 1, a 2, ..., a n ), define MIN(i, j) = min {a i , ..., a j }. The range minima problem consists of preprocessing array A such that queries MIN(i,j), for any 1≤i≤j≤n, can be answered in constant time. Range minima is a basic problem that appears in many other important problems such as lowest common ancestor, Euler tour, pattern matching with scaling, etc. In this work we present a parallel algorithm under the CGM model (Coarse Grained Multicomputer), that solves the range minima problem in O(n/p) time and constant number of communication rounds.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
