Journal Papers of Shmuel T. Klein

    Book



      Klein S.T.
      Basic Concepts in Data Structures
      Cambridge University Press (2016).
      ISBN 978-1-107-16127-6 Hardback, 978-1-316-61384-9 Paperback


    Book Chapters



    1. Fraenkel A.S., Klein S.T.
      Novel Compression of Sparse Bit-Strings
      in Apostolico A., Galil Z., ed., Combinatorial Algorithms on Words, NATO ASI Series Vol F12, Springer Verlag, Berlin (1985) 169-183.

    2. Klein S.T.,
      Techniques and Applications of Data Compression in Information Retrieval Systems,
      in Leondes C., ed., Database and Data Communication Network Systems Vol 2, Chapter 16,
      Academic Press, San Diego, CA, (2002), 573-633.

    3. Klein S.T.,
      A New Approach to Alphabet Extension for Improving Static Compression Schemes ,
      in Dershowitz N., Nissan E., Eds., Language, Culture, Computation. Computing --- Theory and Technology
      Lecture Notes in Computer Science, Vol 8001,
      Springer Verlag, Berlin, (2014), 197-212.



    Published Journal Papers



    1. Choueka Y., Klein S.T., Neuvitz E.,
      Automatic Retrieval of Frequent Idiomatic and Collocational Expressions in a Large Corpus,
      Journal Association Literary and Linguistic Computing, 4 (1983) 34-38.

    2. Agur Z., Fraenkel A.S., Klein S.T.
      The Number of Fixed Points of the Majority Rule,
      Discrete Mathematics 70 (1988) 295-302.

    3. Klein S.T., Bookstein A., Deerwester S.
      Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations,
      ACM Trans. on Information Systems 7 (1989) 230-245.
      Republished in Dutch translation in
      Management en Organisatie van Automatiseringsmiddelen (1992) 82-91.

    4. Bookstein A., Klein S.T.
      Compression, Information Theory and Grammars: A Unified Approach,
      ACM Trans. on Information Systems 8 (1990) 27-49.

    5. Bookstein A., Klein S.T.
      Using Bitmaps for Medium Sized Information Retrieval Systems,
      Information Processing & Management 26 (1990) 525-533.

    6. Fraenkel A.S., Klein S.T.
      Bidirectional Huffman Coding,
      The Computer Journal 33 (1990) 296-307.

    7. Klein S.T.
      Combinatorial Representation of Generalized Fibonacci Numbers,
      The Fibonacci Quarterly 29 (1991) 124-131.

    8. Bookstein A., Klein S.T.
      Compression of Correlated Bit-Vectors,
      Information Systems 16 (1991) 387-400.

    9. Bookstein A., Klein S.T.
      Models of Bitmap Generation: A Systematic Approach to Bitmap Compression,
      Information Processing & Management 28 (1992) 735-748.

    10. Bookstein A., Klein S.T., Ziff D.A.
      A systematic approach to compressing a full text retrieval system,
      Information Processing & Management 28 (1992) 795-806.

    11. Bookstein A., Klein S.T.
      Is Huffman coding dead?,
      Computing 50 (1993) 279-296.

    12. Fraenkel A.S., Klein S.T.
      Bounding the Depth of Search Trees,
      The Computer Journal 36 (1993) 668-678.

    13. Fraenkel A.S., Klein S.T.
      Complexity Aspects of Guessing Prefix Codes,
      Algorithmica 12 (1994) 409-419.

    14. Fraenkel A.S., Klein S.T.
      Robust Universal Complete Codes for Transmission and Compression,
      Discrete Applied Mathematics 64 (1996) 31-55.

    15. Bookstein A., Klein S.T., Raita T.
      Modeling word occurrences for the compression of concordances,
      ACM Trans. on Information Systems 15 (1997) 254-290.

    16. Klein S.T.
      Efficient optimal recompression,
      The Computer Journal 40 (1997) 117-126.

    17. Bookstein A., Klein S.T., Raita T.
      An overhead reduction technique for mega-state compression schemes,
      Information Processing & Management 33 (1997) 745-760.

    18. Bookstein A., Klein S.T., Raita T.
      Clumping properties of content-bearing words,
      Journal of the American Society for Information Science 49 (1998) 102-114.

    19. Fraenkel A.S.,, Klein S.T.,
      Information retrieval from annotated texts,
      Journal of the American Society for Information Science 50 (1999) 845-854.

    20. Bookstein A., Klein S.T., Raita T.
      Simple Bayesian Model for Bitmap Compression,
      Kluwer Journal of Information Retrieval 1(4) (2000) 315-328.

    21. Klein S.T.,
      Skeleton trees for the efficient decoding of Huffman encoded texts,
      Kluwer Journal of Information Retrieval 3(1) (2000) 7-23.

    22. Klein S.T., Wiseman Y.,
      Parallel Huffman Decoding with Applications to JPEG Files,
      The Computer Journal 46(5) (2003) 487-497.

    23. Klein S.T., Wiseman Y.,
      Parallel Lempel Ziv Coding,
      Discrete Applied Mathematics 146 (2) (2005) 180-191.

    24. Klein S.T., Shapira D.,
      Pattern matching in Huffman encoded texts,
      Information Processing & Management 41(4) (2005) 829-841.

    25. Kaufman Y., Klein S.T.,
      Semi-lossless text compression,
      Intern. J. of the Foundations of Computer Science 16 (2005) 1167-1178.

    26. Klein S.T., Shapira D.,
      Compressed Pattern Matching in JPEG images,
      Intern. J. of the Foundations of Computer Science 17(6) (2006) 1297-1306.

    27. Klein S.T., Shalom R., Kaufman Y.,
      Searching for a set of correlated patterns.
      Journal of Discrete Algorithms 5(1) (2007) 149-161.

    28. Kidron A., Klein S.T.,
      An information retrieval approach to predicting meteorological data,
      International Journal of Modelling and Simulation 27(3) (2007) 218-225.

    29. Klein S.T.,
      Processing queries with metrical constraints in XML based IR systems.
      Journal of the American Society for Information Science and Technology 59(1) (2008) 86-97.

    30. Conley E.S., Klein S.T.,
      Using alignment for multilingual text compression.
      Intern. J. of the Foundations of Computer Science 19(1) (2008) 89-101.

    31. Klein S.T., Serebro T., Shapira D.,
      Modeling delta encoding of compressed files,
      Intern. J. of the Foundations of Computer Science 19(1) (2008) 137-146.

    32. Klein S.T.,
      Should one always use repeated squaring for modular exponentiation?,
      Information Processing Letters 106(6) (2008) 232-237.

    33. Klein S.T.,
      On the use of negation in Boolean IR queries,
      Information Processing & Management 45 (2009) 298-311.

    34. Klein S.T., Kopel Ben-Nissan M.,
      Accelerating Boyer Moore searches on binary texts,
      Theoretical Computer Science 410 (2009) 3563-3571.

    35. Klein S.T., Kopel Ben-Nissan M.,
      On the Usefulness of Fibonacci Compression Codes,
      The Computer Journal 53 (2010) 701-716.

    36. Klein S.T., Shapira D.,
      Compressed Matching in Dictionaries,
      Algorithms 4 (2011) 61-74.

    37. Klein S.T., Shapira D.,
      On improving Tunstall codes,
      Information Processing & Management 47(5) (2011) 777-785.

    38. Klein S.T., Shapira D.,
      Huffman coding with non-sorted frequencies,
      Mathematics in Computer Science 5 (2) (2011) 171-178.

    39. Klein S.T., Shapira D.,
      The String-to-Dictionary matching problem,
      The Computer Journal 55 (11) (2012) 1347-1356.

    40. Klein S.T.,
      On the connection between Hamming codes, Heapsort and other methods,
      Information Processing Letters 113(17) (2013) 617-620.

    41. Conley E.S., Klein S.T.,
      Improved alignment-based algorithm for multilingual text compression,
      Mathematics in Computer Science 7(2) (2013) 137-153.

    42. Hirsch M., Klein S.T., Toaff Y.,
      Improving deduplication techniques by accelerating remainder calculations,
      Discrete Applied Mathematics 163 (2014) 307-315.

    43. Klein S.T., Shapira D.,
      Practical fixed length Lempel Ziv coding,
      Discrete Applied Mathematics 163 (2014) 326-333.

    44. Hirsch M., Klein S.T., Toaff Y.,
      Layouts for Improved Hierarchical Parallel Computations
      Journal of Discrete Algorithms 12 (2014) 23-30.

    45. Aronovich L., Asher R., Harnik D., Hirsch M., Klein S.T., Toaff Y.,
      Similarity Based Deduplication with Small Data Chunks,
      Discrete Applied Mathematics 212 (2016) 10-22.

    46. Klein S.T., Shapira D.,
      Random Access to Fibonacci Encoded Files
      Discrete Applied Mathematics 212 (2016) 115-128.

    47. Hirsch M., Ish-Shalom A., Klein S.T.,
      Optimal partitioning of data chunks in Deduplication Systems,
      Discrete Applied Mathematics 212 (2016) 104-114.

    48. Klein S.T., Shapira D.,
      Compressed Matching for Feature Vectors,
      Theoretical Computer Science 638 (2016) 52-62.

    49. Baruch G., Klein S.T., Shapira D.,
      A Space Efficient Direct Access Data Structure,
      Journal of Discrete Algorithms, 43 (2017) 26-37.

    50. Klein S.T., Shapira D.,
      Hierarchical Parallel Evaluation of a Hamming Code,
      Algorithms 10 (2017) article 50.



    Back to homepage