Shmuel Tomi Klein

According to our database1, Shmuel Tomi Klein
  • authored at least 119 papers between 1985 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
A space efficient direct access data structure.
J. Discrete Algorithms, 2017

Hierarchical Parallel Evaluation of a Hamming Code.
Algorithms, 2017

Range Queries Using Huffman Wavelet Trees.
Proceedings of the Prague Stringology Conference 2017, 2017

Optimal Skeleton Huffman Trees.
Proceedings of the String Processing and Information Retrieval, 2017

Integrated Encryption in Dynamic Arithmetic Compression.
Proceedings of the Language and Automata Theory and Applications, 2017

2016
Compressed matching for feature vectors.
Theor. Comput. Sci., 2016

Random access to Fibonacci encoded files.
Discrete Applied Mathematics, 2016

Similarity based deduplication with small data chunks.
Discrete Applied Mathematics, 2016

Optimal partitioning of data chunks in deduplication systems.
Discrete Applied Mathematics, 2016

The Use and Usefulness of Fibonacci Codes.
Proceedings of the Prague Stringology Conference 2016, 2016

Accelerated Partial Decoding in Wavelet Trees.
Proceedings of the Prague Stringology Conference 2016, 2016

Analysis of a Rewriting Compression System for Flash Memory.
Proceedings of the 2016 Data Compression Conference, 2016

A Space Efficient Direct Access Data Structure.
Proceedings of the 2016 Data Compression Conference, 2016

2015
Enhanced Extraction from Huffman Encoded Files.
Proceedings of the Prague Stringology Conference 2015, 2015

Controlling the Chunk-Size in Deduplication Systems.
Proceedings of the Prague Stringology Conference 2015, 2015

Identifying Pairs of Terms with Strong Semantic Connections in a Textbook Index.
Proceedings of the KEOD 2015, 2015

Enhanced Direct Access to Huffman Encoded Files.
Proceedings of the 2015 Data Compression Conference, 2015

2014
Layouts for improved hierarchical parallel computations.
J. Discrete Algorithms, 2014

Practical fixed length Lempel-Ziv coding.
Discrete Applied Mathematics, 2014

Improving deduplication techniques by accelerating remainder calculations.
Discrete Applied Mathematics, 2014

Metric Preserving Dense SIFT Compression.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Random Access to Fibonacci Codes.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Direct Processing of Compressed SIFT Feature Vectors.
Proceedings of the Data Compression Conference, 2014

Boosting the Compression of Rewriting on Flash Memory.
Proceedings of the Data Compression Conference, 2014

A New Approach to Alphabet Extension for Improving Static Compression Schemes.
Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

2013
Improved Alignment-Based Algorithm for Multilingual Text Compression.
Mathematics in Computer Science, 2013

On the connection between Hamming codes, Heapsort and other methods.
Inf. Process. Lett., 2013

Optimal Partitioning of Data Chunks in Deduplication Systems.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Lossless Compression of Rotated Maskless Lithography Images.
Proceedings of the String Processing and Information Retrieval, 2013

Lossless Compression of Rotated Maskless Lithography Images.
Proceedings of the 2013 Data Compression Conference, 2013

2012
The String-to-Dictionary Matching Problem.
Comput. J., 2012

Similarity Based Deduplication with Small Data Chunks.
Proceedings of the Prague Stringology Conference 2012, 2012

2011
Huffman Coding with Non-Sorted Frequencies.
Mathematics in Computer Science, 2011

On improving Tunstall codes.
Inf. Process. Manage., 2011

Compressed Matching in Dictionaries.
Algorithms, 2011

Improving Deduplication Techniques by Accelerating Remainder Calculations.
Proceedings of the Prague Stringology Conference 2011, 2011

Improved Alignment Based Algorithm for Multilingual Text Compression.
Proceedings of the Language and Automata Theory and Applications, 2011

The String-to-Dictionary Matching Problem.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010
On the Usefulness of Fibonacci Compression Codes.
Comput. J., 2010

Practical Fixed Length Lempel Ziv Coding.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

2009
Accelerating Boyer-Moore searches on binary texts.
Theor. Comput. Sci., 2009

On the use of negation in Boolean IR queries.
Inf. Process. Manage., 2009

The design of a similarity based deduplication system.
Proceedings of of SYSTOR 2009: The Israeli Experimental Systems Conference 2009, 2009

On the Usefulness of Backspace.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Delta Encoding in a Compressed Domain.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

2008
Processing queries with metrical constraints in XML-based IR systems.
JASIST, 2008

Should one always use repeated squaring for modular exponentiation?
Inf. Process. Lett., 2008

Modeling Delta Encoding of Compressed Files.
Int. J. Found. Comput. Sci., 2008

Using Alignment for Multilingual Text Compression.
Int. J. Found. Comput. Sci., 2008

Huffman Coding with Non-Sorted Frequencies.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Improved Variable-to-Fixed Length Codes.
Proceedings of the String Processing and Information Retrieval, 2008

Huffman Coding with Non-sorted Frequencies.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Using Fibonacci Compression Codes as Alternatives to Dense Codes.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

2007
Searching for a set of correlated patterns.
J. Discrete Algorithms, 2007

Accelerating Boyer Moore Searches on Binary Texts.
Proceedings of the Implementation and Application of Automata, 2007

Compressed Delta Encoding for LZSS Encoded Files.
Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

Fast Decoding of Fibonacci Encoded Texts.
Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

