Остановите войну!
for scientists:
default search action
Shmuel Tomi Klein
- > Home > Persons > Shmuel Tomi Klein
Publications
- 2023
- [j63]Sapir Asraf, Yoav Gross, Shmuel Tomi Klein, Rivka Revivo, Dana Shapira:
New compression schemes for natural number sequences. Discret. Appl. Math. 327: 18-27 (2023) - [j62]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein, Dana Shapira:
Bidirectional adaptive compression. Discret. Appl. Math. 330: 40-50 (2023) - [j61]Gilad Baruch, Shmuel T. Klein, Dana Shapira:
Guided blocks WOM codes. Inf. Process. Lett. 179: 106312 (2023) - [j60]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein, Dana Shapira:
Weighted Burrows-Wheeler Compression. SN Comput. Sci. 4(3): 265 (2023) - [c98]Yoav Gross, Shmuel Tomi Klein, Elina Opalinsky, Dana Shapira:
Selective Weighted Adaptive Coding. PSC 2023: 97-106 - [c97]Kfir Cohen, Yonatan Feigel, Shmuel Tomi Klein, Dana Shapira:
Turning Compression Schemes into Crypto-Systems. PSC 2023: 114-123 - [c96]Shmuel T. Klein, Dana Shapira:
Enhanced Ternary Fibonacci Codes. CIAA 2023: 179-193 - 2022
- [j59]Shmuel T. Klein, Tamar C. Serebro, Dana Shapira:
Generalization of Fibonacci Codes to the Non-Binary Case. IEEE Access 10: 112043-112052 (2022) - [j58]Gilad Baruch, Shmuel T. Klein, Dana Shapira:
Enhanced Context Sensitive Flash Codes. Comput. J. 65(5): 1200-1210 (2022) - [j57]Rachel Mustakis Avrunin, Shmuel T. Klein, Dana Shapira:
Combining Forward Compression with PPM. SN Comput. Sci. 3(3): 239 (2022) - [j56]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein, Dana Shapira:
Weighted forward looking adaptive coding. Theor. Comput. Sci. 930: 86-99 (2022) - [c95]Yoav Gross, Shmuel T. Klein, Elina Opalinsky, Rivka Revivo, Dana Shapira:
A Huffman Code Based Crypto-System. DCC 2022: 133-142 - [c94]Yoav Gross, Shmuel T. Klein, Elina Opalinsky, Dana Shapira:
Selective Weighted Adaptive Coding. DCC 2022: 454 - 2021
- [j55]Ekaterina Benza, Shmuel T. Klein, Dana Shapira:
Smaller Compressed Suffix Arrays†. Comput. J. 64(5): 721-730 (2021) - [j54]Shmuel T. Klein, Dana Shapira:
Integrated encryption in dynamic arithmetic compression. Inf. Comput. 279: 104617 (2021) - [j53]Shmuel T. Klein, Shoham Saadia, Dana Shapira:
Forward Looking Huffman Coding. Theory Comput. Syst. 65(3): 593-612 (2021) - [j52]Shmuel T. Klein, Jakub Radoszewski, Tamar C. Serebro, Dana Shapira:
Optimal skeleton and reduced Huffman trees. Theor. Comput. Sci. 852: 157-171 (2021) - [c93]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein, Dana Shapira:
Backward Weighted Coding. DCC 2021: 93-102 - [c92]Guy Arbitman, Shmuel T. Klein, Pierre Peterlongo, Dana Shapira:
Approximate Hashing for Bioinformatics. DCC 2021: 337 - [c91]Gilad Baruch, Shmuel T. Klein, Dana Shapira:
Guided Blocks WOM codes. DCC 2021: 339 - [c90]Guy Arbitman, Shmuel T. Klein, Pierre Peterlongo, Dana Shapira:
Approximate Hashing for Bioinformatics. CIAA 2021: 178-189 - [i2]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein, Dana Shapira:
Weighted Burrows-Wheeler Compression. CoRR abs/2105.10327 (2021) - 2020
- [j51]Gilad Baruch, Shmuel T. Klein, Dana Shapira:
Accelerated partial decoding in wavelet trees. Discret. Appl. Math. 274: 2-10 (2020) - [j50]Michael Hirsch, Shmuel T. Klein, Dana Shapira, Yair Toaff:
Dynamic determination of variable sizes of chunks in a deduplication system. Discret. Appl. Math. 274: 81-91 (2020) - [j49]Shmuel T. Klein, Dana Shapira:
On the Randomness of Compressed Data. Inf. 11(4): 196 (2020) - [c89]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein, Dana Shapira:
Weighted Adaptive Huffman Coding. DCC 2020: 368 - [c88]Shmuel T. Klein, Tamar C. Serebro, Dana Shapira:
Non-Binary Robust Universal Variable Length Codes. DCC 2020: 376 - [c87]Sapir Asraf, Shmuel Tomi Klein, Dana Shapira:
New Compression Schemes for Natural Number Sequences. Stringology 2020: 1-10 - [i1]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein, Dana Shapira:
Weighted Adaptive Coding. CoRR abs/2005.08232 (2020) - 2019
- [j48]Shmuel T. Klein, Dana Shapira:
Context Sensitive Rewriting Codes for Flash Memory†. Comput. J. 62(1): 20-29 (2019) - [c86]Shmuel Tomi Klein, Shoham Saadia, Dana Shapira:
Forward Looking Huffman Coding. CSR 2019: 203-214 - [c85]Gilad Baruch, Shmuel T. Klein, Dana Shapira:
Enhanced Context Sensitive Flash Codes. DCC 2019: 555 - [c84]Shmuel T. Klein, Dana Shapira:
On the Randomness of Compressed Data. DCC 2019: 581 - [c83]Shmuel T. Klein, Shoham Saadia, Dana Shapira:
Better Than Optimal Huffman Coding? DCC 2019: 582 - [c82]Shmuel T. Klein, Elina Opalinsky, Dana Shapira:
Selective Dynamic Compression. DCC 2019: 583 - [c80]Aharon Fruchtman, Shmuel Tomi Klein, Dana Shapira:
Bidirectional Adaptive Compression. Stringology 2019: 92-101 - [c79]Shmuel Tomi Klein, Elina Opalinsky, Dana Shapira:
Selective Dynamic Compression. Stringology 2019: 102-110 - [c78]Gilad Baruch, Shmuel T. Klein, Dana Shapira:
New Approaches for Context Sensitive Flash Codes. CIAA 2019: 45-57 - 2018
- [c77]Gilad Baruch, Dana Shapira, Shmuel T. Klein:
Compressed Hierarchical Clustering. DCC 2018: 399 - [c76]Shmuel T. Klein, Dana Shapira:
Fibonacci Based Compressed Suffix Array. DCC 2018: 415 - [c75]Gilad Baruch, Shmuel Tomi Klein, Dana Shapira:
Applying Compression to Hierarchical Clustering. SISAP 2018: 151-162 - [c74]Ekaterina Benza, Shmuel Tomi Klein, Dana Shapira:
Fibonacci Based Compressed Suffix Array. Stringology 2018: 3-11 - [c73]Shmuel Tomi Klein, Elina Opalinsky, Dana Shapira:
Synchronizing Dynamic Huffman Codes. Stringology 2018: 27-37 - [e1]Shmuel Tomi Klein, Carlos Martín-Vide, Dana Shapira:
Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings. Lecture Notes in Computer Science 10792, Springer 2018, ISBN 978-3-319-77312-4 [contents] - 2017
- [j47]Shmuel T. Klein, Dana Shapira:
Hierarchical Parallel Evaluation of a Hamming Code. Algorithms 10(2): 50 (2017) - [j46]Gilad Baruch, Shmuel T. Klein, Dana Shapira:
A space efficient direct access data structure. J. Discrete Algorithms 43: 26-37 (2017) - [c72]Shmuel T. Klein, Dana Shapira:
Integrated Encryption in Dynamic Arithmetic Compression. LATA 2017: 143-154 - [c71]Shmuel T. Klein, Tamar C. Serebro, Dana Shapira:
Optimal Skeleton Huffman Trees. SPIRE 2017: 241-253 - [c70]Gilad Baruch, Shmuel Tomi Klein, Dana Shapira:
Range Queries Using Huffman Wavelet Trees. Stringology 2017: 18-29 - 2016
- [j45]Lior Aronovich, Ron Asher, Danny Harnik, Michael Hirsch, Shmuel T. Klein, Yair Toaff:
Similarity based deduplication with small data chunks. Discret. Appl. Math. 212: 10-22 (2016) - [j44]Michael Hirsch, Ariel Ish-Shalom, Shmuel T. Klein:
Optimal partitioning of data chunks in deduplication systems. Discret. Appl. Math. 212: 104-114 (2016) - [j43]Shmuel T. Klein, Dana Shapira:
Random access to Fibonacci encoded files. Discret. Appl. Math. 212: 115-128 (2016) - [j42]Shmuel T. Klein, Dana Shapira:
Compressed matching for feature vectors. Theor. Comput. Sci. 638: 52-62 (2016) - [c69]Gilad Baruch, Shmuel T. Klein, Dana Shapira:
A Space Efficient Direct Access Data Structure. DCC 2016: 63-72 - [c68]Shmuel T. Klein, Dana Shapira:
Analysis of a Rewriting Compression System for Flash Memory. DCC 2016: 611 - [c66]Gilad Baruch, Shmuel Tomi Klein, Dana Shapira:
Accelerated Partial Decoding in Wavelet Trees. Stringology 2016: 63-69 - 2015
- [c65]Josh Herzberg, Shmuel T. Klein, Dana Shapira:
Enhanced Direct Access to Huffman Encoded Files. DCC 2015: 447 - [c63]Shmuel Tomi Klein, Dana Shapira:
Enhanced Extraction from Huffman Encoded Files. Stringology 2015: 67-77 - [c62]Michael Hirsch, Shmuel Tomi Klein, Dana Shapira, Yair Toaff:
Controlling the Chunk-Size in Deduplication Systems. Stringology 2015: 78-89 - 2014
- [j41]Michael Hirsch, Shmuel T. Klein, Yair Toaff:
Improving deduplication techniques by accelerating remainder calculations. Discret. Appl. Math. 163: 307-315 (2014) - [j40]Shmuel T. Klein, Dana Shapira:
Practical fixed length Lempel-Ziv coding. Discret. Appl. Math. 163: 326-333 (2014) - [j39]Michael Hirsch, Shmuel Tomi Klein, Yair Toaff:
Layouts for improved hierarchical parallel computations. J. Discrete Algorithms 28: 23-30 (2014) - [c60]Shmuel T. Klein, Dana Shapira:
Boosting the Compression of Rewriting on Flash Memory. DCC 2014: 193-202 - [c59]Shmuel T. Klein, Dana Shapira:
Direct Processing of Compressed SIFT Feature Vectors. DCC 2014: 410 - [c58]Shmuel Tomi Klein, Dana Shapira:
Random Access to Fibonacci Codes. Stringology 2014: 96-109 - [c57]Shmuel Tomi Klein, Dana Shapira:
Metric Preserving Dense SIFT Compression. Stringology 2014: 139-147 - 2013
- [c56]Shmuel T. Klein, Dana Shapira, Gal Shelef:
Lossless Compression of Rotated Maskless Lithography Images. DCC 2013: 500 - [c55]Shmuel Tomi Klein, Dana Shapira, Gal Shelef:
Lossless Compression of Rotated Maskless Lithography Images. SPIRE 2013: 186-196 - [c54]Michael Hirsch, Ariel Ish-Shalom, Shmuel Tomi Klein:
Optimal Partitioning of Data Chunks in Deduplication Systems. Stringology 2013: 128-141 - 2012
- [j36]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
- [j35]Shmuel T. Klein, Dana Shapira:
Compressed Matching in Dictionaries. Algorithms 4(1): 61-74 (2011) - [j34]Shmuel T. Klein, Dana Shapira:
On improving Tunstall codes. Inf. Process. Manag. 47(5): 777-785 (2011) - [j33]Shmuel T. Klein, Dana Shapira:
Huffman Coding with Non-Sorted Frequencies. Math. Comput. Sci. 5(2): 171-178 (2011) - [c52]Shmuel Tomi Klein, Dana Shapira:
The String-to-Dictionary Matching Problem. DCC 2011: 143-152 - [c50]Michael Hirsch, Shmuel Tomi Klein, Yair Toaff:
Improving Deduplication Techniques by Accelerating Remainder Calculations. Stringology 2011: 173-183 - 2010
- [c49]Shmuel Tomi Klein, Dana Shapira:
Practical Fixed Length Lempel Ziv Coding. Stringology 2010: 116-126 - 2009
- [c47]Shmuel Tomi Klein, Dana Shapira:
On the Usefulness of Backspace. Stringology 2009: 80-89 - [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]Shmuel T. Klein, Tamar C. Serebro, Dana Shapira:
Modeling Delta Encoding of Compressed Files. Int. J. Found. Comput. Sci. 19(1): 137-146 (2008) - [c44]Shmuel Tomi Klein, Dana Shapira:
Huffman Coding with Non-sorted Frequencies. DCC 2008: 526 - [c43]Shmuel Tomi Klein, Dana Shapira:
Improved Variable-to-Fixed Length Codes. SPIRE 2008: 39-50 - [c42]Shmuel Tomi Klein, Dana Shapira:
Huffman Coding with Non-Sorted Frequencies. Stringology 2008: 46-53 - 2007
- [c41]Shmuel T. Klein, Dana Shapira:
Compressed Delta Encoding for LZSS Encoded Files. DCC 2007: 113-122 - 2006
- [j24]Shmuel T. Klein, Dana Shapira:
Compressed Pattern Matching in Jpeg Images. Int. J. Found. Comput. Sci. 17(6): 1297-1306 (2006) - [c37]Shmuel Tomi Klein, Tamar C. Serebro, Dana Shapira:
Modeling Delta Encoding of Compressed Files. DCC 2006: 457 - [c35]Shmuel Tomi Klein, Tamar C. Serebro, Dana Shapira:
Modeling delta encoding of compressed files. Stringology 2006: 162-170 - 2005
- [j21]Shmuel Tomi Klein, Dana Shapira:
Pattern matching in Huffman encoded texts. Inf. Process. Manag. 41(4): 829-841 (2005) - [c32]Shmuel Tomi Klein, Dana Shapira:
Compressed Pattern Matching in JPEG Images. DCC 2005: 466 - [c31]Shmuel Tomi Klein, Dana Shapira:
Compressed pattern matching in JPEG images. Stringology 2005: 125-134 - 2002
- [c26]Shmuel T. Klein, Dana Shapira:
Searching in Compressed Dictionaries. DCC 2002: 142- - 2001
- [c23]Shmuel T. Klein, Dana Shapira:
Pattern Matching in Huffman Encoded Texts. Data Compression Conference 2001: 449-458 - 2000
- [c20]Shmuel T. Klein, Dana Shapira:
A New Compression Method for Compressed Matching. Data Compression Conference 2000: 400-409
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint