Semi-group range sum revisited: query-space lower bound tightened (Q1751095): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-017-0307-3
@@ Property / DOI: 10.1007/s00453-017-0307-3 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-017-0307-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2605208448
@@ Property / OpenAlex ID: W2605208448 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for halfspace range searching
@@ Property / cites work: Tight lower bounds for halfspace range searching / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal partition trees
@@ Property / cites work: Optimal partition trees / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for orthogonal range searching: part II. The  arithmetic model
+Normal rank
@@ Property / cites work @@
+A Lower Bound on the Complexity of Orthogonal Range Queries
+Normal rank
@@ Property / cites work @@
+Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums
+Normal rank
@@ Property / cites work @@
+On Range Searching in the Group Model and Combinatorial Discrepancy
+Normal rank
@@ Property / cites work @@
+The cell probe complexity of dynamic range counting
+Normal rank
@@ Property / cites work @@
+Range searching with efficient hierarchical cuttings
+Normal rank
@@ Property / cites work @@
+Q3549595
@@ Property / cites work: Q3549595 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-017-0307-3
@@ Property / DOI: 10.1007/S00453-017-0307-3 / rank @@
+Normal rank