A Survey on Priority Queues (Q2848973): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2169316699
@@ Property / OpenAlex ID: W2169316699 / rank @@
+Normal rank
@@ Property / cites work @@
+Black box for constant-time insertion in priority queues (note)
+Normal rank
@@ Property / cites work @@
+Tight(er) worst-case bounds on dynamic searching and priority queues
+Normal rank
@@ Property / cites work @@
+The buffer tree: A technique for designing batched external data structures
+Normal rank
@@ Property / cites work @@
+An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
+Normal rank
@@ Property / cites work @@
+Symmetric min-max heap: a simpler data structure for double-ended priority queue
+Normal rank
@@ Property / cites work @@
+Priority Queues and Sorting for Read-Only Data
@@ Property / cites work: Priority Queues and Sorting for Read-Only Data / rank @@
+Normal rank
@@ Property / cites work @@
+Min-max heaps and generalized priority queues
@@ Property / cites work: Min-max heaps and generalized priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+A general Sequential Time-Space Tradeoff for Finding Unique Elements
+Normal rank
@@ Property / cites work @@
+Repeated random insertion into a priority queue
@@ Property / cites work: Repeated random insertion into a priority queue / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875168
@@ Property / cites work: Q4875168 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4425956
@@ Property / cites work: Q4425956 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Strict fibonacci heaps
@@ Property / cites work: Strict fibonacci heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal purely functional priority queues
@@ Property / cites work: Optimal purely functional priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+Implementation and Analysis of Binomial Queue Algorithms
+Normal rank
@@ Property / cites work @@
+Q4763425
@@ Property / cites work: Q4763425 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the construction of the data structure ``deap''
+Normal rank
@@ Property / cites work @@
+Q3796732
@@ Property / cites work: Q3796732 / rank @@
+Normal rank
@@ Property / cites work @@
+Quake Heaps: A Simple Alternative to Fibonacci Heaps
+Normal rank
@@ Property / cites work @@
+Diamond deque: A simple data structure for priority deques
+Normal rank
@@ Property / cites work @@
+A minimum spanning tree algorithm with inverse-Ackermann type complexity
+Normal rank
@@ Property / cites work @@
+The soft heap
@@ Property / cites work: The soft heap / rank @@
+Normal rank
@@ Property / cites work @@
+Buckets, Heaps, Lists, and Monotone Priority Queues
+Normal rank
@@ Property / cites work @@
+Power balance and apportionment algorithms for the United States Congress
+Normal rank
@@ Property / cites work @@
+MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
@@ Property / cites work: MERGEABLE DOUBLE-ENDED PRIORITY QUEUES / rank @@
+Normal rank
@@ Property / cites work @@
+Correspondence-based data structures for double-ended priority queues
+Normal rank
@@ Property / cites work @@
+The relaxed min-max heap: A mergeable double-ended priority queue
+Normal rank
@@ Property / cites work @@
+On the complexity of building an interval heap
@@ Property / cites work: On the complexity of building an interval heap / rank @@
+Normal rank
@@ Property / cites work @@
+Deleting the root of a heap
@@ Property / cites work: Deleting the root of a heap / rank @@
+Normal rank
@@ Property / cites work @@
+An average case analysis of Floyd's algorithm to construct heaps
+Normal rank
@@ Property / cites work @@
+Weak-heap sort
@@ Property / cites work: Weak-heap sort / rank @@
+Normal rank
@@ Property / cites work @@
+A Catalogue of Algorithms for Building Weak Heaps
@@ Property / cites work: A Catalogue of Algorithms for Building Weak Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+The weak-heap data structure: variants and applications
+Normal rank
@@ Property / cites work @@
+Weak heaps engineered
@@ Property / cites work: Weak heaps engineered / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing             <i>HEAPSORT</i>             with (             <i>n</i>             log             <i>n</i>             - 0.9             <i>n</i>             ) and             <i>QUICKSORT</i>             with (             <i>n</i>             log             <i>n</i>             + 0.2             <i>n</i>             ) comparisons
+Normal rank
@@ Property / cites work @@
+Q2728854
@@ Property / cites work: Q2728854 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized self-adjusting heaps
@@ Property / cites work: Parameterized self-adjusting heaps / rank @@
+Normal rank
@@ Property / cites work @@
+A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
@@ Property / cites work: A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY / rank @@
+Normal rank
@@ Property / cites work @@
+Pairing Heaps with Costless Meld
@@ Property / cites work: Pairing Heaps with Costless Meld / rank @@
+Normal rank
@@ Property / cites work @@
+The Violation Heap: A Relaxed Fibonacci-Like Heap
@@ Property / cites work: The Violation Heap: A Relaxed Fibonacci-Like Heap / rank @@
+Normal rank
@@ Property / cites work @@
+A priority queue with the time-finger property
@@ Property / cites work: A priority queue with the time-finger property / rank @@
+Normal rank
@@ Property / cites work @@
+Two new methods for constructing double-ended priority queues from priority queues
+Normal rank
@@ Property / cites work @@
+Two-tier relaxed heaps
@@ Property / cites work: Two-tier relaxed heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Optimal Priority Queues via Extended Regular Counters
+Normal rank
@@ Property / cites work @@
+Preserving order in a forest in less than logarithmic time and linear space
+Normal rank
@@ Property / cites work @@
+Design and implementation of an efficient priority queue
+Normal rank
@@ Property / cites work @@
+Heaps and heapsort on secondary storage
@@ Property / cites work: Heaps and heapsort on secondary storage / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of binomial queues
@@ Property / cites work: A generalization of binomial queues / rank @@
+Normal rank
@@ Property / cites work @@
+Fishspear: a priority queue algorithm
@@ Property / cites work: Fishspear: a priority queue algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A Tournament Problem
@@ Property / cites work: A Tournament Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit \(B\)-trees: A new data structure for the dictionary problem
+Normal rank
@@ Property / cites work @@
+Implicit dictionaries with <i>O</i>(1) modifications per update and fast search
+Normal rank
@@ Property / cites work @@
+Implicit Data Structures for the Dictionary Problem
+Normal rank
@@ Property / cites work @@
+Upper bounds for time-space trade-offs in sorting and selection
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for selection in a min-heap
@@ Property / cites work: An optimal algorithm for selection in a min-heap / rank @@
+Normal rank
@@ Property / cites work @@
+On the efficiency of pairing heaps and related data structures
+Normal rank
@@ Property / cites work @@
+The pairing heap: A new form of self-adjusting heap
+Normal rank
@@ Property / cites work @@
+Surpassing the information theoretic bound with fusion trees
+Normal rank
@@ Property / cites work @@
+Cache-Oblivious Algorithms
@@ Property / cites work: Cache-Oblivious Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Heaps on Heaps
@@ Property / cites work: Heaps on Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-Pairing Heaps
@@ Property / cites work: Rank-Pairing Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic sorting in             <i>O</i>             (             <i>n</i>             log log             <i>n</i>             ) time and linear space
+Normal rank
@@ Property / cites work @@
+Q2721966
@@ Property / cites work: Q2721966 / rank @@
+Normal rank
@@ Property / cites work @@
+Queaps
@@ Property / cites work: Queaps / rank @@
+Normal rank
@@ Property / cites work @@
+Priority queues with update and finding minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+Normal rank
@@ Property / cites work @@
+The derivation of a tighter bound for top-down skew heaps
+Normal rank
@@ Property / cites work @@
+Meldable heaps and boolean union-find
@@ Property / cites work: Meldable heaps and boolean union-find / rank @@
+Normal rank
@@ Property / cites work @@
+Thin heaps, thick heaps
@@ Property / cites work: Thin heaps, thick heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Irredundant intervals
@@ Property / cites work: Irredundant intervals / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Heaps
@@ Property / cites work: Interval Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Melding priority queues
@@ Property / cites work: Melding priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
+Normal rank
@@ Property / cites work @@
+Selection and sorting with limited storage
@@ Property / cites work: Selection and sorting with limited storage / rank @@
+Normal rank
@@ Property / cites work @@
+Q3673089
@@ Property / cites work: Q3673089 / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit data structures for fast search and update
+Normal rank
@@ Property / cites work @@
+An optimal minimum spanning tree algorithm
@@ Property / cites work: An optimal minimum spanning tree algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Priority queues: Small, monotone and trans-dichotomous
+Normal rank
@@ Property / cites work @@
+An algorithm for merging heaps
@@ Property / cites work: An algorithm for merging heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Fast priority queues for cached memory
@@ Property / cites work: Fast priority queues for cached memory / rank @@
+Normal rank
@@ Property / cites work @@
+A tight lower bound for top-down skew heaps
@@ Property / cites work: A tight lower bound for top-down skew heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Self-Adjusting Heaps
@@ Property / cites work: Self-Adjusting Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250223
@@ Property / cites work: Q4250223 / rank @@
+Normal rank
@@ Property / cites work @@
+On RAM Priority Queues
@@ Property / cites work: On RAM Priority Queues / rank @@
+Normal rank
@@ Property / cites work @@
+Integer priority queues with decrease key in constant time and the single source shortest paths problem
+Normal rank
@@ Property / cites work @@
+Equivalence between priority queues and sorting
@@ Property / cites work: Equivalence between priority queues and sorting / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for manipulating priority queues
@@ Property / cites work: A data structure for manipulating priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank