Efficient Variants of Huffman Codes in High Level Languages. - Yaacov Choueka; Shmuel T. Klein; Yehoshua Perl (SIGIR, 1985)

Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. - Yaacov Choueka; Aviezri S. Fraenkel; Shmuel T. Klein; E. Segal (SIGIR, 1986)

Improved Techniques for Processing Queries in Full-Text Systems. - Yaacov Choueka; Aviezri S. Fraenkel; Shmuel T. Klein; E. Segal (SIGIR, 1987)

Compression of Concordances in Full-Text Retrieval Systems. - Yaacov Choueka; Aviezri S. Fraenkel; Shmuel T. Klein (SIGIR, 1988)

The number of fixed points of the majority rule. - Z. Agur; Aviezri S. Fraenkel; Shmuel T. Klein (Discret. Math., 1988)

Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. - Shmuel T. Klein; Abraham Bookstein; Scott C. Deerwester (ACM Trans. Inf. Syst., 1989)

Information Retrieval Tools for Literary Analysis. - Abraham Bookstein; Shmuel T. Klein (DEXA, 1990)

Construction of Optimal Graphs for Bit-Vector Compression. - Abraham Bookstein; Shmuel T. Klein (SIGIR, 1990)

Bidirectional Huffman Coding. - Aviezri S. Fraenkel; Shmuel T. Klein (Comput. J., 1990)

Using bitmaps for medium sized information retrieval systems. - Abraham Bookstein; Shmuel T. Klein (Inf. Process. Manag., 1990)

Compression, Information Theory, and Grammars: A Unified Approach. - Abraham Bookstein; Shmuel T. Klein (ACM Trans. Inf. Syst., 1990)

Flexible Compression for Bitmap Sets. - Abraham Bookstein; Shmuel T. Klein (Data Compression Conference, 1991)

The ARTFL data compression project. - Abraham Bookstein; Shmuel Tomi Klein; Donald A. Ziff (RIAO, 1991)

Compression of a Set of Correlated Bitmaps. - Abraham Bookstein; Shmuel T. Klein (SIGIR, 1991)

Compression of correlated bit-vectors. - Abraham Bookstein; Shmuel T. Klein (Inf. Syst., 1991)

Model Based Concordance Compression. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (Data Compression Conference, 1992)

Models of Bitmap Generation: A Systematic Approach to Bitmap Compression. - Abraham Bookstein; Shmuel T. Klein (Inf. Process. Manag., 1992)

A Systematic Approach to Compressing a Full-Text Retrieval System. - Abraham Bookstein; Shmuel T. Klein; Donald A. Ziff (Inf. Process. Manag., 1992)

Can Random Fluctuation Be Exploited in Data Compression. - Abraham Bookstein; Shmuel T. Klein; Timo Raita; I. K. Ravichandra Rao; M. D. Patil (Data Compression Conference, 1993)

Is Huffman Coding Dead? - Abraham Bookstein; Shmuel T. Klein; Timo Raita (SIGIR, 1993)

Bounding the Depth of Search Trees. - Aviezri S. Fraenkel; Shmuel T. Klein (Comput. J., 1993)

Is Huffman coding dead? - Abraham Bookstein; Shmuel Tomi Klein (Computing, 1993)

Markov Models for Clusters in Concordance Compression. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (Data Compression Conference, 1994)

Complexity Aspects of Guessing Prefix Codes. - Aviezri S. Fraenkel; Shmuel T. Klein (Algorithmica, 1994)

Improved Inverted File Processing for Large Text Databases. - Alistair Moffat; Justin Zobel; Shmuel T. Klein (Australasian Database Conference, 1995)

Detecting Content-Bearing Words by Serial Clustering. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (SIGIR, 1995)

Efficient Recompression Techniques for Dynamic Full-Text Retrieval Systems. - Shmuel T. Klein (SIGIR, 1995)

