Implementation and Analysis of Binomial Queue Algorithms

Cited In (29)

Embedding augmented cube into certain trees and windmill graphs
Worst-case efficient external-memory priority queues
Continuous models that are equivalent to randomness for the analysis of many sorting algorithms
Efficient privacy-preserving data merging and skyline computation over multi-source encrypted data
Building a parallel branch and bound library
Searching rigid data structures
The K-D heap: An efficient multi-dimensional priority queue
Three priority queue applications revisited
Two skew-binary numeral systems and one application
On \(\alpha \)-greedy expansions of numbers
A linear-time algorithm for finding a minimum spanning pseudoforest
The relaxed min-max heap: A mergeable double-ended priority queue
The weak-heap data structure: variants and applications
Regular numeral systems for data structures
Maximum incomplete recursive circulants in graph embeddings
On the construction of regular minimal broadcast digraphs
Bipartite binomial heaps
Fat heaps without regular counters
A complexity O(1) priority queue for event driven molecular dynamics simulations
The pairing heap: A new form of self-adjusting heap
An in-place priority queue with \(O(1)\) time for push and \(\lg n + O(1)\) comparisons for pop
Optimizing binary heaps
Optimal purely functional priority queues
The even adjacency split problem for graphs
A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
A survey on priority queues
Embedding trees in recursive circulants
A generalization of binomial queues
A priority queue in which initialization and queue operations takeO(loglogD) time

This page was built for publication: Implementation and Analysis of Binomial Queue Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158468)