Pages that link to "Item:Q4828937"

The following pages link to Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets (Q4828937):

Displaying 50 items.

• Succinct dynamic cardinal trees (Q262263) (← links)
• Optimal encodings for range majority queries (Q270016) (← links)
• Fast construction of wavelet trees (Q294942) (← links)
• Less space: indexing for queries with wildcards (Q300263) (← links)
• Random access to Fibonacci encoded files (Q313776) (← links)
• Succinct posets (Q329288) (← links)
• Compact binary relation representations with rich functionality (Q386006) (← links)
• Compressed indexes for text with wildcards (Q390873) (← links)
• Colored range queries and document retrieval (Q390874) (← links)
• On compressing and indexing repetitive sequences (Q390894) (← links)
• Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
• New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
• Succinct representations of permutations and functions (Q441860) (← links)
• Succinct indexes for reporting discriminating and generic words (Q501011) (← links)
• Efficient dynamic range minimum query (Q507385) (← links)
• Combined data structure for previous- and next-smaller-values (Q533896) (← links)
• Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
• Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
• Finding range minima in the middle: approximations and applications (Q626956) (← links)
• Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
• Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
• Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
• A simple optimal representation for balanced parentheses (Q859854) (← links)
• A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
• Encoding 2D range maximum queries (Q897899) (← links)
• Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees (Q906406) (← links)
• Succinct data structures for flexible text retrieval systems (Q924538) (← links)
• Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
• On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
• Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
• Approximate string matching with compressed indexes (Q1662494) (← links)
• Practical compressed suffix trees (Q1736557) (← links)
• High-order entropy compressed bit vectors with rank/select (Q1736624) (← links)
• siEDM: an efficient string index and search algorithm for edit distance with moves (Q1736784) (← links)
• LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
• Indexing and querying character sets in one- and two-dimensional words (Q1791759) (← links)
• Dynamic path queries in linear space (Q1799220) (← links)
• New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
• Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100) (← links)
• Rank and select operations on a word (Q2234779) (← links)
• Accelerated partial decoding in wavelet trees (Q2295619) (← links)
• Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
• Bottom-\(k\) document retrieval (Q2343302) (← links)
• The myriad virtues of wavelet trees (Q2389347) (← links)
• A space efficient direct access data structure (Q2397148) (← links)
• Grammar compressed sequences with rank/select support (Q2397151) (← links)
• Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
• Compressed text indexing with wildcards (Q2434928) (← links)
• A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
• Wavelet trees for all (Q2442812) (← links)