M. Marin. "Binary tournaments and priority queues: PRAM and BSP". Technical report PRG-TR-7-97, Oxford University, Jan. 1997. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Priority Queue Operations On EREW-PRAM - Marín (1997) (Correct)
....improve previous solutions. This improvement comes from the use of a tournament based complete binary tree (CBT) rather than variations to the standard implicit heap. This data structure has also enabled improved implementations of multiple item priority queue operations on the PRAM and BSP models [2]. As we showed in this paper, the CBT enables a more efficient implementation of the extract min and insert operations with the additional advantage that the algorithms involved are noticeably simpler than the ones proposed in previous approaches. One disvantage of the CBT, however, is its higher ....
M. Marin. "Binary tournaments and priority queues: PRAM and BSP". Technical report PRG-TR-7-97, Oxford University, Jan. 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC