Log-logarithmic worst-case range queries are possible in space theta(N) (Q1838333): Difference between revisions

@@ 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(83)90075-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2090021115
@@ Property / OpenAlex ID: W2090021115 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic and complexity analysis of interpolation search
+Normal rank
@@ Property / cites work @@
+A priority queue in which initialization and queue operations takeO(loglogD) time
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Interpolation search—a log log             <i>N</i>             search
@@ Property / cites work: Interpolation search—a log log <i>N</i> search / rank @@
+Normal rank
@@ Property / cites work @@
+Understanding the complexity of interpolation search
+Normal rank
@@ Property / cites work @@
+Preserving order in a forest in less than logarithmic time and linear space
+Normal rank
@@ Property / cites work @@
+Design and implementation of an efficient priority queue
+Normal rank
@@ Property / cites work @@
+New trie data structures which support very fast search operations
+Normal rank
@@ Property / cites work @@
+Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
+Normal rank