The K-D heap: An efficient multi-dimensional priority queue

DOI10.1007/3-540-57155-8_257MaRDI QIDQ5060123zbMATH OpenOpenAlexFDO

Authors Yuzheng Ding, Mark Alien Weiss

Publication date 18 January 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57155-8_257

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• The relaxed min-max heap: A mergeable double-ended priority queue
• Mergeable double-ended priority queues
• Min-max heaps and generalized priority queues
• Multidimensional heaps and complementary range searching
• Parallel algorithms for priority queue operations

Cites work

• A data structure for manipulating priority queues
• A pointer-free data structure for merging heaps and min-max heaps
• An algorithm for merging heaps
• Bounds for min-max heaps
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 4062572 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Implementation and Analysis of Binomial Queue Algorithms
• Min-max heaps and generalized priority queues
• Multidimensional binary search trees used for associative searching
• Self-Adjusting Heaps
• The pairing heap: A new form of self-adjusting heap
• The relaxed min-max heap: A mergeable double-ended priority queue

Cited in

(2)

• The soft heap
• scientific article; zbMATH DE number 1979501 (Why is no real title available?)

Describes a project that uses

Uses Software

• heapsort

This page was built for publication: The K-D heap: An efficient multi-dimensional priority queue

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