The cell probe complexity of succinct data structures (Q2373728): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2101403145
@@ Property / OpenAlex ID: W2101403145 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for finding predecessors in Yao's cell probe model
+Normal rank
@@ Property / cites work @@
+Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
+Normal rank
@@ Property / cites work @@
+Simple Constructions of Almost k-wise Independent Random Variables
+Normal rank
@@ Property / cites work @@
+Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
+Normal rank
@@ Property / cites work @@
+Optimal bounds for the predecessor problem and related problems
+Normal rank
@@ Property / cites work @@
+Membership in Constant Time and Almost-Minimum Space
+Normal rank
@@ Property / cites work @@
+Are bitvectors optimal?
@@ Property / cites work: Are bitvectors optimal? / rank @@
+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 @@
+A linear lower bound on index size for text retrieval
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Simple Retrieval Problems
@@ Property / cites work: The Complexity of Some Simple Retrieval Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection Theorems for Systems of Sets
@@ Property / cites work: Intersection Theorems for Systems of Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Q4449186
@@ Property / cites work: Q4449186 / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel search game
@@ Property / cites work: A parallel search game / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
+Normal rank
@@ Property / cites work @@
+Q4471381
@@ Property / cites work: Q4471381 / rank @@
+Normal rank
@@ Property / cites work @@
+List decoding from erasures: bounds and code constructions
+Normal rank
@@ Property / cites work @@
+Families of \(k\)-independent sets
@@ Property / cites work: Families of \(k\)-independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281568
@@ Property / cites work: Q4281568 / rank @@
+Normal rank
@@ Property / cites work @@
+On the cell probe complexity of polynomial evaluation
+Normal rank
@@ Property / cites work @@
+On data structures and asymmetric communication complexity
+Normal rank
@@ Property / cites work @@
+Q5595902
@@ Property / cites work: Q5595902 / rank @@
+Normal rank
@@ Property / cites work @@
+Small-Bias Probability Spaces: Efficient Constructions and Applications
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Products and Help Bits in Decision Trees
@@ Property / cites work: Products and Help Bits in Decision Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Low Redundancy in Static Dictionaries with Constant Query Time
+Normal rank
@@ Property / cites work @@
+Q4796182
@@ Property / cites work: Q4796182 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4778577
@@ Property / cites work: Q4778577 / rank @@
+Normal rank
@@ Property / cites work @@
+Vector sets for exhaustive testing of logic circuits
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2373728