Parallel priority queues based on binomial heaps

DOI10.1016/S0167-8191(00)00064-8zbMath0948.68011OpenAlexW1973158064MaRDI QIDQ1583321

Sajal K. Das, Maria Cristina Pinotti

Publication date: 26 October 2000

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00064-8

zbMATH Keywords

time complexitybinomial heapscarry adderinsert and delete operationsmeldable priority queuesparallel data structures

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

This page was built for publication: Parallel priority queues based on binomial heaps