Queaps

DOI10.1007/s00453-004-1139-5zbMath1065.68042OpenAlexW4246145339WikidataQ64114815 ScholiaQ64114815MaRDI QIDQ1777274

Stefan Langerman, John Iacono

Publication date: 13 May 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1139-5

zbMATH Keywords

priority queue

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 (8)

A Distribution-Sensitive Dictionary with Low Space Overhead ⋮ Rank-Sensitive Priority Queues ⋮ On the hierarchy of distribution-sensitive properties for data structures ⋮ A priority queue with the time-finger property ⋮ A distribution-sensitive dictionary with low space overhead ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ A History of Distribution-Sensitive Data Structures ⋮ A Survey on Priority Queues

This page was built for publication: Queaps