Predecessor on the Ultra-Wide Word RAM (Q6492089): Difference between revisions

@@ Property / cites work @@
+Time-space trade-offs for predecessor search
@@ Property / cites work: Time-space trade-offs for predecessor search / rank @@
+Normal rank
@@ Property / cites work @@
+Design and implementation of an efficient priority queue
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank
@@ Property / cites work @@
+Surpassing the information theoretic bound with fusion trees
+Normal rank
@@ Property / cites work @@
+Optimal bounds for the predecessor problem and related problems
+Normal rank
@@ Property / cites work @@
+Preserving order in a forest in less than logarithmic time and linear space
+Normal rank
@@ Property / cites work @@
+Q4633891
@@ Property / cites work: Q4633891 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for finding predecessors in Yao's cell probe model
+Normal rank
@@ Property / cites work @@
+Lower bounds for union-split-find related problems on random access machines
+Normal rank
@@ Property / cites work @@
+On data structures and asymmetric communication complexity
+Normal rank
@@ Property / cites work @@
+Lower bounds for predecessor searching in the cell probe model
+Normal rank
@@ Property / cites work @@
+Q2934638
@@ Property / cites work: Q2934638 / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting in linear time?
@@ Property / cites work: Sorting in linear time? / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic sorting in O(nloglogn) time and linear space
+Normal rank
@@ Property / cites work @@
+Q4527021
@@ Property / cites work: Q4527021 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
+Normal rank
@@ Property / cites work @@
+Time-space trade-offs for Lempel-Ziv compressed indexing
+Normal rank
@@ Property / cites work @@
+Deterministic Indexing for Packed Strings
@@ Property / cites work: Deterministic Indexing for Packed Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Random Access to Grammar-Compressed Strings and Trees
+Normal rank
@@ Property / cites work @@
+Algorithms in the Ultra-Wide Word Model
@@ Property / cites work: Algorithms in the Ultra-Wide Word Model / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Perfect Hashing: Upper and Lower Bounds
@@ Property / cites work: Dynamic Perfect Hashing: Upper and Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Partial sums on the ultra-wide word RAM
@@ Property / cites work: Partial sums on the ultra-wide word RAM / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743422
@@ Property / cites work: Q5743422 / rank @@
+Normal rank
@@ Property / cites work @@
+A Reliable Randomized Algorithm for the Closest-Pair Problem
+Normal rank
@@ Property / cites work @@
+Q4038677
@@ Property / cites work: Q4038677 / rank @@
+Normal rank