A log log n data structure for three-sided range queries (Q1108025): Difference between revisions

@@ Property / author @@
-Kurt Mehlhorn
@@ Property / author: Kurt Mehlhorn / rank @@
-Normal rank
@@ Property / author @@
-Stefan Näher
@@ Property / author: Stefan Näher / rank @@
-Normal rank
@@ Property / author @@
-Athanasios K. Tsakalidis
@@ Property / author: Athanasios K. Tsakalidis / rank @@
-Normal rank
@@ Property / author @@
+Kurt Mehlhorn
@@ Property / author: Kurt Mehlhorn / rank @@
+Normal rank
@@ Property / author @@
+Stefan Näher
@@ Property / author: Stefan Näher / rank @@
+Normal rank
@@ Property / author @@
+Athanasios K. Tsakalidis
@@ Property / author: Athanasios K. Tsakalidis / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(87)90174-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2081589479
@@ Property / OpenAlex ID: W2081589479 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Q3219753
@@ Property / cites work: Q3219753 / rank @@
+Normal rank
@@ Property / cites work @@
+Priority Search Trees
@@ Property / cites work: Priority Search Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3332263
@@ Property / cites work: Q3332263 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank