The d-deap\(^*\): a fast and simple cache-aligned d-ary deap

DOI10.1016/j.ipl.2004.10.001zbMath1173.68451OpenAlexW2029952367MaRDI QIDQ834995

Haejae Jung

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.10.001

zbMATH Keywords

data structuresdeapdouble-ended priority queue

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

A SIMPLE ARRAY VERSION OF M-HEAP

Cites Work

• Unnamed Item
• Priority queues with update and finding minimum spanning trees
• Symmetric min-max heap: a simpler data structure for double-ended priority queue
• Min-max heaps and generalized priority queues
• MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
• Irredundant intervals
• Supernode Binary Search Trees

This page was built for publication: The d-deap\(^*\): a fast and simple cache-aligned d-ary deap