Entropy-bounded representation of point grids (Q390358): Difference between revisions

@@ Property / cites work @@
+Q4225298
@@ Property / cites work: Q4225298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508365
@@ Property / cites work: Q4508365 / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive Star-Tree Parallel Data Structure
@@ Property / cites work: Recursive Star-Tree Parallel Data Structure / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
+Normal rank
@@ Property / cites work @@
+Orthogonal range searching on the RAM, revisited
@@ Property / cites work: Orthogonal range searching on the RAM, revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417615
@@ Property / cites work: Q5417615 / rank @@
+Normal rank
@@ Property / cites work @@
+Filtering Search: A New Approach to Query-Answering
+Normal rank
@@ Property / cites work @@
+Lower bounds for orthogonal range searching: I. The reporting case
+Normal rank
@@ Property / cites work @@
+Entropy-Bounded Representation of Point Grids
@@ Property / cites work: Entropy-Bounded Representation of Point Grids / rank @@
+Normal rank
@@ Property / cites work @@
+Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
+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 @@
+Q4633874
@@ Property / cites work: Q4633874 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Size of Succinct Indices
@@ Property / cites work: On the Size of Succinct Indices / 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 @@
+On the Redundancy of Succinct Data Structures
@@ Property / cites work: On the Redundancy of Succinct Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471381
@@ Property / cites work: Q4471381 / rank @@
+Normal rank
@@ Property / cites work @@
+More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
+Normal rank
@@ Property / cites work @@
+Compressed data structures: Dictionaries and data-aware measures
+Normal rank
@@ Property / cites work @@
+Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
+Normal rank
@@ Property / cites work @@
+Space efficient dynamic orthogonal range reporting
+Normal rank
@@ Property / cites work @@
+Practical Entropy-Compressed Rank/Select Dictionary
+Normal rank
@@ Property / cites work @@
+Low Redundancy in Static Dictionaries with Constant Query Time
+Normal rank
@@ Property / cites work @@
+Q3549595
@@ Property / cites work: Q3549595 / rank @@
+Normal rank
@@ 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 @@
+Q5417611
@@ Property / cites work: Q5417611 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct indexable dictionaries with applications to encoding             <i>k</i>             -ary trees, prefix sums and multisets
+Normal rank
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank
@@ Property / cites work @@
+Q5417614
@@ Property / cites work: Q5417614 / rank @@
+Normal rank