Soft heaps simplified

DOI10.1137/120880185MaRDI QIDQ2862206zbMATH OpenOpenAlexWikidataFDO

Authors Haim Kaplan, Uri Zwick, Robert E. Tarjan

Publication date 14 November 2013

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/120880185

zbMATH Keywords

data structuresheapspriority queues

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• A simpler implementation and analysis of Chazelle's soft heaps
• The soft heap
• External memory soft heap, and hard heap, a meldable priority queue
• Rank-Pairing Heaps
• scientific article; zbMATH DE number 6469130

Cited in

(9)

• A selectable sloppy heap
• Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract)
• External memory soft heap, and hard heap, a meldable priority queue
• Replacing mark bits with randomness in Fibonacci heaps
• Hollow heaps
• A simpler implementation and analysis of Chazelle's soft heaps
• Dynamic ordered sets with approximate queries, approximate heaps and soft heaps
• A Distributed and Oblivious Heap
• Selection from heaps, row-sorted matrices, and X+Y using soft heaps

This page was built for publication: Soft heaps simplified

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