System Upgrade on Tue, May 28th, 2024 at 2am (EDT)
Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
Results: 1 - 1of1
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
PARALLEL CONSTRUCTIONS OF HEAPS AND MIN-MAX HEAPS
Preview AbstractWe study parallel solutions to the problem of implementing priority queues and priority deques. It is known that data structures for the implementation (e.g. the heap, the min-max heap, and the deap) can be constructed in linear sequential time. In this paper, we design optimal Θ((log log n)2) time parallel algorithms with
processors for the constructions in the parallel comparison tree model.