On the difficulty of range searching (Q5057458): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-60220-8_86
+Normal rank
@@ Property / OpenAlex ID @@
+W1541859460
@@ Property / OpenAlex ID: W1541859460 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposable searching problems
@@ Property / cites work: Decomposable searching problems / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient worst-case data structures for range searching
+Normal rank
@@ Property / cites work @@
+A Functional Approach to Data Structures and Its Use in Multidimensional Searching
+Normal rank
@@ Property / cites work @@
+Lower bounds for orthogonal range searching: I. The reporting case
+Normal rank
@@ Property / cites work @@
+Lower bounds for orthogonal range searching: part II. The  arithmetic model
+Normal rank
@@ Property / cites work @@
+Priority Search Trees
@@ Property / cites work: Priority Search Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for union-split-find related problems on random access machines
+Normal rank
@@ Property / cites work @@
+Q4234056
@@ Property / cites work: Q4234056 / rank @@
+Normal rank