Robust Universal Complete Codes for Transmission and Compression. - Aviezri S. Fraenkel; Shmuel T. Klein (Discret. Appl. Math., 1996)

Space- and Time-Efficient Decoding with Canonical Huffman Trees. - Shmuel T. Klein (CPM, 1997)

Efficient Optimal Recompression. - Shmuel T. Klein (Comput. J., 1997)

An overhead reduction technique for mega-state compression schemes. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (Inf. Process. Manag., 1997)

Modeling Word Occurrences for the Compression of Concordances. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (ACM Trans. Inf. Syst., 1997)

Clumping Properties of Content-Bearing Words. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (J. Am. Soc. Inf. Sci., 1998)

Information Retrieval from Annotated Texts. - Aviezri S. Fraenkel; Shmuel T. Klein (J. Am. Soc. Inf. Sci., 1999)

Improving Static Compression Schemes by Alphabet Extension. - Shmuel T. Klein (CPM, 2000)

A New Compression Method for Compressed Matching. - Shmuel T. Klein; Dana Shapira (Data Compression Conference, 2000)

Parallel Huffman Decoding. - Shmuel Tomi Klein; Yair Wiseman (Data Compression Conference, 2000)

Simple Bayesian Model for Bitmap Compression. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (Inf. Retr., 2000)

Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts. - Shmuel T. Klein (Inf. Retr., 2000)

Fuzzy Hamming Distance: A New Dissimilarity Measure. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (CPM, 2001)

Searching in Compressed Dictionaries. - Shmuel T. Klein; Dana Shapira (DCC, 2002)

An Efficient Compression Scheme Supporting Partial Decoding. - Yair Kaufman; Shmuel T. Klein (DCC, 2003)

Parallel Huffman Decoding with Applications to JPEG Files. - Shmuel Tomi Klein; Yair Wiseman (Comput. J., 2003)

Searching for a Set of Correlated Patterns. - Shmuel T. Klein; B. Riva Shalom (SPIRE, 2004)

Fast Decoding of Prefix Encoded Texts. - Eyal Bergman; Shmuel T. Klein (DCC, 2005)

Parallel Lempel Ziv coding. - Shmuel Tomi Klein; Yair Wiseman (Discret. Appl. Math., 2005)

Semi-lossless text compression. - Yair Kaufman; Shmuel T. Klein (Int. J. Found. Comput. Sci., 2005)

Pattern matching in Huffman encoded texts. - Shmuel Tomi Klein; Dana Shapira (Inf. Process. Manag., 2005)

Compression of Multilingual Aligned Texts. - Ehud S. Conley; Shmuel Tomi Klein (DCC, 2006)

Working with compressed concordances. - Miri Ben-Nissan; Shmuel Tomi Klein (Stringology, 2006)

Compressed Pattern Matching in Jpeg Images. - Shmuel T. Klein; Dana Shapira (Int. J. Found. Comput. Sci., 2006)

Fast Decoding of Fibonacci Encoded Texts. - Shmuel T. Klein (DCC, 2007)

Compressed Delta Encoding for LZSS Encoded Files. - Shmuel T. Klein; Dana Shapira (DCC, 2007)

Searching for a set of correlated patterns. - Shmuel T. Klein; B. Riva Shalom; Yair Kaufman (J. Discrete Algorithms, 2007)

Using Fibonacci Compression Codes as Alternatives to Dense Codes. - Shmuel Tomi Klein; Miri Kopel Ben-Nissan (DCC, 2008)

Improved Variable-to-Fixed Length Codes. - Shmuel Tomi Klein; Dana Shapira (SPIRE, 2008)

Using Alignment for Multilingual Text Compression. - Ehud S. Conley; Shmuel T. Klein (Int. J. Found. Comput. Sci., 2008)

Modeling Delta Encoding of Compressed Files. - Shmuel T. Klein; Tamar C. Serebro; Dana Shapira (Int. J. Found. Comput. Sci., 2008)

