A data structure for manipulating priority queues
From MaRDI portal
Publication:4147586
DOI10.1145/359460.359478zbMath0371.68011OpenAlexW1970691969WikidataQ56210996 ScholiaQ56210996MaRDI QIDQ4147586
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
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
The pairing heap: A new form of self-adjusting heap, Regular numeral systems for data structures, Worst-case efficient external-memory priority queues, Probabilistic data structures for priority queues, Fast meldable priority queues, Worst-Case Optimal Priority Queues via Extended Regular Counters, The K-D heap: An efficient multi-dimensional priority queue, On random cartesian trees, An efficient implementation of a static move descriptor-based local search heuristic, An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop, Recurrence relations on heaps, A complexity O(1) priority queue for event driven molecular dynamics simulations, Optimizing binary heaps, Weak heaps engineered, The weak-heap data structure: variants and applications, A priority queue with the time-finger property, Avoiding the global sort: a faster contour tree algorithm, Searching rigid data structures, Tighter bounds on the minimum broadcast time, A Linear Potential Function for Pairing Heaps, Parallel algorithms for gossiping by mail, Optimal purely functional priority queues, The saga of minimum spanning trees, Two-tier relaxed heaps, A pointer-free data structure for merging heaps and min-max heaps, Pairing heaps: the forward variant., Bipartite binomial heaps, Three priority queue applications revisited, A generalization of binomial queues, STRONGER QUICKHEAPS, Lock-free concurrent binomial heaps, Changing and unchanging the diameter of a hypercube, Two skew-binary numeral systems and one application, On sorting, heaps, and minimum spanning trees, Efficient unbalanced merge-sort, Optimal binary search trees, Garamon: a geometric algebra library generator, Refined complexity analysis for heap operations, An elementary algorithm for reporting intersections of red/blue curve segments, Masking patterns in sequences: A new class of motif discovery with don't cares, A note on Euclidean near neighbor searching in the plane, Reflected min-Max heaps, Priority queues on parallel machines, THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP, Intersection reporting on two collections of disjoint sets, The even adjacency split problem for graphs, A note on the construction of the data structure ``deap, A general class of resource tradeoffs, FAT HEAPS WITHOUT REGULAR COUNTERS, A Survey on Priority Queues, A Survey of Data Structures in the Bitprobe Model, A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY, Computational experience with minimum spanning tree algorithms, Weak-heap sort, Theory of 2-3 heaps, Competing for the \(AC\)-unification race, The relaxed min-max heap: A mergeable double-ended priority queue
