A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY

DOI10.1142/S0129054106004510zbMath1117.68336OpenAlexW2155733440MaRDI QIDQ3421856

Amr Elmasry

Publication date: 8 February 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054106004510

zbMATH Keywords

data structuresadaptive sortingamortized analysisbinomial queuesdistribution-sensitive algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)

Related Items (7)

Regular numeral systems for data structures ⋮ On the hierarchy of distribution-sensitive properties for data structures ⋮ A priority queue with the time-finger property ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ A History of Distribution-Sensitive Data Structures ⋮ A Survey on Priority Queues ⋮ Counting inversions adaptively

Cites Work

• The design of dynamic data structures
• The pairing heap: A new form of self-adjusting heap
• Weak-heap sort
• Amortized Computational Complexity
• Self-adjusting binary search trees
• A data structure for manipulating priority queues
• Implementation and Analysis of Binomial Queue Algorithms

This page was built for publication: A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY