Multidimensional heaps and complementary range searching

DOI10.1016/J.IPL.2006.12.008zbMATH Open1184.68199OpenAlexW2035971684MaRDI QIDQ845992FDOQ845992

Peter Brass

Publication date: 29 January 2010

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

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

Recommendations

• Interval Heaps
• Min-max heaps and generalized priority queues
• On the complexity of building an interval heap
• Priority Search Trees
• Bounds for min-max heaps

zbMATH Keywords

data structures

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Bounds for min-max heaps
• Design and Analysis of a Data Structure for Representing Sorted Lists
• A balanced search tree O(1) worst-case update time
• A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME
• Min-max heaps and generalized priority queues
• Fast meldable priority queues
• Diamond deque: A simple data structure for priority deques
• Symmetric min-max heap: a simpler data structure for double-ended priority queue
• MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
• Reflected min-Max heaps
• The relaxed min-max heap: A mergeable double-ended priority queue
• Interval Heaps
• Correspondence-based data structures for double-ended priority queues
• A note on constructing min-max heaps
• On the complexity of building an interval heap
• A note on the construction of the data structure ``deap

Cited In (2)

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

Uses Software

• heapsort

This page was built for publication: Multidimensional heaps and complementary range searching

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