| Systems and methods for efficient data searching, storage and reduction M Hirsch, H Bitner, L Aronovich, R Asher, E Bachmat, ST Klein US Patent 7,523,098, 2009 | 306 | 2009 |
| The design of a similarity based deduplication system L Aronovich, R Asher, E Bachmat, H Bitner, M Hirsch, ST Klein Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference, 1-14, 2009 | 176 | 2009 |
| Automatic retrieval of frequent idiomatic and collocational expressions in a large corpus Y Choueka Journal of Literary and Linguistic Computing 4, 34-38, 1983 | 164 | 1983 |
| Parallel Huffman decoding with applications to JPEG files ST Klein, Y Wiseman The Computer Journal 46 (5), 487-497, 2003 | 159 | 2003 |
| Robust universal complete codes for transmission and compression AS Fraenkel, ST Kleinb Discrete Applied Mathematics 64 (1), 31-55, 1996 | 147 | 1996 |
| Systems and methods for searching of storage data with reduced bandwidth requirements M Hirsch, H Bitner, L Aronovich, R Asher, E Bachmat, ST Klein US Patent 8,725,705, 2014 | 134 | 2014 |
| System and method for dynamic content dependent conflict resolution S Hepper, L Merk, T Klein, H Waterstrat US Patent App. 10/232,250, 2003 | 114 | 2003 |
| Compression of correlated bit-vectors A Bookstein, ST Klein Information Systems 16 (4), 387-400, 1991 | 108 | 1991 |
| Storing text retrieval systems on CD-ROM: compression and encryption considerations ST Klein, A Bookstein, S Deerwester ACM Transactions on Information Systems (TOIS) 7 (3), 230-245, 1989 | 97 | 1989 |
| Is Huffman coding dead? A Bookstein, ST Klein, T Raita Proceedings of the 16th annual international ACM SIGIR conference on …, 1993 | 94 | 1993 |
| Novel compression of sparse bit-strings—Preliminary report AS Fraenkel, ST Klein Combinatorial algorithms on words, 169-183, 1985 | 94 | 1985 |
| Clumping properties of content‐bearing words A Bookstein, ST Klein, T Raita Journal of the American Society for Information Science 49 (2), 102-114, 1998 | 89 | 1998 |
| On the usefulness of Fibonacci compression codes ST Klein, MK Ben-Nissan The Computer Journal 53 (6), 701-716, 2010 | 80 | 2010 |
| Bidirectional huffman coding AS Fraenkel, ST Klein The Computer Journal 33 (4), 296-307, 1990 | 78 | 1990 |
| Parallel lempel ziv coding ST Klein, Y Wiseman Discrete Applied Mathematics 146 (2), 180-191, 2005 | 69 | 2005 |
| The number of fixed points of the majority rule Z Agur, AS Fraenkel, ST Klein Discrete Mathematics 70 (3), 295-302, 1988 | 61 | 1988 |
| Improved hierarchical bit-vector compression in document retrieval systems AS Fraenkel, ST Klein, Y Choueka, E Segal Proceedings of the 9th annual international ACM SIGIR conference on Research …, 1986 | 61 | 1986 |
| Efficient variants of Huffman codes in high level languages Y Choueka, ST Klein, Y Perl Proceedings of the 8th annual international ACM SIGIR conference on research …, 1985 | 54 | 1985 |
| Skeleton trees for the efficient decoding of Huffman encoded texts ST Klein Information Retrieval 3, 7-23, 2000 | 48 | 2000 |
| Detecting content-bearing words by serial clustering A Bookstein, ST Klein, T Raita Proceedings of the 18th annual international ACM SIGIR conference on …, 1995 | 47 | 1995 |
Dana ShapiraComputer Science, Ariel UniversityПодтвержден адрес электронной почты в домене g.ariel.ac.il