Dynamic interpolation search in o(log log n) time (Q4630245): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-56939-1_58
+Normal rank
@@ Property / OpenAlex ID @@
+W1552004844
@@ Property / OpenAlex ID: W1552004844 / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit Data Structures for the Dictionary Problem
+Normal rank
@@ Property / cites work @@
+Q3686050
@@ Property / cites work: Q3686050 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic interpolation search
@@ Property / cites work: Dynamic interpolation search / rank @@
+Normal rank
@@ Property / cites work @@
+The design of dynamic data structures
@@ Property / cites work: The design of dynamic data structures / rank @@
+Normal rank
@@ Property / cites work @@
+A balanced search tree O(1) worst-case update time
+Normal rank
@@ Property / cites work @@
+Understanding the complexity of interpolation search
+Normal rank
@@ Property / cites work @@
+Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
+Normal rank