Should one always use repeated squaring for modular exponentiation? - Shmuel T. Klein (Inf. Process. Lett., 2008)

Processing queries with metrical constraints in XML-based IR systems. - Shmuel T. Klein (J. Assoc. Inf. Sci. Technol., 2008)

Delta Encoding in a Compressed Domain. - Shmuel Tomi Klein; Moti Meir (Stringology, 2009)

On the Usefulness of Backspace. - Shmuel Tomi Klein; Dana Shapira (Stringology, 2009)

The design of a similarity based deduplication system. - Lior Aronovich; Ron Asher; Eitan Bachmat; Haim Bitner; Michael Hirsch 002; Shmuel T. Klein (SYSTOR, 2009)

On the use of negation in Boolean IR queries. - Shmuel T. Klein (Inf. Process. Manag., 2009)

Accelerating Boyer-Moore searches on binary texts. - Shmuel T. Klein; Miri Kopel Ben-Nissan (Theor. Comput. Sci., 2009)

On the Usefulness of Fibonacci Compression Codes. - Shmuel Tomi Klein; Miri Kopel Ben-Nissan (Comput. J., 2010)

Compressed Matching in Dictionaries. - Shmuel T. Klein; Dana Shapira (Algorithms, 2011)

On improving Tunstall codes. - Shmuel T. Klein; Dana Shapira (Inf. Process. Manag., 2011)

Huffman Coding with Non-Sorted Frequencies. - Shmuel T. Klein; Dana Shapira (Math. Comput. Sci., 2011)

The String-to-Dictionary Matching Problem. - Shmuel T. Klein; Dana Shapira (Comput. J., 2012)

Lossless Compression of Rotated Maskless Lithography Images. - Shmuel T. Klein; Dana Shapira; Gal Shelef (DCC, 2013)

On the connection between Hamming codes, Heapsort and other methods. - Shmuel T. Klein (Inf. Process. Lett., 2013)

Improved Alignment-Based Algorithm for Multilingual Text Compression. - Ehud S. Conley; Shmuel T. Klein (Math. Comput. Sci., 2013)

A New Approach to Alphabet Extension for Improving Static Compression Schemes. - Shmuel T. Klein (Language, Culture, Computation (1), 2014)

Boosting the Compression of Rewriting on Flash Memory. - Shmuel T. Klein; Dana Shapira (DCC, 2014)

Direct Processing of Compressed SIFT Feature Vectors. - Shmuel T. Klein; Dana Shapira (DCC, 2014)

Random Access to Fibonacci Codes. - Shmuel Tomi Klein; Dana Shapira (Stringology, 2014)

Metric Preserving Dense SIFT Compression. - Shmuel Tomi Klein; Dana Shapira (Stringology, 2014)

Improving deduplication techniques by accelerating remainder calculations. - Michael Hirsch 002; Shmuel T. Klein; Yair Toaff (Discret. Appl. Math., 2014)

Practical fixed length Lempel-Ziv coding. - Shmuel T. Klein; Dana Shapira (Discret. Appl. Math., 2014)

Layouts for improved hierarchical parallel computations. - Michael Hirsch 002; Shmuel Tomi Klein; Yair Toaff (J. Discrete Algorithms, 2014)

Enhanced Direct Access to Huffman Encoded Files. - Josh Herzberg; Shmuel T. Klein; Dana Shapira (DCC, 2015)

Identifying Pairs of Terms with Strong Semantic Connections in a Textbook Index. - James Geller; Shmuel T. Klein; Yuriy Polyakov (KEOD, 2015)

Controlling the Chunk-Size in Deduplication Systems. - Michael Hirsch 002; Shmuel Tomi Klein; Dana Shapira; Yair Toaff (Stringology, 2015)

Enhanced Extraction from Huffman Encoded Files. - Shmuel Tomi Klein; Dana Shapira (Stringology, 2015)

