Pages that link to "Item:Q2465064"
From MaRDI portal
The following pages link to Rank and select revisited and extended (Q2465064):
Displaying 43 items.
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics (Q418161) (← links)
- Improved algorithms for the range next value problem and applications (Q428870) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Efficient dynamic range minimum query (Q507385) (← links)
- Substring range reporting (Q517792) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Improved data structures for the orthogonal range successor problem (Q617543) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- Improved parallel construction of wavelet trees and rank/select structures (Q776833) (← links)
- Compact and succinct data structures for multidimensional orthogonal range searching (Q776842) (← links)
- Dynamic extended suffix arrays (Q972366) (← links)
- On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Window queries for intersecting objects, maximal points and approximations using coresets (Q2235286) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Array Range Queries (Q2848983) (← links)
- Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Self-indexing Based on LZ77 (Q3011842) (← links)
- Counting Colours in Compressed Strings (Q3011854) (← links)
- On Wavelet Tree Construction (Q3011855) (← links)
- Substring Range Reporting (Q3011863) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (Q3183444) (← links)
- (Q5088915) (← links)
- Practical Wavelet Tree Construction (Q5102058) (← links)
- Efficient Data Structures for the Orthogonal Range Successor Problem (Q5323054) (← links)
- (Q5743458) (← links)
- (Q5874525) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- Parallel external memory wavelet tree and wavelet matrix construction (Q6536268) (← links)
