On the complexity of building an interval heap

DOI10.1016/0020-0190(94)00020-4zbMath0807.68019OpenAlexW2092035392WikidataQ126407915 ScholiaQ126407915MaRDI QIDQ1327300

Mark Allen Weiss, Yuzheng Ding

Publication date: 18 July 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00020-4

zbMATH Keywords

interval heap

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (2)

Multidimensional heaps and complementary range searching ⋮ A Survey on Priority Queues

Cites Work

• Interval Heaps
• A sorting problem and its complexity

This page was built for publication: On the complexity of building an interval heap