A Survey of Data Structures in the Bitprobe Model (Q2848981): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-40273-9_19
+Normal rank
@@ Property / OpenAlex ID @@
+W152712179
@@ Property / OpenAlex ID: W152712179 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial match retrieval in implicit data structures
+Normal rank
@@ Property / cites work @@
+Space/time trade-offs in hash coding with allowable errors
+Normal rank
@@ Property / cites work @@
+A tradeoff between search and update time for the implicit dictionary problem
+Normal rank
@@ Property / cites work @@
+Improved Methods For Generating Quasi-gray Codes
@@ Property / cites work: Improved Methods For Generating Quasi-gray Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Representations towards Efficient Counting in the Bit Probe Model
+Normal rank
@@ Property / cites work @@
+Improved bounds for dictionary look-up with one error
+Normal rank
@@ Property / cites work @@
+Network Applications of Bloom Filters: A Survey
@@ Property / cites work: Network Applications of Bloom Filters: A Survey / rank @@
+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 linear lower bound on index size for text retrieval
+Normal rank
@@ Property / cites work @@
+Changing base without losing space
@@ Property / cites work: Changing base without losing space / rank @@
+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 @@
+Two skew-binary numeral systems and one application
+Normal rank
@@ Property / cites work @@
+Dynamic word problems
@@ Property / cites work: Dynamic word problems / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+The Complexity of Maintaining an Array and Computing Its Partial Sums
+Normal rank
@@ Property / cites work @@
+The cell probe complexity of succinct data structures
+Normal rank
@@ Property / cites work @@
+Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
+Normal rank
@@ Property / cites work @@
+Optimal lower bounds for rank and select indexes
@@ Property / cites work: Optimal lower bounds for rank and select indexes / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal indexes for sparse bit vectors
@@ Property / cites work: Optimal indexes for sparse bit vectors / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4681162
@@ Property / cites work: Q4681162 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Explicit Data Structures in the Bitprobe Model
+Normal rank
@@ Property / cites work @@
+Q4281568
@@ Property / cites work: Q4281568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5595902
@@ Property / cites work: Q5595902 / rank @@
+Normal rank
@@ Property / cites work @@
+On dynamic range reporting in one dimension
@@ Property / cites work: On dynamic range reporting in one dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness vs randomness
@@ Property / cites work: Hardness vs randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Purely Functional Data Structures
@@ Property / cites work: Purely Functional Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921747
@@ Property / cites work: Q2921747 / rank @@
+Normal rank
@@ Property / cites work @@
+Low Redundancy in Static Dictionaries with Constant Query Time
+Normal rank
@@ Property / cites work @@
+On the cell probe complexity of membership and perfect hashing
+Normal rank
@@ Property / cites work @@
+On dynamic bit-probe complexity
@@ Property / cites work: On dynamic bit-probe complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796182
@@ Property / cites work: Q4796182 / rank @@
+Normal rank
@@ Property / cites work @@
+Data Structures for Storing Small Sets in the Bitprobe Model
+Normal rank
@@ Property / cites work @@
+Integer representation and counting in the bit probe model
+Normal rank
@@ Property / cites work @@
+Q4778577
@@ Property / cites work: Q4778577 / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey of Combinatorial Gray Codes
@@ Property / cites work: A Survey of Combinatorial Gray Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Storing information with extractors.
@@ Property / cites work: Storing information with extractors. / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic methods to find primes
@@ Property / cites work: Deterministic methods to find primes / rank @@
+Normal rank
@@ Property / cites work @@
+Bit-Probe Lower Bounds for Succinct Data Structures
+Normal rank
@@ Property / cites work @@
+A data structure for manipulating priority queues
@@ Property / cites work: A data structure for manipulating priority queues / rank @@
+Normal rank
@@ Property / cites work @@
+Should Tables Be Sorted?
@@ Property / cites work: Should Tables Be Sorted? / rank @@
+Normal rank
@@ Property / cites work @@
+Dictionary Look-Up with One Error
@@ Property / cites work: Dictionary Look-Up with One Error / rank @@
+Normal rank