Interval Heaps

DOI10.1093/comjnl/36.3.209zbMath0770.68045OpenAlexW4250183758MaRDI QIDQ4039034

Jan van Leeuwen, Derick Wood

Publication date: 8 August 1993

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/36.3.209

zbMATH Keywords

complementary-range queriescomplementary-range searchingmin-max priority queuesoptimal query algorithmsstandard heap

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (7)

On the complexity of building an interval heap ⋮ Two new methods for constructing double-ended priority queues from priority queues ⋮ Multidimensional heaps and complementary range searching ⋮ An algorithm for ranking assignments using reoptimization ⋮ Reflected min-Max heaps ⋮ Anytime pack search ⋮ A Survey on Priority Queues

This page was built for publication: Interval Heaps