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