פרופ' שמואל טומי קליין

פרופ'
פרופ' שמואל טומי קליין
טלפון: 
פקס: 
דוא"ל: 
משרד: 
שעות קבלה: 

פירסומים

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 (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 (2015).

  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,
    to appear in Journal of Discrete Algorithms, (2017).

Articles in Refereed Conference Proceedings

  1. 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. 
     
  2. 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. 
     
  3. 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. 
     
  4. 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. 
     
  5. 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]. 
     
  6. 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]. 
     
  7. 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. 
     
  8. 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 [13]. 
     
  9. Bookstein A., Klein S.T.
    Flexible Compression for Bitmap Sets,
    Proc. Data Compression Conference DCC-91, Snowbird, Utah (1991) 402-410. 
    Preliminary version of [12]. 
     
  10. Bookstein A., Klein S.T.
    Generative Models for Bitmap Sets with Compression Applications,
    Proc. 14-th ACM-SIGIR Conf., Chicago (1991) 63-71. 
     
  11. Bookstein A., Klein S.T., Raita T.
    Model based concordance compresssion,
    Proc. Data Compression Conference DCC-92, Snowbird, Utah (1992) 82-91. 
     
  12. 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. 
     
  13. Bookstein A., Klein S.T.
    Is Huffman coding dead?,
    Proc. 16-th ACM-SIGIR Conf., Pittsburgh, PA (1993) 80-87. 
    Preliminary version of [13]. 
     
  14. 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. 
     
  15. Moffat A., Zobel J., Klein S.T.
    Improved inverted file processing for large text databases,
    Proc. 6th Australasian Database Conference, Adelaide (1995) 162-171. 
     
  16. 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 [19]. 
     
  17. 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 [21]. 
     
  18. 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 [20]. 
     
  19. 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 [24]. 
     
  20. Klein S.T., Shapira D.,
    A new compression method for compressed matching,
    Proc. Data Compression Conference DCC-2000, Snowbird, Utah (2000) 400-409. 
     
  21. Klein S.T., Wiseman Y. 
    Parallel Huffman decoding 
    Proc. Data Compression Conference DCC-2000, Snowbird, Utah (2000) 383-392. 
    Preliminary version of [25]. 
     
  22. 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. 
     
  23. 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 [27]. 
     
  24. 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 [26]. 
     
  25. 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. 
     
  26. Klein S.T., Shapira D.,
    Searching in compressed dictionaries, 
    Proc.  Data Compression Conference DCC-2002, Snowbird, Utah (2002) 142-151. 
    Preliminary version of [39]. 
     
  27. 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 [32]. 
     
  28. 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. 
     
  29. Kaufman Y., Klein S.T.,
    An efficient compression scheme supporting partial decoding,
    Proc. Data Compression Conference DCC-2003, Snowbird, Utah (2003) 433. 
     
  30. Kaufman Y., Klein S.T., 
    Semi-lossless text compression, 
    Proc. Prague Stringology Conference PSC-2004, Prague, (2004) 114-123. 
    Preliminary version of [28]. 
     
  31. Klein S.T., Shalom R., 
    Searching for a set of correlated patterns, 
    Proc. SPIRE-2004, Padova, (2004) 68-69. 
    Preliminary version of [30]. 
     
  32. Bergman E., Klein S.T.,
    Fast Decoding of Prefix Encoded Texts,
    Proc. Data Compression Conference DCC-2005, Snowbird, Utah (2005) 143-152. 
     
  33. Klein S.T., Shapira D., 
    Compressed Pattern Matching in JPEG Images, 
    Proc. Prague Stringology Conference PSC-2005, Prague, (2005) 125-134. 
    Preliminary version of [29]. 
     
  34. Conley E.S., Klein S.T., 
    Compression of Multilingual Aligned Texts, 
    Proc. Prague Stringology Conference PSC-2006, Prague, (2006) 151-161. 
    Preliminary version of [33]. 
     
  35. 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 [34]. 
     
  36. Klein S.T., Kopel M., 
    Working with compressed concordances,
    Proc. Prague Stringology Conference PSC-2006, Prague, (2006) 171-181. 
     
  37. Klein S.T., Shapira D., 
    Compressed Delta Encoding for LZSS Encoded Files, 
     Proc. Data Compression Conference DCC-2007, Snowbird, Utah (2007) 113-122. 
     
  38. Klein S.T., 
    Fast Decoding of Fibonacci Encoded Texts, 
    Proc. Data Compression Conference DCC-2007, Snowbird, Utah (2007) 388. 
     
  39. 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 [37]. 
     
  40. 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 [38]. 
     
  41. Klein S.T., Shapira D., 
    Huffman coding with non-sorted frequencies, 
    Proc. Prague Stringology Conference PSC-2008, Prague, (2008) 46--53. 
    Preliminary version of [41]. 
     
  42. Klein S.T., Shapira D., 
    Improved variable to fixed length codes,
    Proc. SPIRE-2008, Melbourne, (2008) 39-50. 
    Preliminary version of [40]. 
     
  43. 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). 
     
  44. Klein S.T., Meir M., 
    Delta encoding in a compressed domain, 
    Proc. Prague Stringology Conference PSC-2009, Prague, (2009) 55-64. 
     
  45. Klein S.T., Shapira D., 
    On the usefulness of backspace, 
    Proc. Prague Stringology Conference PSC-2009, Prague, (2009) 80-89. 
     
  46. Klein S.T., Shapira D.,
    Practical fixed length Lempel Ziv coding,
    Proc. Prague Stringology Conference PSC-2010, Prague, (2010) 116-126. 
    Preliminary version of [46]. 
     
  47. Klein S.T., Shapira D., 
    The string to dictionary matching problem,
    Proc. Data Compression Conference DCC-2011, Snowbird, Utah (2011) 143-152. 
    Preliminary version of [42]. 
     
  48. Conley E.S., Klein S.T.,
    Improved alignment based algorithm for multilingual text compression,
    Proc. LATA'2011, Tarragona, (2011) 238-249. 
    Preliminary version of [44]. 
     
  49. Hirsch M., Klein S.T., Toaff Y.,
    Improving Deduplication Techniques by Accelerating Remainder Calculations,
    Proc. Prague Stringology Conference PSC-2011, Prague, (2011) 173-183. 
    Preliminary version of [45]. 
     
  50. Aronovich L., Asher R., Harnik D., Hirsch M., Klein S.T., Toaff Y.,
    Similarity based Deduplication with small data chunks,
    Proc. Prague Stringology Conference PSC-2012, Prague, (2012) 3-17. 
    Preliminary version of [48]. 
     
  51. Klein S.T., Shapira D., Shelef G.,
    Lossless compression of rotated maskless lithography images
    Proc. SPIRE-2013, Jerusalem, (2013) 186-196. 
     
  52. Hirsch M., Ish-Shalom A., Klein S.T.,
    Optimal partitioning of data chunks in Deduplication Systems,
    Proc. Prague Stringology Conference PSC-2013, Prague, (2013) 128-141. 
     
  53. Klein S.T., Shapira D., 
    Boosting the compression of rewriting on flash memory,
    Proc. Data Compression Conference DCC-2014, Snowbird, Utah (2014) 193-202. 
     
  54. Klein S.T., Shapira D., 
    Compressed SIFT feature based matching, 
    Proc. 4th Intern. Conf. on Advances in Info. Mining and Management IMMM-2014, Paris (2014) 64-69. 
     
  55. Klein S.T., Shapira D., 
    Random Access to Fibonacci Codes, 
    Proc. Prague Stringology Conference PSC-2014, Prague, (2014) 96-109. 
    Preliminary version of [49]. 
     
  56. Klein S.T., Shapira D., 
    Metric preserving dense SIFT compression, 
    Proc. Prague Stringology Conference PSC-2014, Prague, (2014) 139-147. 
     
  57. Herzberg J., Klein S.T., Shapira D.,
    Enhanced Direct Access to Huffman Encoded Files,
    Proc. Data Compression Conference DCC--2015, Snowbird, Utah (2015) 447. 
     
  58. Hirsch M., Klein S.T., Shapira D., Toaff Y., 
    Controlling the Chunk-Size in Deduplication Systems,
    Proc. Prague Stringology Conference PSC-2015, Prague, (2015) 78-89. 
     
  59. Klein S.T., Shapira D., 
    Enhanced Extraction from Huffman Encoded Files,
    Proc. Prague Stringology Conference PSC-2015, Prague, (2015) 67-77. 
     
  60. Geller J., Klein S.T., Polyakov Y., 
    Identifying Pairs of Terms with Strong Semantic Connections in a Textbook Index,
    Proc. 8th Intern. Conf. on Knowledge Engineering and Ontology Development KEOD-15, Lisbon, (2015), Vol. 2, 307-315. 
     
  61. Baruch G., Klein S.T., Shapira D., 
    A Space Efficient Direct Access Data Structure,
    Proc. Data Compression Conference DCC--2016, Snowbird, Utah (2016) 63-72. 
     
  62. Klein S.T., Shapira D., 
    Analysis of a Rewriting Compression System for Flash Memory,
    Proc. Data Compression Conference DCC--2016, Snowbird, Utah (2016) 611. 
     
  63. Klein S.T., 
    The use and usefulness of Fibonacci compression codes
    Proc. Prague Stringology Conference PSC-2016, Prague, (2016) 1-5. 
     
  64. Baruch G., Klein S.T., Shapira D., 
    Accelerated partial decoding in Wavelet trees
    Proc. Prague Stringology Conference PSC-2016, Prague, (2016) 63-70. 
     
  65. Klein S.T., Shapira D., 
    Integrated Encryption in Dynamic Arithmetic Compression
    to appear in Proc. LATA-2017, Umea, Sweden, (2017).

Other publications

  1. Klein S.T., Shamir E.,
    An algorithmic method for studying percolation clusters
    Tech. Report STAN-CS-82-933, Dept. of Computer Science, Stanford University, Sept 1982. 
     
  2. Bookstein A., Klein S.T., Raita T.
    Term clustering in documents,
    appeared as part of a paper by A. Bookstein: Information generation and retrieval, Proc. of the 4-th RIAO Conference, October 11--13, 1994, Rockefeller University, Vol II, 46-48.

Patents and published patent applications

  1. Klein S.T.
    Efficient optimal data recompression method and apparatus, 
    U.S. Patent 5,392,036, Feb. 21, 1995. 
     
  2. Klein S.T., 
    Codes for Enhancing the Repeated Use of Flash Memory, 
    U.S. Patent Application 20150143197, May 21, 2015.

תחומי מחקר

אלגוריתמים, אחזור מידע, דחיסה