FAT HEAPS WITHOUT REGULAR COUNTERS

DOI10.1142/S1793830913600069zbMath1273.68098OpenAlexW4231975843MaRDI QIDQ2846479

Jyrki Katajainen, Amr Elmasry

Publication date: 5 September 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

data structurespriority queuesdecrease operationregular counters

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Miscellaneous applications of number theory (11Z05) Data structures (68P05)

Related Items (3)

Regular numeral systems for data structures ⋮ An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop ⋮ Bipartite binomial heaps

Cites Work

• Unnamed Item
• BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
• A data structure for manipulating priority queues
• Implementation and Analysis of Binomial Queue Algorithms
• Multipartite priority queues

This page was built for publication: FAT HEAPS WITHOUT REGULAR COUNTERS