default search action
Shmuel Tomi Klein
Shmuel T. Klein
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j65]Shmuel T. Klein
, Elina Opalinsky, Dana Shapira
Selective dynamic compression. Discret. Appl. Math. 358: 13-22 (2024) - [j64]Shmuel T. Klein
Synchronizing dynamic Huffman codes. Discret. Appl. Math. 358: 23-32 (2024) - [c100]Shmuel T. Klein
Denser High-Order Fibonacci Codes. DCC 2024: 263-272 - [c99]Igor Zavadskyi, Shmuel T. Klein
Word-Based Forward Coding. DCC 2024: 352-361 - 2023
- [j63]Sapir Asraf, Yoav Gross, Shmuel Tomi Klein
New compression schemes for natural number sequences. Discret. Appl. Math. 327: 18-27 (2023) - [j62]Aharon Fruchtman
Bidirectional adaptive compression. Discret. Appl. Math. 330: 40-50 (2023) - [j61]Gilad Baruch, Shmuel T. Klein
Guided blocks WOM codes. Inf. Process. Lett. 179: 106312 (2023) - [j60]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein
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
Enhanced Ternary Fibonacci Codes. CIAA 2023: 179-193 - 2022
- [j59]Shmuel T. Klein
Generalization of Fibonacci Codes to the Non-Binary Case. IEEE Access 10: 112043-112052 (2022) - [j58]Gilad Baruch, Shmuel T. Klein
Enhanced Context Sensitive Flash Codes. Comput. J. 65(5): 1200-1210 (2022) - [j57]Rachel Mustakis Avrunin, Shmuel T. Klein
Combining Forward Compression with PPM. SN Comput. Sci. 3(3): 239 (2022) - [j56]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein
Weighted forward looking adaptive coding. Theor. Comput. Sci. 930: 86-99 (2022) - [c95]Yoav Gross, Shmuel T. Klein
A Huffman Code Based Crypto-System. DCC 2022: 133-142 - [c94]Yoav Gross, Shmuel T. Klein
Selective Weighted Adaptive Coding. DCC 2022: 454 - 2021
- [b2]Shmuel Tomi Klein
Basic Concepts in Algorithms. WorldScientific 2021, ISBN 9789811237584, pp. 1-364 - [j55]Ekaterina Benza, Shmuel T. Klein
Smaller Compressed Suffix Arrays†. Comput. J. 64(5): 721-730 (2021) - [j54]Shmuel T. Klein
Integrated encryption in dynamic arithmetic compression. Inf. Comput. 279: 104617 (2021) - [j53]Shmuel T. Klein
Forward Looking Huffman Coding. Theory Comput. Syst. 65(3): 593-612 (2021) - [j52]Shmuel T. Klein
Optimal skeleton and reduced Huffman trees. Theor. Comput. Sci. 852: 157-171 (2021) - [c93]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein
Backward Weighted Coding. DCC 2021: 93-102 - [c92]Guy Arbitman, Shmuel T. Klein
Approximate Hashing for Bioinformatics. DCC 2021: 337 - [c91]Gilad Baruch, Shmuel T. Klein
Guided Blocks WOM codes. DCC 2021: 339 - [c90]Guy Arbitman, Shmuel T. Klein
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
Accelerated partial decoding in wavelet trees. Discret. Appl. Math. 274: 2-10 (2020) - [j50]Michael Hirsch, Shmuel T. Klein
Dynamic determination of variable sizes of chunks in a deduplication system. Discret. Appl. Math. 274: 81-91 (2020) - [j49]Shmuel T. Klein
On the Randomness of Compressed Data. Inf. 11(4): 196 (2020) - [c89]Aharon Fruchtman, Yoav Gross, Shmuel T. Klein
Weighted Adaptive Huffman Coding. DCC 2020: 368 - [c88]Shmuel T. Klein
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)
2010 – 2019
- 2019
- [j48]Shmuel T. Klein
Context Sensitive Rewriting Codes for Flash Memory†. Comput. J. 62(1): 20-29 (2019) - [c86]Shmuel Tomi Klein
Forward Looking Huffman Coding. CSR 2019: 203-214 - [c85]Gilad Baruch, Shmuel T. Klein
Enhanced Context Sensitive Flash Codes. DCC 2019: 555 - [c84]Shmuel T. Klein
On the Randomness of Compressed Data. DCC 2019: 581 - [c83]Shmuel T. Klein
Better Than Optimal Huffman Coding? DCC 2019: 582 - [c82]Shmuel T. Klein
Selective Dynamic Compression. DCC 2019: 583 - [c81]James Geller, Shmuel T. Klein
Measuring and Avoiding Information Loss During Concept Import from a Source to a Target Ontology. KEOD 2019: 442-449 - [c80]Aharon Fruchtman, Shmuel Tomi Klein
Bidirectional Adaptive Compression. Stringology 2019: 92-101 - [c79]Shmuel Tomi Klein
Selective Dynamic Compression. Stringology 2019: 102-110 - [c78]Gilad Baruch, Shmuel T. Klein
New Approaches for Context Sensitive Flash Codes. CIAA 2019: 45-57 - 2018
- [c77]Gilad Baruch, Dana Shapira
Compressed Hierarchical Clustering. DCC 2018: 399 - [c76]Shmuel T. Klein
Fibonacci Based Compressed Suffix Array. DCC 2018: 415 - [c75]Gilad Baruch, Shmuel Tomi Klein
Applying Compression to Hierarchical Clustering. SISAP 2018: 151-162 - [c74]Ekaterina Benza, Shmuel Tomi Klein
Fibonacci Based Compressed Suffix Array. Stringology 2018: 3-11 - [c73]Shmuel Tomi Klein
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
Hierarchical Parallel Evaluation of a Hamming Code. Algorithms 10(2): 50 (2017) - [j46]Gilad Baruch, Shmuel T. Klein
A space efficient direct access data structure. J. Discrete Algorithms 43: 26-37 (2017) - [c72]Shmuel T. Klein
Integrated Encryption in Dynamic Arithmetic Compression. LATA 2017: 143-154 - [c71]Shmuel T. Klein
Optimal Skeleton Huffman Trees. SPIRE 2017: 241-253 - [c70]Gilad Baruch, Shmuel Tomi Klein
Range Queries Using Huffman Wavelet Trees. Stringology 2017: 18-29 - 2016
- [b1]Shmuel Tomi Klein:
Basic Concepts in Data Structures. Cambridge University Press 2016, ISBN 9781316613849 - [j45]Lior Aronovich, Ron Asher
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
Random access to Fibonacci encoded files. Discret. Appl. Math. 212: 115-128 (2016) - [j42]Shmuel T. Klein
Compressed matching for feature vectors. Theor. Comput. Sci. 638: 52-62 (2016) - [c69]Gilad Baruch, Shmuel T. Klein
A Space Efficient Direct Access Data Structure. DCC 2016: 63-72 - [c68]Shmuel T. Klein
Analysis of a Rewriting Compression System for Flash Memory. DCC 2016: 611 - [c67]Shmuel Tomi Klein
The Use and Usefulness of Fibonacci Codes. Stringology 2016: 1-5 - [c66]Gilad Baruch, Shmuel Tomi Klein
Accelerated Partial Decoding in Wavelet Trees. Stringology 2016: 63-69 - 2015
- [c65]Josh Herzberg, Shmuel T. Klein
Enhanced Direct Access to Huffman Encoded Files. DCC 2015: 447 - [c64]James Geller, Shmuel T. Klein
Identifying Pairs of Terms with Strong Semantic Connections in a Textbook Index. KEOD 2015: 307-315 - [c63]Shmuel Tomi Klein
Enhanced Extraction from Huffman Encoded Files. Stringology 2015: 67-77 - [c62]Michael Hirsch, Shmuel Tomi Klein
Controlling the Chunk-Size in Deduplication Systems. Stringology 2015: 78-89 - 2014
- [j41]Michael Hirsch, Shmuel T. Klein
Improving deduplication techniques by accelerating remainder calculations. Discret. Appl. Math. 163: 307-315 (2014) - [j40]Shmuel T. Klein
Practical fixed length Lempel-Ziv coding. Discret. Appl. Math. 163: 326-333 (2014) - [j39]Michael Hirsch, Shmuel Tomi Klein
Layouts for improved hierarchical parallel computations. J. Discrete Algorithms 28: 23-30 (2014) - [c61]Shmuel T. Klein
A New Approach to Alphabet Extension for Improving Static Compression Schemes. Language, Culture, Computation (1) 2014: 197-212 - [c60]Shmuel T. Klein
Boosting the Compression of Rewriting on Flash Memory. DCC 2014: 193-202 - [c59]Shmuel T. Klein
Direct Processing of Compressed SIFT Feature Vectors. DCC 2014: 410 - [c58]Shmuel Tomi Klein
Random Access to Fibonacci Codes. Stringology 2014: 96-109 - [c57]Shmuel Tomi Klein
Metric Preserving Dense SIFT Compression. Stringology 2014: 139-147 - 2013
- [j38]Shmuel T. Klein
On the connection between Hamming codes, Heapsort and other methods. Inf. Process. Lett. 113(17): 617-620 (2013) - [j37]Ehud S. Conley, Shmuel T. Klein
Improved Alignment-Based Algorithm for Multilingual Text Compression. Math. Comput. Sci. 7(2): 137-153 (2013) - [c56]Shmuel T. Klein
Lossless Compression of Rotated Maskless Lithography Images. DCC 2013: 500 - [c55]Shmuel Tomi Klein
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
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
Similarity Based Deduplication with Small Data Chunks. Stringology 2012: 3-17 - 2011
- [j35]Shmuel T. Klein
Compressed Matching in Dictionaries. Algorithms 4(1): 61-74 (2011) - [j34]Shmuel T. Klein
On improving Tunstall codes. Inf. Process. Manag. 47(5): 777-785 (2011) - [j33]Shmuel T. Klein
Huffman Coding with Non-Sorted Frequencies. Math. Comput. Sci. 5(2): 171-178 (2011) - [c52]Shmuel Tomi Klein
The String-to-Dictionary Matching Problem. DCC 2011: 143-152 - [c51]Ehud S. Conley, Shmuel Tomi Klein
Improved Alignment Based Algorithm for Multilingual Text Compression. LATA 2011: 238-249 - [c50]Michael Hirsch, Shmuel Tomi Klein
Improving Deduplication Techniques by Accelerating Remainder Calculations. Stringology 2011: 173-183 - 2010
- [j32]Shmuel Tomi Klein
On the Usefulness of Fibonacci Compression Codes. Comput. J. 53(6): 701-716 (2010) - [c49]Shmuel Tomi Klein
Practical Fixed Length Lempel Ziv Coding. Stringology 2010: 116-126
2000 – 2009
- 2009
- [j31]Shmuel T. Klein
On the use of negation in Boolean IR queries. Inf. Process. Manag. 45(2): 298-311 (2009) - [j30]Shmuel T. Klein
Accelerating Boyer-Moore searches on binary texts. Theor. Comput. Sci. 410(37): 3563-3571 (2009) - [c48]Shmuel Tomi Klein
Delta Encoding in a Compressed Domain. Stringology 2009: 55-64 - [c47]Shmuel Tomi Klein
On the Usefulness of Backspace. Stringology 2009: 80-89 - [c46]Lior Aronovich, Ron Asher, Eitan Bachmat
The design of a similarity based deduplication system. SYSTOR 2009: 6 - 2008
- [j29]Ehud S. Conley, Shmuel T. Klein
Using Alignment for Multilingual Text Compression. Int. J. Found. Comput. Sci. 19(1): 89-101 (2008) - [j28]Shmuel T. Klein
Modeling Delta Encoding of Compressed Files. Int. J. Found. Comput. Sci. 19(1): 137-146 (2008) - [j27]Shmuel T. Klein
Should one always use repeated squaring for modular exponentiation? Inf. Process. Lett. 106(6): 232-237 (2008) - [j26]Shmuel T. Klein
Processing queries with metrical constraints in XML-based IR systems. J. Assoc. Inf. Sci. Technol. 59(1): 86-97 (2008) - [c45]Shmuel Tomi Klein
Using Fibonacci Compression Codes as Alternatives to Dense Codes. DCC 2008: 472-481 - [c44]Shmuel Tomi Klein
Huffman Coding with Non-sorted Frequencies. DCC 2008: 526 - [c43]Shmuel Tomi Klein
Improved Variable-to-Fixed Length Codes. SPIRE 2008: 39-50 - [c42]Shmuel Tomi Klein
Huffman Coding with Non-Sorted Frequencies. Stringology 2008: 46-53 - 2007
- [j25]Shmuel T. Klein
Searching for a set of correlated patterns. J. Discrete Algorithms 5(1): 149-161 (2007) - [c41]Shmuel T. Klein
Compressed Delta Encoding for LZSS Encoded Files. DCC 2007: 113-122 - [c40]Shmuel T. Klein
Fast Decoding of Fibonacci Encoded Texts. DCC 2007: 388 - [c39]Shmuel Tomi Klein
Accelerating Boyer Moore Searches on Binary Texts. CIAA 2007: 130-143 - 2006
- [j24]Shmuel T. Klein
Compressed Pattern Matching in Jpeg Images. Int. J. Found. Comput. Sci. 17(6): 1297-1306 (2006) - [c38]Ehud S. Conley, Shmuel Tomi Klein
Compression of Multilingual Aligned Texts. DCC 2006: 442 - [c37]Shmuel Tomi Klein
Modeling Delta Encoding of Compressed Files. DCC 2006: 457 - [c36]Ehud S. Conley, Shmuel Tomi Klein
Using alignment for multilingual text compression. Stringology 2006: 151-161 - [c35]Shmuel Tomi Klein
Modeling delta encoding of compressed files. Stringology 2006: 162-170 - [c34]Miri Ben-Nissan, Shmuel Tomi Klein
Working with compressed concordances. Stringology 2006: 171-181 - 2005
- [j23]Shmuel Tomi Klein
Parallel Lempel Ziv coding. Discret. Appl. Math. 146(2): 180-191 (2005) - [j22]Yair Kaufman, Shmuel T. Klein
Semi-lossless text compression. Int. J. Found. Comput. Sci. 16(6): 1167-1178 (2005) - [j21]Shmuel Tomi Klein
Pattern matching in Huffman encoded texts. Inf. Process. Manag. 41(4): 829-841 (2005) - [c33]Eyal Bergman, Shmuel T. Klein
Fast Decoding of Prefix Encoded Texts. DCC 2005: 143-152 - [c32]Shmuel Tomi Klein
Compressed Pattern Matching in JPEG Images. DCC 2005: 466 - [c31]Shmuel Tomi Klein
Compressed pattern matching in JPEG images. Stringology 2005: 125-134 - 2004
- [c30]Yair Kaufman, Shmuel T. Klein
Semi-Lossless Text Compression. Data Compression Conference 2004: 544 - [c29]Shmuel T. Klein
Searching for a Set of Correlated Patterns. SPIRE 2004: 68-69 - [c28]Yair Kaufman, Shmuel T. Klein
Semi-Lossless Text Compression. Stringology 2004: 114-123 - 2003
- [j20]Shmuel Tomi Klein
Parallel Huffman Decoding with Applications to JPEG Files. Comput. J. 46(5): 487-497 (2003) - [c27]Yair Kaufman, Shmuel T. Klein
An Efficient Compression Scheme Supporting Partial Decoding. DCC 2003: 433 - 2002
- [c26]Shmuel T. Klein
Searching in Compressed Dictionaries. DCC 2002: 142- - 2001
- [c25]Shmuel Tomi Klein, Yair Wiseman:
Parallel Lempel Ziv Coding. CPM 2001: 18-30 - [c24]Abraham Bookstein, Shmuel T. Klein
Fuzzy Hamming Distance: A New Dissimilarity Measure. CPM 2001: 86-97 - [c23]Shmuel T. Klein
Pattern Matching in Huffman Encoded Texts. Data Compression Conference 2001: 449-458 - 2000
- [j19]Abraham Bookstein, Shmuel T. Klein
Simple Bayesian Model for Bitmap Compression. Inf. Retr. 1(4): 315-328 (2000) - [j18]Shmuel T. Klein
Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts. Inf. Retr. 3(1): 7-23 (2000) - [c22]Shmuel T. Klein
Improving Static Compression Schemes by Alphabet Extension. CPM 2000: 210-221 - [c21]Shmuel Tomi Klein, Yair Wiseman:
Parallel Huffman Decoding. Data Compression Conference 2000: 383-392 - [c20]Shmuel T. Klein
A New Compression Method for Compressed Matching. Data Compression Conference 2000: 400-409
1990 – 1999
- 1999
- [j17]Aviezri S. Fraenkel, Shmuel T. Klein:
Information Retrieval from Annotated Texts. J. Am. Soc. Inf. Sci. 50(10): 845-854 (1999) - 1998
- [j16]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Clumping Properties of Content-Bearing Words. J. Am. Soc. Inf. Sci. 49(2): 102-114 (1998) - 1997
- [j15]Shmuel T. Klein:
Efficient Optimal Recompression. Comput. J. 40(2/3): 117-126 (1997) - [j14]Abraham Bookstein, Shmuel T. Klein
An overhead reduction technique for mega-state compression schemes. Inf. Process. Manag. 33(6): 745-760 (1997) - [j13]Abraham Bookstein, Shmuel T. Klein
Modeling Word Occurrences for the Compression of Concordances. ACM Trans. Inf. Syst. 15(3): 254-290 (1997) - [c19]Shmuel T. Klein
Space- and Time-Efficient Decoding with Canonical Huffman Trees. CPM 1997: 65-75 - [c18]Abraham Bookstein, Shmuel T. Klein
An Overhead Reduction Technique For Mega-State Compression Schemes. Data Compression Conference 1997: 367-376 - 1996
- [j12]Aviezri S. Fraenkel, Shmuel T. Klein
Robust Universal Complete Codes for Transmission and Compression. Discret. Appl. Math. 64(1): 31-55 (1996) - 1995
- [c17]Alistair Moffat, Justin Zobel, Shmuel T. Klein:
Improved Inverted File Processing for Large Text Databases. Australasian Database Conference 1995 - [c16]Shmuel T. Klein
Efficient Recompression Techniques for Dynamic Full-Text Retrieval Systems. SIGIR 1995: 39-47 - [c15]Abraham Bookstein, Shmuel T. Klein
Detecting Content-Bearing Words by Serial Clustering. SIGIR 1995: 319-327 - 1994
- [j11]Aviezri S. Fraenkel, Shmuel T. Klein
Complexity Aspects of Guessing Prefix Codes. Algorithmica 12(4/5): 409-419 (1994) - [c14]Abraham Bookstein, Shmuel T. Klein
Markov Models for Clusters in Concordance Compression. Data Compression Conference 1994: 116-125 - 1993
- [j10]Aviezri S. Fraenkel, Shmuel T. Klein
Bounding the Depth of Search Trees. Comput. J. 36(7): 668-678 (1993) - [j9]Abraham Bookstein, Shmuel Tomi Klein
Is Huffman coding dead? Computing 50(4): 279-296 (1993) - [c13]Abraham Bookstein, Shmuel T. Klein
Can Random Fluctuation Be Exploited in Data Compression. Data Compression Conference 1993: 70-78 - [c12]Abraham Bookstein, Shmuel T. Klein
Is Huffman Coding Dead? SIGIR 1993: 80-87 - 1992
- [j8]Abraham Bookstein, Shmuel T. Klein
Models of Bitmap Generation: A Systematic Approach to Bitmap Compression. Inf. Process. Manag. 28(6): 735-748 (1992) - [j7]Abraham Bookstein, Shmuel T. Klein
A Systematic Approach to Compressing a Full-Text Retrieval System. Inf. Process. Manag. 28(6): 795-806 (1992) - [c11]Abraham Bookstein, Shmuel T. Klein
Model Based Concordance Compression. Data Compression Conference 1992: 82-91 - 1991
- [j6]Abraham Bookstein, Shmuel T. Klein
Compression of correlated bit-vectors. Inf. Syst. 16(4): 387-400 (1991) - [c10]Abraham Bookstein, Shmuel T. Klein
Flexible Compression for Bitmap Sets. Data Compression Conference 1991: 402-410 - [c9]Abraham Bookstein, Shmuel Tomi Klein, Donald A. Ziff:
The ARTFL data compression project. RIAO 1991: 967-985 - [c8]Abraham Bookstein, Shmuel T. Klein
Compression of a Set of Correlated Bitmaps. SIGIR 1991: 63-71 - 1990
- [j5]Aviezri S. Fraenkel, Shmuel T. Klein
Bidirectional Huffman Coding. Comput. J. 33(4): 296-307 (1990) - [j4]Abraham Bookstein, Shmuel T. Klein
Using bitmaps for medium sized information retrieval systems. Inf. Process. Manag. 26(4): 525-533 (1990) - [j3]Abraham Bookstein, Shmuel T. Klein
Compression, Information Theory, and Grammars: A Unified Approach. ACM Trans. Inf. Syst. 8(1): 27-49 (1990) - [c7]Abraham Bookstein, Shmuel T. Klein:
Information Retrieval Tools for Literary Analysis. DEXA 1990: 1-7 - [c6]Abraham Bookstein, Shmuel T. Klein
Construction of Optimal Graphs for Bit-Vector Compression. SIGIR 1990: 327-342
1980 – 1989
- 1989
- [j2]Shmuel T. Klein
Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. ACM Trans. Inf. Syst. 7(3): 230-245 (1989) - [c5]Shmuel T. Klein
Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. SIGIR 1989: 160-167 - 1988
- [j1]Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein
The number of fixed points of the majority rule. Discret. Math. 70(3): 295-302 (1988) - [c4]Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein
Compression of Concordances in Full-Text Retrieval Systems. SIGIR 1988: 597-612 - 1987
- [c3]Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein
Improved Techniques for Processing Queries in Full-Text Systems. SIGIR 1987: 306-315 - 1986
- [c2]Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein
Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. SIGIR 1986: 88-96 - 1985
- [c1]Yaacov Choueka, Shmuel T. Klein
Efficient Variants of Huffman Codes in High Level Languages. SIGIR 1985: 122-130
Coauthor Index
[j65] [j64] [c100] [c99] [j63] [j62] [j61] [j60] [c98] [c97] [c96] [j59] [j58] [j57] [j56] [c95] [c94] [j55] [j54] [j53] [j52] [c93] [c92] [c91] [c90] [i2] [j51] [j50] [j49] [c89] [c88] [c87] [i1] [j48] [c86] [c85] [c84] [c83] [c82] [c80] [c79] [c78] [c77] [c76] [c75] [c74] [c73] [e1] [j47] [j46] [c72] [c71] [c70] [j43] [j42] [c69] [c68] [c66] [c65] [c63] [c62] [j40] [c60] [c59] [c58] [c57] [c56] [c55] [j36] [j35] [j34] [j33] [c52] [c49] [c47] [j28] [c44] [c43] [c42] [c41] [j24] [c37] [c35] [j21] [c32] [c31] [c26] [c23] [c20]
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-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: