A data structure for dynamic range queries (Q1838844): Difference between revisions

@@ Property / OpenAlex ID @@
+W2068870365
@@ Property / OpenAlex ID: W2068870365 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposable searching problems
@@ Property / cites work: Decomposable searching problems / rank @@
+Normal rank
@@ Property / cites work @@
+Multidimensional divide-and-conquer
@@ Property / cites work: Multidimensional divide-and-conquer / rank @@
+Normal rank
@@ Property / cites work @@
+A Lower Bound on the Complexity of Orthogonal Range Queries
+Normal rank
@@ Property / cites work @@
+Quintary trees
@@ Property / cites work: Quintary trees / rank @@
+Normal rank
@@ Property / cites work @@
+Binary Search Trees of Bounded Balance
@@ Property / cites work: Binary Search Trees of Bounded Balance / rank @@
+Normal rank
@@ Property / cites work @@
+New Data Structures for Orthogonal Range Queries
@@ Property / cites work: New Data Structures for Orthogonal Range Queries / rank @@
+Normal rank
@@ Property / cites work @@
+Adding range restriction capability to dynamic data structures
+Normal rank