Pages that link to "Item:Q5233491"

The following pages link to Practical Entropy-Compressed Rank/Select Dictionary (Q5233491):

Displaying 42 items.

• Optimal encodings for range majority queries (Q270016) (← links)
• Entropy-bounded representation of point grids (Q390358) (← links)
• Colored range queries and document retrieval (Q390874) (← links)
• New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
• Efficient fully-compressed sequence representations (Q472482) (← links)
• Optimal indexes for sparse bit vectors (Q472491) (← links)
• Efficient dynamic range minimum query (Q507385) (← links)
• Simple and efficient fully-functional succinct trees (Q507389) (← links)
• Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
• Compact and succinct data structures for multidimensional orthogonal range searching (Q776842) (← links)
• Practical compressed suffix trees (Q1736557) (← links)
• High-order entropy compressed bit vectors with rank/select (Q1736624) (← links)
• Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
• LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
• Approximate query processing over static sets and sliding windows (Q1981762) (← links)
• Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation (Q2003332) (← links)
• New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
• Faster compressed quadtrees (Q2084740) (← links)
• Optimal skeleton and reduced Huffman trees (Q2220839) (← links)
• Accelerated partial decoding in wavelet trees (Q2295619) (← links)
• DenseZDD: a compact and fast index for families of sets (Q2331660) (← links)
• Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
• Block graphs in practice (Q2363994) (← links)
• Range selection and predecessor queries in data aware space and time (Q2397147) (← links)
• A space efficient direct access data structure (Q2397148) (← links)
• Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
• Wavelet trees for all (Q2442812) (← links)
• Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
• Space efficient data structures for nearest larger neighbor (Q2634717) (← links)
• Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
• Locally Compressed Suffix Arrays (Q2828176) (← links)
• Fast Compressed Tries through Path Decompositions (Q2828185) (← links)
• General Document Retrieval in Compact Space (Q2828189) (← links)
• Better External Memory LCP Array Construction (Q4629538) (← links)
• Haplotype-aware graph indexes (Q5090328) (← links)
• (Q5091046) (← links)
• Efficient Compression and Indexing of Trajectories (Q5150923) (← links)
• Optimal Skeleton Huffman Trees (Q5150936) (← links)
• A Self-index on Block Trees (Q5150940) (← links)
• Practical Compact Indexes for Top-<i>k</i>Document Retrieval (Q5270942) (← links)
• Fast and compact planar embeddings (Q5918983) (← links)
• Efficient construction of the BWT for repetitive text using string compression (Q6077847) (← links)