Optimal purely functional priority queues (Q4339017): Difference between revisions

@@ Property / cites work @@
+Making data structures persistent
@@ Property / cites work: Making data structures persistent / rank @@
+Normal rank
@@ Property / cites work @@
+Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
+Normal rank
@@ Property / cites work @@
+Confluently Persistent Deques via Data-Structural Bootstrapping
+Normal rank
@@ Property / cites work @@
+Implementation and Analysis of Binomial Queue Algorithms
+Normal rank
@@ Property / cites work @@
+An applicative random-access stack
@@ Property / cites work: An applicative random-access stack / rank @@
+Normal rank
@@ Property / cites work @@
+The derivation of a tighter bound for top-down skew heaps
+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 Heaps
@@ Property / cites work: Self-Adjusting 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 @@
+The pairing heap: A new form of self-adjusting heap
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1017/s095679680000201x
+Normal rank
@@ Property / OpenAlex ID @@
+W2136598300
@@ Property / OpenAlex ID: W2136598300 / rank @@
+Normal rank