The following pages link to Shmuel T. Klein (Q294932):
Displayed 50 items.
- Compressed matching for feature vectors (Q294934) (← links)
- Random access to Fibonacci encoded files (Q313776) (← links)
- Practical fixed length Lempel-Ziv coding (Q496549) (← links)
- (Q685865) (redirect page) (← links)
- Is Huffmann coding dead? (Q685866) (← links)
- Huffman coding with non-sorted frequencies (Q691643) (← links)
- Accelerating Boyer-Moore searches on binary texts (Q840783) (← links)
- Errata to: The number of fixed points of the majority rule (Q912100) (← links)
- Searching for a set of correlated patterns (Q924555) (← links)
- Should one always use repeated squaring for modular exponentiation? (Q963373) (← links)
- The number of fixed points of the majority rule (Q1112026) (← links)
- Complexity aspects of guessing prefix codes (Q1336967) (← links)
- Hierarchical parallel evaluation of a Hamming code (Q1662715) (← links)
- Compressed matching in dictionaries (Q1736479) (← links)
- Parallel Lempel Ziv coding (Q1764899) (← links)
- Robust universal complete codes for transmission and compression (Q1917238) (← links)
- Integrated encryption in dynamic arithmetic compression (Q2042727) (← links)
- Guided blocks WOM codes (Q2094383) (← links)
- New compression schemes for natural number sequences (Q2112646) (← links)
- Approximate hashing for bioinformatics (Q2117679) (← links)
- Weighted forward looking adaptive coding (Q2166764) (← links)
- New approaches for context sensitive flash codes (Q2177598) (← links)
- Optimal skeleton and reduced Huffman trees (Q2220839) (← links)
- Improved alignment-based algorithm for multilingual text compression (Q2254060) (← links)
- Accelerated partial decoding in wavelet trees (Q2295619) (← links)
- A space efficient direct access data structure (Q2397148) (← links)
- On the connection between Hamming codes, Heapsort and other methods (Q2444852) (← links)
- Pattern matching in Huffman encoded texts (Q2485022) (← links)
- Bidirectional adaptive compression (Q2689643) (← links)
- (Q2723952) (← links)
- Improved Alignment Based Algorithm for Multilingual Text Compression (Q3004583) (← links)
- Basic Concepts in Data Structures (Q3188063) (← links)
- COMPRESSED PATTERN MATCHING IN JPEG IMAGES (Q3421845) (← links)
- Accelerating Boyer Moore Searches on Binary Texts (Q3503901) (← links)
- USING ALIGNMENT FOR MULTILINGUAL TEXT COMPRESSION (Q3532142) (← links)
- MODELING DELTA ENCODING OF COMPRESSED FILES (Q3532145) (← links)
- (Q3971952) (← links)
- Parallel Huffman Decoding with Applications to JPEG Files (Q4474740) (← links)
- (Q4547734) (← links)
- (Q4552403) (← links)
- Bidirectional Huffman Coding (Q4591397) (← links)
- Bounding the Depth of Search Trees (Q4591398) (← links)
- Optimal Skeleton Huffman Trees (Q5150936) (← links)
- String Processing and Information Retrieval (Q5393982) (← links)
- A New Approach to Alphabet Extension for Improving Static Compression Schemes (Q5498746) (← links)
- SEMI-LOSSLESS TEXT COMPRESSION (Q5714665) (← links)
- Integrated Encryption in Dynamic Arithmetic Compression (Q5738993) (← links)
- Basic Concepts in Algorithms (Q5857685) (← links)
- Forward looking Huffman coding (Q5918359) (← links)
- Forward looking Huffman coding (Q5919685) (← links)