Pages that link to "Item:Q2465065"
From MaRDI portal
The following pages link to Optimal lower bounds for rank and select indexes (Q2465065):
Displaying 26 items.
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- On space efficient two dimensional range minimum data structures (Q692632) (← links)
- Selection from read-only memory with limited workspace (Q744087) (← links)
- Wee LCP (Q991794) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster (Q2300733) (← links)
- Succinct indices for path minimum, with applications (Q2362355) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Rank and select revisited and extended (Q2465064) (← links)
- From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures (Q2848970) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Array Range Queries (Q2848983) (← links)
- An Opportunistic Text Indexing Structure Based on Run Length Encoding (Q2947038) (← links)
- Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Succinct Representations of Arbitrary Graphs (Q3541102) (← links)
