Optimal bounds for the predecessor problem and related problems (Q1869935): Difference between revisions

@@ Property / Wikidata QID @@
+Q55889025
@@ Property / Wikidata QID: Q55889025 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1986633843
@@ Property / OpenAlex ID: W1986633843 / rank @@
+Normal rank
@@ Property / cites work @@
+Hash functions for priority queues
@@ Property / cites work: Hash functions for priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for finding predecessors in Yao's cell probe model
+Normal rank
@@ Property / cites work @@
+Optimal static range reporting in one dimension
@@ Property / cites work: Optimal static range reporting in one dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient regular data structures and algorithms for dilation, location, and proximity problems
+Normal rank
@@ Property / cites work @@
+Q4252751
@@ Property / cites work: Q4252751 / rank @@
+Normal rank
@@ Property / cites work @@
+Fusion trees can be implemented with \(AC^0\) instructions only
+Normal rank
@@ Property / cites work @@
+Tight(er) worst-case bounds on dynamic searching and priority queues
+Normal rank
@@ Property / cites work @@
+Predecessor queries in dynamic integer sets
@@ Property / cites work: Predecessor queries in dynamic integer sets / rank @@
+Normal rank
@@ Property / cites work @@
+Trans-dichotomous algorithms without multiplication — some upper and lower bounds
+Normal rank
@@ Property / cites work @@
+Universal classes of hash functions
@@ Property / cites work: Universal classes of hash functions / rank @@
+Normal rank
@@ Property / cites work @@
+Toward Optimal ϵ-Approximate Nearest Neighbor Algorithms
+Normal rank
@@ Property / cites work @@
+A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
+Normal rank
@@ Property / cites work @@
+Q4938782
@@ Property / cites work: Q4938782 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4515159
@@ Property / cites work: Q4515159 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3826580
@@ Property / cites work: Q3826580 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial hash functions are reliable
@@ Property / cites work: Polynomial hash functions are reliable / rank @@
+Normal rank
@@ Property / cites work @@
+A Reliable Randomized Algorithm for the Closest-Pair Problem
+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 @@
+Q4038677
@@ Property / cites work: Q4038677 / rank @@
+Normal rank
@@ Property / cites work @@
+Tables should be sorted (on random access machines)
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Surpassing the information theoretic bound with fusion trees
+Normal rank
@@ Property / cites work @@
+STACS 98. 15th annual symposium on theoretical aspects of computer science. Paris, France, February 25--27, 1998. Proceedings
+Normal rank
@@ Property / cites work @@
+Q4837112
@@ Property / cites work: Q4837112 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone Circuits for Connectivity Require Super-Logarithmic Depth
+Normal rank
@@ Property / cites work @@
+Dynamic fractional cascading
@@ Property / cites work: Dynamic fractional cascading / rank @@
+Normal rank
@@ Property / cites work @@
+A Lower Bound on the Complexity of the Union-Split-Find Problem
+Normal rank
@@ Property / cites work @@
+Q4281568
@@ Property / cites work: Q4281568 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for union-split-find related problems on random access machines
+Normal rank
@@ Property / cites work @@
+Q4250224
@@ Property / cites work: Q4250224 / rank @@
+Normal rank
@@ Property / cites work @@
+On data structures and asymmetric communication complexity
+Normal rank
@@ Property / cites work @@
+Q4952655
@@ Property / cites work: Q4952655 / rank @@
+Normal rank
@@ Property / cites work @@
+Understanding the complexity of interpolation search
+Normal rank
@@ Property / cites work @@
+Priority queues: Small, monotone and trans-dichotomous
+Normal rank
@@ Property / cites work @@
+Q4250223
@@ Property / cites work: Q4250223 / rank @@
+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 @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank
@@ Property / cites work @@
+Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
+Normal rank
@@ Property / cites work @@
+Should Tables Be Sorted?
@@ Property / cites work: Should Tables Be Sorted? / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jcss/BeameF02
@@ Property / DBLP publication ID: journals/jcss/BeameF02 / rank @@
+Normal rank