Pages that link to "Item:Q4053461"

The following pages link to Universal codeword sets and representations of the integers (Q4053461):

Displaying 50 items.

• Compressed matching for feature vectors (Q294934) (← links)
• Random access to Fibonacci encoded files (Q313776) (← links)
• Fast decoding algorithms for variable-lengths codes (Q424795) (← links)
• Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
• Two-base numeration systems (Q466398) (← links)
• Online coloring of bipartite graphs with and without advice (Q486981) (← links)
• Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
• Is Huffmann coding dead? (Q685866) (← links)
• Better distance labeling for unweighted planar graphs (Q832885) (← links)
• Binary codes for locally homogeneous sequences (Q845715) (← links)
• Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
• Communication algorithms with advice (Q972382) (← links)
• Dynamic asymmetric communication (Q975489) (← links)
• Sorting streamed multisets (Q975507) (← links)
• Move-to-front, distance coding, and inversion frequencies revisited (Q982665) (← links)
• Long range variations on the Fibonacci universal code (Q983294) (← links)
• Orthogonal range searching in linear and almost-linear space (Q1005331) (← links)
• Labeling schemes for tree representation (Q1017912) (← links)
• The coding complexity of Lévy processes (Q1029213) (← links)
• Integer representation in the mixed base \((2,3)\) (Q1040415) (← links)
• The use and usefulness of numeration systems (Q1119959) (← links)
• An almost optimal algorithm for unbounded searching (Q1229581) (← links)
• Graph compression by BFS (Q1662490) (← links)
• Towards efficient positional inverted index (Q1662625) (← links)
• A lower bound on compression of unknown alphabets (Q1770393) (← links)
• Short encodings of planar graphs and maps (Q1805444) (← links)
• Optimal data compression algorithm (Q1816650) (← links)
• Robust universal complete codes for transmission and compression (Q1917238) (← links)
• On the advice complexity of the online dominating set problem (Q1998864) (← links)
• Space-efficient Huffman codes revisited (Q2094355) (← links)
• New compression schemes for natural number sequences (Q2112646) (← links)
• The space complexity of sum labelling (Q2140502) (← links)
• Grammar index by induced suffix sorting (Q2146128) (← links)
• Weighted forward looking adaptive coding (Q2166764) (← links)
• Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields (Q2190980) (← links)
• Lempel-Ziv-like parsing in small space (Q2205632) (← links)
• Generating \((2,3)\)-codes (Q2215868) (← links)
• Robust prefix encoding using lower \((2,3)\) number representation (Q2263249) (← links)
• The teaching size: computable teachers and learners for universal languages (Q2320594) (← links)
• DenseZDD: a compact and fast index for families of sets (Q2331660) (← links)
• Universal coding for memoryless sources with countably infinite alphabets (Q2352641) (← links)
• Online multi-coloring with advice (Q2355706) (← links)
• Faster average case low memory semi-external construction of the Burrows-Wheeler transform (Q2363991) (← links)
• The myriad virtues of wavelet trees (Q2389347) (← links)
• A space efficient direct access data structure (Q2397148) (← links)
• On the succinct representation of equivalence classes (Q2408100) (← links)
• A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
• Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
• Rank and select revisited and extended (Q2465064) (← links)
• Space efficient data structures for nearest larger neighbor (Q2634717) (← links)