Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees (Q2428686): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-011-9489-2
@@ Property / DOI: 10.1007/s00453-011-9489-2 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-011-9489-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2103885358
@@ Property / OpenAlex ID: W2103885358 / rank @@
+Normal rank
@@ Property / cites work @@
+Static optimality and dynamic search-optimality in lists and trees
+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 @@
+Key-independent optimality
@@ Property / cites work: Key-independent optimality / rank @@
+Normal rank
@@ Property / cites work @@
+The cost of offline binary search tree algorithms and the complexity of the request sequence
+Normal rank
@@ Property / cites work @@
+Self-adjusting binary search trees
@@ Property / cites work: Self-adjusting binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Rotation Distance, Triangulations, and Hyperbolic Geometry
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Accessing Binary Search Trees with Rotations
+Normal rank
@@ Property / DOI @@
+.1007/S00453-011-9489-2
@@ Property / DOI: 10.1007/S00453-011-9489-2 / rank @@
+Normal rank