Abstract
We consider the problem of selecting the kth largest of n inputs, where initially the inputs are stored in the n leaf processors of the 2n − 1 processor tree machine. A probabilistic algorithm is presented that implements a type of pipelining to solve the problem in a simple data driven fashion, with each processor maintaining just a constant amount of state information. On any problem instance, the algorithm's running time is 0, with overwhelming probability.
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.
