Articles in Refereed Conference Proceedings

41. Choueka Y., Klein S.T., Perl Y.
    Efficient Variants of Huffman Codes in High Level Languages,
    Proc. 8-th ACM-SIGIR Conf., Montreal (1985) 122-130.
    
    
42. Choueka Y., Fraenkel A.S., Klein S.T., Segal E.
    Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems,
    Proc. 9-th ACM-SIGIR Conf., Pisa (1986) 88-97.
    
    
43. Choueka Y., Fraenkel A.S., Klein S.T., Segal E.
    Improved Techniques for Processing Queries in Full-Text Systems,
    Proc. 10-th ACM-SIGIR Conf., New Orleans (1987) 306-315.
    
    
44. Choueka Y., Fraenkel A.S., Klein S.T.
    Compression of Concordances in Full-Text Retrieval Systems,
    Proc. 11-th ACM-SIGIR Conf., Grenoble (1988) 597-612.
    
    
45. Klein S.T., Bookstein A., Deerwester S.
    Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations,
    Proc. 12-th ACM-SIGIR Conf., Cambridge (1989) 160-167. Selected as one of the 6 best papers.
    Preliminary version of [5].
    
    
46. Bookstein A., Klein S.T.
    Construction of Optimal Graphs for Bit-Vector Compression,
    Proc. 13-th ACM-SIGIR Conf., Brussels (1990) 327-342.
    Preliminary version of [10].
    
    
47. Bookstein A., Klein S.T.
    Information Retrieval Tools for Literary Analysis,
    in Database and Expert Systems Applications, edited by A M. Tjoa, Springer Verlag, Vienna (1990) 1-7.
    
    
48. Bookstein A., Klein S.T., Ziff D.A.
    The ARTFL Data Compression Project,
    Proc. RIAO-91 Conf., Barcelona, Spain (1991) 967-985.
    Preliminary version of [12].
    
    
49. Bookstein A., Klein S.T.
    Flexible Compression for Bitmap Sets,
    Proc. Data Compression Conference DCC-91, Snowbird, Utah (1991) 402-410.
    Preliminary version of [11].
    
    
50. Bookstein A., Klein S.T.
    Generative Models for Bitmap Sets with Compression Applications,
    Proc. 14-th ACM-SIGIR Conf., Chicago (1991) 63-71.
    
    
51. Bookstein A., Klein S.T., Raita T.
    Model based concordance compresssion,
    Proc. Data Compression Conference DCC-92, Snowbird, Utah (1992) 82-91.
    
    
52. Bookstein A., Klein S.T., Raita T., Ravichandra Rao I.K., Patil M.D.
    Can random fluctuation be exploited in data compression?,
    Proc. Data Compression Conference DCC-93, Snowbird, Utah (1993) 70-78.
    
    
53. Bookstein A., Klein S.T.
    Is Huffman coding dead?,
    Proc. 16-th ACM-SIGIR Conf., Pittsburgh, PA (1993) 80-87.
    Preliminary version of [13].
    
    
54. Bookstein A., Klein S.T., Raita T.
    Markov models for clusters in concordance compression,
    Proc. Data Compression Conference DCC-94, Snowbird, Utah (1994) 116-125.
    
    
55. Moffat A., Zobel J., Klein S.T.
    Improved inverted file processing for large text databases,
    Proc. 6th Australasian Database Conference, Adelaide (1995) 162-171.
    
    
56. Klein S.T.
    Efficient recompression techniques for dynamic full-text retrieval systems,
    Proc. 18-th ACM-SIGIR Conf., Seattle (1995) 39-47.
    Preliminary version of [18].
    
    
57. Bookstein A., Klein S.T., Raita T.
    Detecting content-bearing words by serial clustering,
    Proc. 18-th ACM-SIGIR Conf., Seattle (1995) 319-327.
    Preliminary version of [20].
    
    
58. Bookstein A., Klein S.T., Raita T.
    An overhead reduction technique for mega-state compression schemes,
    Proc. Data Compression Conference DCC-97, Snowbird, Utah (1997) 367-376.
    Preliminary version of [19].
    
    
59. Klein S.T.
    Space and time-efficient decoding with canonical Huffman trees,
    Proc. 8th Symp. on Combinatorial Pattern Matching, Aarhus, Denmark,
    Lecture Notes in Computer Science 1264, Springer Verlag, Berlin (1997) 65-75.
    Preliminary version of [23].
    
    
60. Klein S.T., Shapira D.,
    A new compression method for compressed matching,
    Proc. Data Compression Conference DCC-2000, Snowbird, Utah (2000) 400-409.
    
    
61. Klein S.T., Wiseman Y.
    Parallel Huffman decoding
    Proc. Data Compression Conference DCC-2000, Snowbird, Utah (2000) 383-392.
    Preliminary version of [24].
    
    
62. Klein S.T.
    Improving static compression schemes by alphabet extension
    Proc. 11th Symp. on Combinatorial Pattern Matching CPM-2000, Montreal, Canada,
    Lecture Notes in Computer Science 1848 Springer Verlag, Berlin (2000) 210-221.
    
    
63. Klein S.T., Shapira D.,
    Pattern matching in Huffman encoded texts
    Proc. Data Compression Conference DCC-2001, Snowbird, Utah (2001) 449-458.
    Preliminary version of [26].
    
    
64. Klein S.T., Wiseman Y.
    Parallel Lempel Ziv coding
    Proc. 12th Symp. on Combinatorial Pattern Matching CPM-2001, Jerusalem, Israel,
    Lecture Notes in Computer Science 2089 Springer Verlag, Berlin (2001) 18-30.
    Preliminary version of [25].
    
    
