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

DOI10.1016/J.IPL.2004.10.001zbMATH Open1173.68451OpenAlexW2029952367MaRDI QIDQ834995FDOQ834995

Authors: 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

Recommendations

• An optimal parallel algorithm to construct a deap
• A note on the construction of the data structure ``deap
• Min-max heaps and generalized priority queues
• Irredundant intervals
• Fast priority queues for cached memory

zbMATH Keywords

data structuresdeapdouble-ended priority queue

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Irredundant intervals
• Min-max heaps and generalized priority queues
• Priority queues with update and finding minimum spanning trees
• Symmetric min-max heap: a simpler data structure for double-ended priority queue
• Mergeable double-ended priority queues
• Supernode Binary Search Trees

Cited In (1)

• A simple array version of M-heap

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834995)