Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Shmuel Tomi Klein
Shmuel T. Klein
2010 – today
- 2012
[j35]Shmuel T. Klein, Dana Shapira: The String-to-Dictionary Matching Problem. Comput. J. 55(11): 1347-1356 (2012)- [c53]Lior Aronovich, Ron Asher, Danny Harnik, Michael Hirsch, Shmuel Tomi Klein, Yair Toaff: Similarity Based Deduplication with Small Data Chunks. Stringology 2012: 3-17
- 2011
- [j34]
- [j33]Shmuel T. Klein, Dana Shapira: On improving Tunstall codes. Inf. Process. Manage. 47(5): 777-785 (2011)
- [j32]Shmuel T. Klein, Dana Shapira: Huffman Coding with Non-Sorted Frequencies. Mathematics in Computer Science 5(2): 171-178 (2011)
- [c52]
- [c51]Ehud S. Conley, Shmuel Tomi Klein: Improved Alignment Based Algorithm for Multilingual Text Compression. LATA 2011: 238-249
- [c50]Michael Hirsch, Shmuel Tomi Klein, Yair Toaff: Improving Deduplication Techniques by Accelerating Remainder Calculations. Stringology 2011: 173-183
- 2010
- [j31]Shmuel Tomi Klein, Miri Kopel Ben-Nissan: On the Usefulness of Fibonacci Compression Codes. Comput. J. 53(6): 701-716 (2010)
- [c49]Shmuel Tomi Klein, Dana Shapira: Practical Fixed Length Lempel Ziv Coding. Stringology 2010: 116-126
2000 – 2009
- 2009
- [j30]Shmuel T. Klein: On the use of negation in Boolean IR queries. Inf. Process. Manage. 45(2): 298-311 (2009)
- [j29]Shmuel T. Klein, Miri Kopel Ben-Nissan: Accelerating Boyer-Moore searches on binary texts. Theor. Comput. Sci. 410(37): 3563-3571 (2009)
- [c48]
- [c47]
- [c46]Lior Aronovich, Ron Asher, Eitan Bachmat, Haim Bitner, Michael Hirsch, Shmuel T. Klein: The design of a similarity based deduplication system. SYSTOR 2009: 6
- 2008
- [j28]Ehud S. Conley, Shmuel T. Klein: Using Alignment for Multilingual Text Compression. Int. J. Found. Comput. Sci. 19(1): 89-101 (2008)
- [j27]Shmuel T. Klein, Tamar C. Serebro, Dana Shapira: Modeling Delta Encoding of Compressed Files. Int. J. Found. Comput. Sci. 19(1): 137-146 (2008)
- [j26]Shmuel T. Klein: Should one always use repeated squaring for modular exponentiation? Inf. Process. Lett. 106(6): 232-237 (2008)
- [j25]Shmuel T. Klein: Processing queries with metrical constraints in XML-based IR systems. JASIST 59(1): 86-97 (2008)
- [c45]Shmuel Tomi Klein, Miri Kopel Ben-Nissan: Using Fibonacci Compression Codes as Alternatives to Dense Codes. DCC 2008: 472-481
- [c44]
- [c43]
- [c42]Shmuel Tomi Klein, Dana Shapira: Huffman Coding with Non-Sorted Frequencies. Stringology 2008: 46-53
- 2007
- [j24]Shmuel T. Klein, B. Riva Shalom, Yair Kaufman: Searching for a set of correlated patterns. J. Discrete Algorithms 5(1): 149-161 (2007)
- [c41]
- [c40]
- [c39]Shmuel Tomi Klein, Miri Ben-Nissan: Accelerating Boyer Moore Searches on Binary Texts. CIAA 2007: 130-143
- 2006
- [j23]Shmuel T. Klein, Dana Shapira: Compressed Pattern Matching in Jpeg Images. Int. J. Found. Comput. Sci. 17(6): 1297-1306 (2006)
- [c38]
- [c37]Shmuel Tomi Klein, Tamar C. Serebro, Dana Shapira: Modeling Delta Encoding of Compressed Files. DCC 2006: 457
- [c36]Ehud S. Conley, Shmuel Tomi Klein: Using alignment for multilingual text compression. Stringology 2006: 151-161
- [c35]Shmuel Tomi Klein, Tamar C. Serebro, Dana Shapira: Modeling delta encoding of compressed files. Stringology 2006: 162-170
- [c34]
- 2005
- [j22]Shmuel Tomi Klein, Yair Wiseman: Parallel Lempel Ziv coding. Discrete Applied Mathematics 146(2): 180-191 (2005)
- [j21]Yair Kaufman, Shmuel T. Klein: Semi-lossless text compression. Int. J. Found. Comput. Sci. 16(6): 1167-1178 (2005)
- [j20]Shmuel Tomi Klein, Dana Shapira: Pattern matching in Huffman encoded texts. Inf. Process. Manage. 41(4): 829-841 (2005)
- [c33]
- [c32]
- [c31]Shmuel Tomi Klein, Dana Shapira: Compressed pattern matching in JPEG images. Stringology 2005: 125-134
- 2004
- [c30]Yair Kaufman, Shmuel T. Klein: Semi-Lossless Text Compression. Data Compression Conference 2004: 544
- [c29]
- [c28]
- 2003
- [j19]Shmuel Tomi Klein, Yair Wiseman: Parallel Huffman Decoding with Applications to JPEG Files. Comput. J. 46(5): 487-497 (2003)
- [c27]Yair Kaufman, Shmuel T. Klein: An Efficient Compression Scheme Supporting Partial Decoding. DCC 2003: 433
- 2002
- [c26]
- 2001
- [c25]
- [c24]Abraham Bookstein, Shmuel T. Klein, Timo Raita: Fuzzy Hamming Distance: A New Dissimilarity Measure. CPM 2001: 86-97
- [c23]Shmuel T. Klein, Dana Shapira: Pattern Matching in Huffman Encoded Texts. Data Compression Conference 2001: 449-458
- 2000
- [j18]Abraham Bookstein, Shmuel T. Klein, Timo Raita: Simple Bayesian Model for Bitmap Compression. Inf. Retr. 1(4): 315-328 (2000)
- [j17]Shmuel T. Klein: Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts. Inf. Retr. 3(1): 7-23 (2000)
- [c22]
- [c21]Shmuel Tomi Klein, Yair Wiseman: Parallel Huffman Decoding. Data Compression Conference 2000: 383-392
- [c20]Shmuel T. Klein, Dana Shapira: A New Compression Method for Compressed Matching. Data Compression Conference 2000: 400-409
1990 – 1999
- 1999
- [j16]Aviezri S. Fraenkel, Shmuel T. Klein: Information Retrieval from Annotated Texts. JASIS 50(10): 845-854 (1999)
- 1998
- [j15]Abraham Bookstein, Shmuel T. Klein, Timo Raita: Clumping Properties of Content-Bearing Words. JASIS 49(2): 102-114 (1998)
- 1997
- [j14]
- [j13]Abraham Bookstein, Shmuel T. Klein, Timo Raita: An overhead reduction technique for mega-state compression schemes. Inf. Process. Manage. 33(6): 745-760 (1997)
- [j12]Abraham Bookstein, Shmuel T. Klein, Timo Raita: Modeling Word Occurrences for the Compression of Concordances. ACM Trans. Inf. Syst. 15(3): 254-290 (1997)
- [c19]
- [c18]Abraham Bookstein, Shmuel T. Klein, Timo Raita: An Overhead Reduction Technique For Mega-State Compression Schemes. Data Compression Conference 1997: 367-376
- 1996
- [j11]Aviezri S. Fraenkel, Shmuel T. Klein: Robust Universal Complete Codes for Transmission and Compression. Discrete Applied Mathematics 64(1): 31-55 (1996)
- 1995
- [c17]Alistair Moffat, Justin Zobel, Shmuel T. Klein: Improved Inverted File Processing for Large Text Databases. Australasian Database Conference 1995: 0-
- [c16]Shmuel T. Klein: Efficient Recompression Techniques for Dynamic Full-Text Retrieval Systems. SIGIR 1995: 39-47
- [c15]Abraham Bookstein, Shmuel T. Klein, Timo Raita: Detecting Content-Bearing Words by Serial Clustering. SIGIR 1995: 319-327
- 1994
- [j10]Aviezri S. Fraenkel, Shmuel T. Klein: Complexity Aspects of Guessing Prefix Codes. Algorithmica 12(4/5): 409-419 (1994)
- [c14]Abraham Bookstein, Shmuel T. Klein, Timo Raita: Markov Models for Clusters in Concordance Compression. Data Compression Conference 1994: 116-125
- 1993
- [j9]Aviezri S. Fraenkel, Shmuel T. Klein: Bounding the Depth of Search Trees. Comput. J. 36(7): 668-678 (1993)
- [c13]Abraham Bookstein, Shmuel T. Klein, Timo Raita, I. K. Ravichandra Rao, M. D. Patil: Can Random Fluctuation Be Exploited in Data Compression. Data Compression Conference 1993: 70-78
- [c12]
- 1992
- [j8]Abraham Bookstein, Shmuel T. Klein: Models of Bitmap Generation: A Systematic Approach to Bitmap Compression. Inf. Process. Manage. 28(6): 735-748 (1992)
- [j7]Abraham Bookstein, Shmuel T. Klein, Donald A. Ziff: A Systematic Approach to Compressing a Full-Text Retrieval System. Inf. Process. Manage. 28(6): 795-806 (1992)
- [c11]Abraham Bookstein, Shmuel T. Klein, Timo Raita: Model Based Concordance Compression. Data Compression Conference 1992: 82-91
- 1991
- [j6]Abraham Bookstein, Shmuel T. Klein: Compression of correlated bit-vectors. Inf. Syst. 16(4): 387-400 (1991)
- [c10]Abraham Bookstein, Shmuel T. Klein: Flexible Compression for Bitmap Sets. Data Compression Conference 1991: 402-410
- [c9]Abraham Bookstein, Shmuel Tomi Klein, Donald A. Ziff: The ARTFL data compression project. RIAO 1991: 967-986
- [c8]
- 1990
- [j5]Aviezri S. Fraenkel, Shmuel T. Klein: Bidirectional Huffman Coding. Comput. J. 33(4): 296-307 (1990)
- [j4]Abraham Bookstein, Shmuel T. Klein: Using bitmaps for medium sized information retrieval systems. Inf. Process. Manage. 26(4): 525-533 (1990)
- [j3]Abraham Bookstein, Shmuel T. Klein: Compression, Information Theory, and Grammars: A Unified Approach. ACM Trans. Inf. Syst. 8(1): 27-49 (1990)
- [c7]Abraham Bookstein, Shmuel T. Klein: Information Retrieval Tools for Literary Analysis. DEXA 1990: 1-7
- [c6]Abraham Bookstein, Shmuel T. Klein: Construction of Optimal Graphs for Bit-Vector Compression. SIGIR 1990: 327-342
1980 – 1989
- 1989
- [j2]Shmuel T. Klein, Abraham Bookstein, Scott C. Deerwester: Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. ACM Trans. Inf. Syst. 7(3): 230-245 (1989)
- [c5]Shmuel T. Klein, Abraham Bookstein, Scott C. Deerwester: Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. SIGIR 1989: 160-167
- 1988
- [j1]Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein: The number of fixed points of the majority rule. Discrete Mathematics 70(3): 295-302 (1988)
- [c4]Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein: Compression of Concordances in Full-Text Retrieval Systems. SIGIR 1988: 597-612
- 1987
- [c3]Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal: Improved Techniques for Processing Queries in Full-Text Systems. SIGIR 1987: 306-315
- 1986
- [c2]Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal: Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. SIGIR 1986: 88-96
- 1985
- [c1]Yaacov Choueka, Shmuel T. Klein, Yehoshua Perl: Efficient Variants of Huffman Codes in High Level Languages. SIGIR 1985: 122-130
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-11 03:37 CEST by the dblp team