Optimal indexes for sparse bit vectors (Q472491): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-013-9767-2
@@ Property / DOI: 10.1007/s00453-013-9767-2 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+P05
@@ Property / Mathematics Subject Classification ID: 68P05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+P30
@@ Property / Mathematics Subject Classification ID: 68P30 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6371110
@@ Property / zbMATH DE Number: 6371110 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+succinct data structures
@@ Property / zbMATH Keywords: succinct data structures / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bit-vectors
@@ Property / zbMATH Keywords: bit-vectors / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+rank and select
@@ Property / zbMATH Keywords: rank and select / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+systematic encoding
@@ Property / zbMATH Keywords: systematic encoding / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+information-theoretic lower bound
@@ Property / zbMATH Keywords: information-theoretic lower bound / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+redundancy
@@ Property / zbMATH Keywords: redundancy / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1965268455
@@ Property / OpenAlex ID: W1965268455 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2157
@@ Property / arXiv ID: 1108.2157 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct indexes for strings, binary relations and multilabeled trees
+Normal rank
@@ Property / cites work @@
+Squeezing succinct data structures into entropy bounds
+Normal rank
@@ Property / cites work @@
+Engineering the LOUDS Succinct Tree Representation
+Normal rank
@@ Property / cites work @@
+Efficient Storage and Retrieval by Content and Address of Static Files
+Normal rank
@@ Property / cites work @@
+Compressing and indexing labeled trees, with applications
+Normal rank
@@ Property / cites work @@
+Indexing compressed text
@@ Property / cites work: Indexing compressed text / rank @@
+Normal rank
@@ Property / cites work @@
+A simple storage scheme for strings achieving entropy bounds
+Normal rank
@@ Property / cites work @@
+The cell probe complexity of succinct data structures
+Normal rank
@@ Property / cites work @@
+Succinct ordinal trees with level-ancestor queries
+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 @@
+On the Size of Succinct Indices
@@ Property / cites work: On the Size of Succinct Indices / rank @@
+Normal rank
@@ Property / cites work @@
+Statistical Encoding of Succinct Data Structures
@@ Property / cites work: Statistical Encoding of Succinct Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471381
@@ Property / cites work: Q4471381 / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
+Normal rank
@@ Property / cites work @@
+Compressed data structures: Dictionaries and data-aware measures
+Normal rank
@@ Property / cites work @@
+A cryptanalytic time-memory trade-off
@@ Property / cites work: A cryptanalytic time-memory trade-off / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921648
@@ Property / cites work: Q2921648 / rank @@
+Normal rank
@@ Property / cites work @@
+Practical Entropy-Compressed Rank/Select Dictionary
+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 / DOI @@
+.1007/S00453-013-9767-2
@@ Property / DOI: 10.1007/S00453-013-9767-2 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:472491