Tag
priority-queue
- Jan 10, 2026 Indexed Binary Heaps and the Cost of Decrease-Key Why changing a key in place needs a handle from element to heap slot, how the position map is maintained through sifts, and what lazy deletion trades away. data structures
- Dec 31, 2025 Next-Event Time Advance and the Simplicity of the Priority Queue A discrete-event simulator advances time by jumping to the next scheduled event, and the correctness of that jump rests on a heap whose ordering and tie-breaking are both specified. scientific computing
- Oct 10, 2025 Array Layout and the Sift Invariant in Binary Heaps How a complete binary tree maps onto a flat array with no pointers, why the heap property is a partial order, and what sift-up and sift-down actually cost. data structures