65. Bookstein A., Klein S.T., Raita T.
    Fuzzy Hamming distance: a new dissimilarity measure,
    Proc. 12th Symp. on Combinatorial Pattern Matching CPM-2001, Jerusalem, Israel,
    Lecture Notes in Computer Science 2089 Springer Verlag, Berlin (2001) 86-97.
    
    
66. Klein S.T., Shapira D.,
    Searching in compressed dictionaries,
    Proc. Data Compression Conference DCC-2002, Snowbird, Utah (2002) 142-151.
    Preliminary version of [38].
    
    
67. Klein S.T.,
    Processing queries with metrical constraints in XML based IR systems,
    Proc. Workshop on XML and Information Retrieval at SIGIR-02, Tampere (2002) 48-55.
    Preliminary version of [31].
    
    
68. Klein S.T., Kopel M.,
    A voting system for automatic OCR correction,
    Proc. Workshop on Information Retrieval and OCR at SIGIR-02, Tampere (2002) 1-21.
    
    
69. Kaufman Y., Klein S.T.,
    An efficient compression scheme supporting partial decoding,
    Proc. Data Compression Conference DCC-2003, Snowbird, Utah (2003) 433.
    
    
70. Kaufman Y., Klein S.T.,
    Semi-lossless text compression,
    Proc. Prague Stringology Conference PSC-2004, Prague, (2004) 114-123.
    Preliminary version of [27].
    
    
71. Klein S.T., Shalom R.,
    Searching for a set of correlated patterns,
    Proc. SPIRE-2004, Padova, (2004) 68-69.
    Preliminary version of [29].
    
    
72. Bergman E., Klein S.T.,
    Fast Decoding of Prefix Encoded Texts,
    Proc. Data Compression Conference DCC-2005, Snowbird, Utah (2005) 143-152.
    
    
73. Klein S.T., Shapira D.,
    Compressed Pattern Matching in JPEG Images,
    Proc. Prague Stringology Conference PSC-2005, Prague, (2005) 125-134.
    Preliminary version of [28].
    
    
74. Conley E.S., Klein S.T.,
    Compression of Multilingual Aligned Texts,
    Proc. Prague Stringology Conference PSC-2006, Prague, (2006) 151-161.
    Preliminary version of [32].
    
    
75. Klein S.T., Serebro T.C., Shapira D.,
    Modeling Delta Encoding of Compressed Files,
    Proc. Prague Stringology Conference PSC-2006, Prague, (2006) 162-170.
    Preliminary version of [33].
    
    
76. Klein S.T., Kopel M.,
    Working with compressed concordances,
    Proc. Prague Stringology Conference PSC-2006, Prague, (2006) 171-181.
    
    
77. Klein S.T., Shapira D.,
    Compressed Delta Encoding for LZSS Encoded Files,
    Proc. Data Compression Conference DCC-2007, Snowbird, Utah (2007) 113-122.
    
    
78. Klein S.T.,
    Fast Decoding of Fibonacci Encoded Texts,
    Proc. Data Compression Conference DCC-2007, Snowbird, Utah (2007) 388.
    
    
79. Klein S.T., Kopel Ben-Nissan M.,
    Accelerating Boyer Moore searches on binary text,
    Proc. Intern. Conf. on Implementation and Application of Automata, CIAA-07, Prague,
    Lecture Notes in Computer Science 4783, Springer Verlag, Berlin (2007) 130-143.
    Preliminary version of [36].
    
    
80. Klein S.T., Kopel Ben-Nissan M.,
    Using Fibonacci compression codes as alternatives to dense codes,
    Proc. Data Compression Conference DCC-2008, Snowbird, Utah (2008) 472-481.
    Preliminary version of [37].
    
    
81. Klein S.T., Shapira D.,
    Huffman coding with non-sorted frequencies,
    Proc. Prague Stringology Conference PSC-2008, Prague, (2008) 46--53.
    Preliminary version of [40].
    
    
82. Klein S.T., Shapira D.,
    Improved variable to fixed length codes,
    Proc. SPIRE-2008, Melbourne, (2008) 39-50.
    Preliminary version of [39].
    
    
83. Aronovich L., Asher R., Bachmat E., Bitner H., Hirsch M., Klein S.T.,
    The Design of a Similarity Based Deduplication System,
    Proc. SYSTOR-09, Haifa, (2009).
    
    
84. Klein S.T., Meir M.,
    Delta encoding in a compressed domain,
    Proc. Prague Stringology Conference PSC-2009, Prague, (2009) 55-64.
    
    
85. Klein S.T., Shapira D.,
    On the usefulness of backspace,
    Proc. Prague Stringology Conference PSC-2009, Prague, (2009) 80-89.
    
    
86. Klein S.T., Shapira D.,
    Practical fixed length Lempel Ziv coding,
    Proc. Prague Stringology Conference PSC-2010, Prague, (2010) 116-126.
    
    
87. Klein S.T., Shapira D.,
    The string to dictionary matching problem,
    Proc. Data Compression Conference DCC-2011, Snowbird, Utah (2011) 143-152.
    
    
88. Conley E.S., Klein S.T.,
    Improved alignment based algorithm for multilingual text compression,
    Proc. LATA'2011, Tarragona, (2011) 238-249.
    
    
89. Hirsch M., Klein S.T., Toaff Y.,
    Improving Deduplication Techniques by Accelerating Remainder Calculations,
    Proc. Prague Stringology Conference PSC-2011, Prague, (2011) 173-183.

    ---

    
    Back to homepage