A data structure for manipulating priority queues

DOI10.1145/359460.359478MaRDI QIDQ4147586zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jean E. Vuillemin

Publication date 1978

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/359460.359478

Mathematics Subject Classification ID

Trees (05C05) General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(62)

• Reflected min-Max heaps
• Computational experience with minimum spanning tree algorithms
• The pairing heap: A new form of self-adjusting heap
• A pointer-free data structure for merging heaps and min-max heaps
• Three priority queue applications revisited
• Changing and unchanging the diameter of a hypercube
• A note on Euclidean near neighbor searching in the plane
• Weak-heap sort
• Competing for the \(AC\)-unification race
• The relaxed min-max heap: A mergeable double-ended priority queue
• The even adjacency split problem for graphs
• An efficient implementation of a static move descriptor-based local search heuristic
• Avoiding the global sort: a faster contour tree algorithm
• Intersection reporting on two collections of disjoint sets
• A note on the construction of the data structure ``deap
• A general class of resource tradeoffs
• Theory of 2-3 heaps
• Recurrence relations on heaps
• The weak-heap data structure: variants and applications
• A priority queue with the time-finger property
• Lock-free concurrent binomial heaps
• Regular numeral systems for data structures
• Garamon: a geometric algebra library generator
• Optimizing binary heaps
• Efficient unbalanced merge-sort
• Fat heaps without regular counters
• A survey on priority queues
• A Survey of Data Structures in the Bitprobe Model
• Worst-case optimal priority queues via extended regular counters
• A linear potential function for pairing heaps
• STRONGER QUICKHEAPS
• The violation heap: a relaxed Fibonacci-like heap
• 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
• Weak heaps engineered
• On random cartesian trees
• Optimal purely functional priority queues
• The saga of minimum spanning trees
• Bipartite binomial heaps
• Pairing heaps: the forward variant
• Priority queues on parallel machines
• Worst-case efficient external-memory priority queues
• Probabilistic data structures for priority queues
• Fast meldable priority queues
• The K-D heap: An efficient multi-dimensional priority queue
• Refined complexity analysis for heap operations
• Optimal binary search trees
• An elementary algorithm for reporting intersections of red/blue curve segments
• Searching rigid data structures
• Tighter bounds on the minimum broadcast time
• Heap construction: Optimal in both worst and average cases?
• Priority queues with decreasing keys
• A generalization of binomial queues
• Sum-of-max chain partition of a tree
• Two skew-binary numeral systems and one application
• Strict Fibonacci heaps
• Masking patterns in sequences: A new class of motif discovery with don't cares
• External-memory priority queues with optimal insertions
• A complexity O(1) priority queue for event driven molecular dynamics simulations
• Parallel algorithms for gossiping by mail
• Two-tier relaxed heaps
• On sorting, heaps, and minimum spanning trees

This page was built for publication: A data structure for manipulating priority queues

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