Basic Concepts in Data Structures - Shmuel Tomi Klein (Cambridge University Press, 2016)

Analysis of a Rewriting Compression System for Flash Memory. - Shmuel T. Klein; Dana Shapira (DCC, 2016)

The Use and Usefulness of Fibonacci Codes. - Shmuel Tomi Klein (Stringology, 2016)

Optimal partitioning of data chunks in deduplication systems. - Michael Hirsch 002; Ariel Ish-Shalom; Shmuel T. Klein (Discret. Appl. Math., 2016)

Similarity based deduplication with small data chunks. - Lior Aronovich; Ron Asher; Danny Harnik; Michael Hirsch 002; Shmuel T. Klein; Yair Toaff (Discret. Appl. Math., 2016)

Random access to Fibonacci encoded files. - Shmuel T. Klein; Dana Shapira (Discret. Appl. Math., 2016)

Compressed matching for feature vectors. - Shmuel T. Klein; Dana Shapira (Theor. Comput. Sci., 2016)

Optimal Skeleton Huffman Trees. - Shmuel T. Klein; Tamar C. Serebro; Dana Shapira (SPIRE, 2017)

Range Queries Using Huffman Wavelet Trees. - Gilad Baruch; Shmuel Tomi Klein; Dana Shapira (Stringology, 2017)

Hierarchical Parallel Evaluation of a Hamming Code. - Shmuel T. Klein; Dana Shapira (Algorithms, 2017)

A space efficient direct access data structure. - Gilad Baruch; Shmuel T. Klein; Dana Shapira (J. Discrete Algorithms, 2017)

Compressed Hierarchical Clustering. - Gilad Baruch; Dana Shapira; Shmuel T. Klein (DCC, 2018)

Fibonacci Based Compressed Suffix Array. - Shmuel T. Klein; Dana Shapira (DCC, 2018)

Applying Compression to Hierarchical Clustering. - Gilad Baruch; Shmuel Tomi Klein; Dana Shapira (SISAP, 2018)

Fibonacci Based Compressed Suffix Array. - Ekaterina Benza; Shmuel Tomi Klein; Dana Shapira (Stringology, 2018)

Better Than Optimal Huffman Coding? - Shmuel T. Klein; Shoham Saadia; Dana Shapira (DCC, 2019)

Measuring and Avoiding Information Loss During Concept Import from a Source to a Target Ontology. - James Geller; Shmuel T. Klein; Vipina Kuttichi Keloth (KEOD, 2019)

Bidirectional Adaptive Compression. - Aharon Fruchtman; Shmuel Tomi Klein; Dana Shapira (Stringology, 2019)

New Approaches for Context Sensitive Flash Codes. - Gilad Baruch; Shmuel T. Klein; Dana Shapira (CIAA, 2019)

Context Sensitive Rewriting Codes for Flash Memory†. - Shmuel T. Klein; Dana Shapira (Comput. J., 2019)

Weighted Adaptive Huffman Coding. - Aharon Fruchtman; Yoav Gross; Shmuel T. Klein; Dana Shapira (DCC, 2020)

Non-Binary Robust Universal Variable Length Codes. - Shmuel T. Klein; Tamar C. Serebro; Dana Shapira (DCC, 2020)

New Compression Schemes for Natural Number Sequences. - Sapir Asraf; Shmuel Tomi Klein; Dana Shapira (Stringology, 2020)

Weighted Adaptive Coding. - Aharon Fruchtman; Yoav Gross; Shmuel T. Klein; Dana Shapira (CoRR, 2020)

Accelerated partial decoding in wavelet trees. - Gilad Baruch; Shmuel T. Klein; Dana Shapira (Discret. Appl. Math., 2020)

Dynamic determination of variable sizes of chunks in a deduplication system. - Michael Hirsch 002; Shmuel T. Klein; Dana Shapira; Yair Toaff (Discret. Appl. Math., 2020)

On the Randomness of Compressed Data. - Shmuel T. Klein; Dana Shapira (Inf., 2020)

