A Survey on Priority Queues
From MaRDI portal
Publication:2848973
DOI10.1007/978-3-642-40273-9_11zbMath1394.68091OpenAlexW2169316699MaRDI QIDQ2848973
Publication date: 13 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://pure.au.dk/ws/files/72054050/C313.pdf
Related Items (4)
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time ⋮ A Geo/Geo/1 inventory priority queue with self induced interruption ⋮ A fast algorithm for quadratic resource allocation problems with nested constraints ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures
Uses Software
Cites Work
- A tight lower bound for top-down skew heaps
- Weak heaps engineered
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- Implicit \(B\)-trees: A new data structure for the dictionary problem
- A generalization of binomial queues
- Diamond deque: A simple data structure for priority deques
- The derivation of a tighter bound for top-down skew heaps
- An algorithm for merging heaps
- Two new methods for constructing double-ended priority queues from priority queues
- Two-tier relaxed heaps
- The pairing heap: A new form of self-adjusting heap
- Upper bounds for time-space trade-offs in sorting and selection
- Selection and sorting with limited storage
- Implicit data structures for fast search and update
- Deleting the root of a heap
- Priority queues with update and finding minimum spanning trees
- Preserving order in a forest in less than logarithmic time and linear space
- Symmetric min-max heap: a simpler data structure for double-ended priority queue
- Weak-heap sort
- Surpassing the information theoretic bound with fusion trees
- The relaxed min-max heap: A mergeable double-ended priority queue
- On the complexity of building an interval heap
- The buffer tree: A technique for designing batched external data structures
- Heaps and heapsort on secondary storage
- Queaps
- A note on the construction of the data structure ``deap
- Log-logarithmic worst-case range queries are possible in space theta(N)
- The weak-heap data structure: variants and applications
- A priority queue with the time-finger property
- An optimal algorithm for selection in a min-heap
- Quake Heaps: A Simple Alternative to Fibonacci Heaps
- A Catalogue of Algorithms for Building Weak Heaps
- Worst-Case Optimal Priority Queues via Extended Regular Counters
- Black box for constant-time insertion in priority queues (note)
- Melding priority queues
- On the efficiency of pairing heaps and related data structures
- Cache-Oblivious Algorithms
- Tight(er) worst-case bounds on dynamic searching and priority queues
- An optimal minimum spanning tree algorithm
- A general Sequential Time-Space Tradeoff for Finding Unique Elements
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
- Equivalence between priority queues and sorting
- The Violation Heap: A Relaxed Fibonacci-Like Heap
- Meldable heaps and boolean union-find
- Deterministic sorting in O ( n log log n ) time and linear space
- Implicit dictionaries with O(1) modifications per update and fast search
- Pairing Heaps with Costless Meld
- An average case analysis of Floyd's algorithm to construct heaps
- Repeated random insertion into a priority queue
- Heaps on Heaps
- Self-adjusting binary search trees
- Min-max heaps and generalized priority queues
- Implicit Data Structures for the Dictionary Problem
- Interval Heaps
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Design and implementation of an efficient priority queue
- A data structure for manipulating priority queues
- Implementation and Analysis of Binomial Queue Algorithms
- Buckets, Heaps, Lists, and Monotone Priority Queues
- Fishspear: a priority queue algorithm
- Optimal purely functional priority queues
- The soft heap
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- On RAM Priority Queues
- Priority queues: Small, monotone and trans-dichotomous
- Self-Adjusting Heaps
- Parameterized self-adjusting heaps
- Priority Queues and Sorting for Read-Only Data
- Thin heaps, thick heaps
- MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
- Algorithm Theory - SWAT 2004
- Algorithm Theory - SWAT 2004
- Strict fibonacci heaps
- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
- Irredundant intervals
- Power balance and apportionment algorithms for the United States Congress
- Correspondence-based data structures for double-ended priority queues
- Fast priority queues for cached memory
- Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n log n + 0.2 n ) comparisons
- Rank-Pairing Heaps
- A Tournament Problem
- Algorithms and Data Structures
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Survey on Priority Queues
