VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE (Q5249272): Difference between revisions

@@ Property / cites work @@
+Symmetric binary B-trees: Data structure and maintenance algorithms
+Normal rank
@@ Property / cites work @@
+Organization and maintenance of large ordered indexes
+Normal rank
@@ Property / cites work @@
+Amortization results for chromatic search trees, with an application to priority queues
+Normal rank
@@ Property / cites work @@
+Efficient rebalancing of chromatic search trees
@@ Property / cites work: Efficient rebalancing of chromatic search trees / rank @@
+Normal rank
@@ Property / cites work @@
+A new data structure for representing sorted lists
+Normal rank
@@ Property / cites work @@
+On-the-fly optimization of data structures
@@ Property / cites work: On-the-fly optimization of data structures / rank @@
+Normal rank
@@ Property / cites work @@
+A New Method for Concurrency in B-Trees
@@ Property / cites work: A New Method for Concurrency in B-Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized constant relaxed rebalancing using standard rotations
+Normal rank
@@ Property / cites work @@
+EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
+Normal rank
@@ Property / cites work @@
+Efficient locking for concurrent operations on B-trees
+Normal rank
@@ Property / cites work @@
+Chromatic binary search trees: A structure for concurrent rebalancing
+Normal rank
@@ Property / cites work @@
+Concurrent operations on \(B^ *\)-trees with overtaking
+Normal rank
@@ Property / cites work @@
+Q3358267
@@ Property / cites work: Q3358267 / rank @@
+Normal rank
@@ Property / cites work @@
+Amortized Computational Complexity
@@ Property / cites work: Amortized Computational Complexity / rank @@
+Normal rank