Implementation and Analysis of Binomial Queue Algorithms
From MaRDI portal
Publication:4158468
DOI10.1137/0207026zbMath0379.68023OpenAlexW1981856985MaRDI QIDQ4158468
Publication date: 1978
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0207026
Related Items (27)
The pairing heap: A new form of self-adjusting heap ⋮ Regular numeral systems for data structures ⋮ Worst-case efficient external-memory priority queues ⋮ A linear-time algorithm for finding a minimum spanning pseudoforest ⋮ The K-D heap: An efficient multi-dimensional priority queue ⋮ On \(\alpha \)-greedy expansions of numbers ⋮ An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop ⋮ A complexity O(1) priority queue for event driven molecular dynamics simulations ⋮ Embedding trees in recursive circulants ⋮ Optimizing binary heaps ⋮ The weak-heap data structure: variants and applications ⋮ Searching rigid data structures ⋮ Optimal purely functional priority queues ⋮ Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data ⋮ Bipartite binomial heaps ⋮ Three priority queue applications revisited ⋮ A generalization of binomial queues ⋮ Two skew-binary numeral systems and one application ⋮ Maximum incomplete recursive circulants in graph embeddings ⋮ The even adjacency split problem for graphs ⋮ Continuous models that are equivalent to randomness for the analysis of many sorting algorithms ⋮ FAT HEAPS WITHOUT REGULAR COUNTERS ⋮ A Survey on Priority Queues ⋮ A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY ⋮ A priority queue in which initialization and queue operations takeO(loglogD) time ⋮ On the construction of regular minimal broadcast digraphs ⋮ The relaxed min-max heap: A mergeable double-ended priority queue
This page was built for publication: Implementation and Analysis of Binomial Queue Algorithms
