A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY (Q3421856): Difference between revisions

@@ Property / cites work @@
+Implementation and Analysis of Binomial Queue Algorithms
+Normal rank
@@ Property / cites work @@
+Weak-heap sort
@@ Property / cites work: Weak-heap sort / rank @@
+Normal rank
@@ Property / cites work @@
+The pairing heap: A new form of self-adjusting heap
+Normal rank
@@ Property / cites work @@
+The design of dynamic data structures
@@ Property / cites work: The design of dynamic data structures / 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 @@
+Amortized Computational Complexity
@@ Property / cites work: Amortized Computational Complexity / 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