MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
From MaRDI portal
Publication:5248987
DOI10.1142/S0129054199000022zbMath1319.68064OpenAlexW2027953933MaRDI QIDQ5248987
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054199000022
Related Items
The d-deap\(^*\): a fast and simple cache-aligned d-ary deap, Two new methods for constructing double-ended priority queues from priority queues, Multidimensional heaps and complementary range searching, A Survey on Priority Queues
Cites Work