Basic Concepts in Algorithms - Shmuel Tomi Klein (WorldScientific, 2021)

Approximate Hashing for Bioinformatics. - Guy Arbitman; Shmuel T. Klein; Pierre Peterlongo; Dana Shapira (DCC, 2021)

Backward Weighted Coding. - Aharon Fruchtman; Yoav Gross; Shmuel T. Klein; Dana Shapira (DCC, 2021)

Smaller Compressed Suffix Arrays†. - Ekaterina Benza; Shmuel T. Klein; Dana Shapira (Comput. J., 2021)

Integrated encryption in dynamic arithmetic compression. - Shmuel T. Klein; Dana Shapira (Inf. Comput., 2021)

Forward Looking Huffman Coding. - Shmuel T. Klein; Shoham Saadia; Dana Shapira (Theory Comput. Syst., 2021)

Optimal skeleton and reduced Huffman trees. - Shmuel T. Klein; Jakub Radoszewski; Tamar C. Serebro; Dana Shapira (Theor. Comput. Sci., 2021)

A Huffman Code Based Crypto-System. - Yoav Gross; Shmuel T. Klein; Elina Opalinsky; Rivka Revivo; Dana Shapira (DCC, 2022)

Selective Weighted Adaptive Coding. - Yoav Gross; Shmuel T. Klein; Elina Opalinsky; Dana Shapira (DCC, 2022)

Generalization of Fibonacci Codes to the Non-Binary Case. - Shmuel T. Klein; Tamar C. Serebro; Dana Shapira (IEEE Access, 2022)

Enhanced Context Sensitive Flash Codes. - Gilad Baruch; Shmuel T. Klein; Dana Shapira (Comput. J., 2022)

Combining Forward Compression with PPM. - Rachel Mustakis Avrunin; Shmuel T. Klein; Dana Shapira (SN Comput. Sci., 2022)

Weighted forward looking adaptive coding. - Aharon Fruchtman; Yoav Gross; Shmuel T. Klein; Dana Shapira (Theor. Comput. Sci., 2022)

Turning Compression Schemes into Crypto-Systems. - Kfir Cohen; Yonatan Feigel; Shmuel Tomi Klein; Dana Shapira (PSC, 2023)

Enhanced Ternary Fibonacci Codes. - Shmuel T. Klein; Dana Shapira (CIAA, 2023)

New compression schemes for natural number sequences. - Sapir Asraf; Yoav Gross; Shmuel Tomi Klein; Rivka Revivo; Dana Shapira (Discret. Appl. Math., 2023)

Guided blocks WOM codes. - Gilad Baruch; Shmuel T. Klein; Dana Shapira (Inf. Process. Lett., 2023)

Bidirectional adaptive compression. - Aharon Fruchtman; Yoav Gross; Shmuel T. Klein; Dana Shapira (Discret. Appl. Math., 2023)

Weighted Burrows-Wheeler Compression. - Aharon Fruchtman; Yoav Gross; Shmuel T. Klein; Dana Shapira (SN Comput. Sci., 2023)

Denser High-Order Fibonacci Codes. - Shmuel T. Klein; Dana Shapira (DCC, 2024)

Word-Based Forward Coding. - Igor Zavadskyi; Shmuel T. Klein; Dana Shapira (DCC, 2024)

Selective dynamic compression. - Shmuel T. Klein; Elina Opalinsky; Dana Shapira (Discret. Appl. Math., 2024)

Synchronizing dynamic Huffman codes. - Shmuel T. Klein; Elina Opalinsky; Dana Shapira (Discret. Appl. Math., 2024)

Mixed $d$-Ary Fibonacci Codes. - Igor Zavadskyi; Shmuel T. Klein; Dana Shapira (DCC, 2025)

Dense non-binary Fibonacci codes. - Shmuel T. Klein; Dana Shapira (Acta Informatica, 2025)