Tag
The paper introduces the sync heap, a novel data structure that decouples deletion from revealing the deleted element, enabling constant amortized time for insertions and deletions under limited inspections, and improving a textbook scheduling problem from O(n log n) to O(n).