A priority queue with the time-finger property (Q1932364): Difference between revisions

@@ Property / cites work @@
+A unified access bound on comparison-based dynamic dictionaries
+Normal rank
@@ Property / cites work @@
+Q4425956
@@ Property / cites work: Q4425956 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
+Normal rank
@@ Property / cites work @@
+On the sequential access theorem and deque conjecture for splay trees
+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 @@
+A Unifying Property for Distribution-Sensitive Priority Queues
+Normal rank
@@ Property / cites work @@
+Worst-Case Optimal Priority Queues via Extended Regular Counters
+Normal rank
@@ Property / cites work @@
+The pairing heap: A new form of self-adjusting heap
+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 @@
+Meldable heaps and boolean union-find
@@ Property / cites work: Meldable heaps and boolean union-find / 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 @@
+Sequential access in splay trees takes linear time
+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 @@
+Self‐adjusting trees in practice for large text collections
+Normal rank