The soft heap

DOI10.1145/355541.355554zbMath1094.68546DBLPjournals/jacm/Chazelle00OpenAlexW2039221685WikidataQ55951521 ScholiaQ55951521MaRDI QIDQ4406296

Bernard Chazelle

Publication date: 25 June 2003

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355541.355554

zbMATH Keywords

priority queue data structuresoft heap data structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Abstract data types; algebraic specification (68Q65) Data structures (68P05)

Related Items (7)

Unnamed Item ⋮ The saga of minimum spanning trees ⋮ Unnamed Item ⋮ List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity ⋮ Streaming Algorithms for Selection and Approximate Sorting ⋮ A selectable sloppy heap ⋮ A Survey on Priority Queues

This page was built for publication: The soft heap