2006
Compressed Pattern Matching in Jpeg Images.
Int. J. Found. Comput. Sci., 2006

Modeling delta encoding of compressed files.
Proceedings of the Prague Stringology Conference, 2006

Using alignment for multilingual text compression.
Proceedings of the Prague Stringology Conference, 2006

Working with compressed concordances.
Proceedings of the Prague Stringology Conference, 2006

Modeling Delta Encoding of Compressed Files.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

Compression of Multilingual Aligned Texts.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005
Pattern matching in Huffman encoded texts.
Inf. Process. Manage., 2005

Semi-lossless text compression.
Int. J. Found. Comput. Sci., 2005

Parallel Lempel Ziv coding.
Discrete Applied Mathematics, 2005

Compressed pattern matching in JPEG images.
Proceedings of the Prague Stringology Conference, 2005

Compressed Pattern Matching in JPEG Images.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

Fast Decoding of Prefix Encoded Texts.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

2004
Semi-Lossless Text Compression.
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

Searching for a Set of Correlated Patterns.
Proceedings of the String Processing and Information Retrieval, 2004

Semi-Lossless Text Compression.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003
Parallel Huffman Decoding with Applications to JPEG Files.
Comput. J., 2003

An Efficient Compression Scheme Supporting Partial Decoding.
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002
Searching in Compressed Dictionaries.
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2001
Pattern Matching in Huffman Encoded Texts.
Proceedings of the Data Compression Conference, 2001

Parallel Lempel Ziv Coding.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

Fuzzy Hamming Distance: A New Dissimilarity Measure.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000
Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts.
Inf. Retr., 2000

Simple Bayesian Model for Bitmap Compression.
Inf. Retr., 2000

Parallel Huffman Decoding.
Proceedings of the Data Compression Conference, 2000

A New Compression Method for Compressed Matching.
Proceedings of the Data Compression Conference, 2000

Improving Static Compression Schemes by Alphabet Extension.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
Information Retrieval from Annotated Texts.
JASIS, 1999

1998
Clumping Properties of Content-Bearing Words.
JASIS, 1998

1997
Modeling Word Occurrences for the Compression of Concordances.
ACM Trans. Inf. Syst., 1997

An overhead reduction technique for mega-state compression schemes.
Inf. Process. Manage., 1997

Efficient Optimal Recompression.
Comput. J., 1997

An Overhead Reduction Technique For Mega-State Compression Schemes.
Proceedings of the 7th Data Compression Conference (DCC '97), 1997

Space- and Time-Efficient Decoding with Canonical Huffman Trees.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996
Robust Universal Complete Codes for Transmission and Compression.
Discrete Applied Mathematics, 1996

1995
Efficient Recompression Techniques for Dynamic Full-Text Retrieval Systems.
Proceedings of the SIGIR'95, 1995

Detecting Content-Bearing Words by Serial Clustering.
Proceedings of the SIGIR'95, 1995

Improved Inverted File Processing for Large Text Databases.
Proceedings of the Sixth Australasian Database Conference, 1995

1994
Complexity Aspects of Guessing Prefix Codes.
Algorithmica, 1994

Markov Models for Clusters in Concordance Compression.
Proceedings of the IEEE Data Compression Conference, 1994

1993
Is Huffman coding dead?
Computing, 1993

Bounding the Depth of Search Trees.
Comput. J., 1993

Is Huffman Coding Dead?
Proceedings of the 16th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval. Pittsburgh, PA, USA, June 27, 1993

Can Random Fluctuation Be Exploited in Data Compression.
Proceedings of the IEEE Data Compression Conference, 1993

1992
A Systematic Approach to Compressing a Full-Text Retrieval System.
Inf. Process. Manage., 1992

Models of Bitmap Generation: A Systematic Approach to Bitmap Compression.
Inf. Process. Manage., 1992

Model Based Concordance Compression.
Proceedings of the IEEE Data Compression Conference, 1992

1991
Compression of correlated bit-vectors.
Inf. Syst., 1991

Compression of a Set of Correlated Bitmaps.
Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Chicago, 1991

The ARTFL data compression project.
Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications) - RIAO 1991, 3rd International Conference, Universitad Autonoma de Barcelona, Spain, April 2, 1991

Flexible Compression for Bitmap Sets.
Proceedings of the IEEE Data Compression Conference, 1991

1990
Compression, Information Theory, and Grammars: A Unified Approach.
ACM Trans. Inf. Syst., 1990

Using bitmaps for medium sized information retrieval systems.
Inf. Process. Manage., 1990

Bidirectional Huffman Coding.
Comput. J., 1990

Construction of Optimal Graphs for Bit-Vector Compression.
Proceedings of the SIGIR'90, 1990

Information Retrieval Tools for Literary Analysis.
Proceedings of the International Conference on Database and Expert Systems Applications, 1990

1989
Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations.
ACM Trans. Inf. Syst., 1989

Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations.
Proceedings of the SIGIR'89, 1989

1988
The number of fixed points of the majority rule.
Discrete Mathematics, 1988

Compression of Concordances in Full-Text Retrieval Systems.
Proceedings of the SIGIR'88, 1988

1987
Improved Techniques for Processing Queries in Full-Text Systems.
Proceedings of the Tenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 1987

1986
Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems.
Proceedings of the SIGIR'86, 1986

1985
Efficient Variants of Huffman Codes in High Level Languages.
Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval, 1985


  Loading...