Worst-case data structures for the priority queue with attrition

DOI10.1016/0020-0190(89)90071-9zbMath0685.68027OpenAlexW2044674329MaRDI QIDQ1262119

Rajamani Sundar

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90071-9

zbMATH Keywords

priority queue with attrition

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

I/O-efficient 2-d orthogonal range skyline and attrition priority queues ⋮ Computing external farthest neighbors for a simple polygon ⋮ Dynamic Planar Range Maxima Queries

Cites Work

• Making data structures persistent
• Optimal pagination of B-trees with variable-length items
• Average Case Analysis of Marking Algorithms

This page was built for publication: Worst-case data structures for the priority queue with attrition