The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shmuel T. Klein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Abraham Bookstein, Shmuel T. Klein
    Compression of a Set of Correlated Bitmaps. [Citation Graph (2, 0)][DBLP]
    SIGIR, 1991, pp:63-71 [Conf]
  2. Abraham Bookstein, Shmuel T. Klein, Donald A. Ziff
    A Systematic Approach to Compressing a Full-Text Retrieval System. [Citation Graph (2, 0)][DBLP]
    Inf. Process. Manage., 1992, v:28, n:6, pp:795-0 [Journal]
  3. Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein
    Compression of Concordances in Full-Text Retrieval Systems. [Citation Graph (1, 0)][DBLP]
    SIGIR, 1988, pp:597-612 [Conf]
  4. Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal
    Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. [Citation Graph (1, 0)][DBLP]
    SIGIR, 1986, pp:88-96 [Conf]
  5. Alistair Moffat, Justin Zobel, Shmuel T. Klein
    Improved Inverted File Processing for Large Text Databases. [Citation Graph (0, 0)][DBLP]
    Australasian Database Conference, 1995, pp:0-0 [Conf]
  6. Abraham Bookstein, Shmuel T. Klein, Timo Raita
    Fuzzy Hamming Distance: A New Dissimilarity Measure. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:86-97 [Conf]
  7. Shmuel T. Klein
    Improving Static Compression Schemes by Alphabet Extension. [Citation Graph (0, 0)][DBLP]
    CPM, 2000, pp:210-221 [Conf]
  8. Shmuel T. Klein
    Space- and Time-Efficient Decoding with Canonical Huffman Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:65-75 [Conf]
  9. Eyal Bergman, Shmuel T. Klein
    Fast Decoding of Prefix Encoded Texts. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:143-152 [Conf]
  10. Abraham Bookstein, Shmuel T. Klein
    Flexible Compression for Bitmap Sets. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1991, pp:402-410 [Conf]
  11. Abraham Bookstein, Shmuel T. Klein, Timo Raita
    Model Based Concordance Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1992, pp:82-91 [Conf]
  12. Abraham Bookstein, Shmuel T. Klein, Timo Raita
    Markov Models for Clusters in Concordance Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1994, pp:116-125 [Conf]
  13. Abraham Bookstein, Shmuel T. Klein, Timo Raita
    An Overhead Reduction Technique For Mega-State Compression Schemes. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1997, pp:367-376 [Conf]
  14. Abraham Bookstein, Shmuel T. Klein, Timo Raita, I. K. Ravichandra Rao, M. D. Patil
    Can Random Fluctuation Be Exploited in Data Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1993, pp:70-78 [Conf]
  15. Yair Kaufman, Shmuel T. Klein
    An Efficient Compression Scheme Supporting Partial Decoding. [Citation Graph (0, 0)][DBLP]
    DCC, 2003, pp:433- [Conf]
  16. Yair Kaufman, Shmuel T. Klein
    Semi-Lossless Text Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2004, pp:544- [Conf]
  17. Shmuel T. Klein, Dana Shapira
    A New Compression Method for Compressed Matching. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2000, pp:400-409 [Conf]
  18. Shmuel T. Klein, Dana Shapira
    Pattern Matching in Huffman Encoded Texts. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2001, pp:449-458 [Conf]
  19. Shmuel T. Klein, Dana Shapira
    Searching in Compressed Dictionaries. [Citation Graph (0, 0)][DBLP]
    DCC, 2002, pp:142-0 [Conf]
  20. Shmuel T. Klein
    Fast Decoding of Fibonacci Encoded Texts. [Citation Graph (0, 0)][DBLP]
    DCC, 2007, pp:388- [Conf]
  21. Shmuel T. Klein, Dana Shapira
    Compressed Delta Encoding for LZSS Encoded Files. [Citation Graph (0, 0)][DBLP]
    DCC, 2007, pp:113-122 [Conf]
  22. Abraham Bookstein, Shmuel T. Klein
    Information Retrieval Tools for Literary Analysis. [Citation Graph (0, 0)][DBLP]
    DEXA, 1990, pp:1-7 [Conf]
  23. Abraham Bookstein, Shmuel T. Klein
    Construction of Optimal Graphs for Bit-Vector Compression. [Citation Graph (0, 0)][DBLP]
    SIGIR, 1990, pp:327-342 [Conf]
  24. Abraham Bookstein, Shmuel T. Klein, Timo Raita
    Is Huffman Coding Dead? [Citation Graph (0, 0)][DBLP]
    SIGIR, 1993, pp:80-87 [Conf]
  25. Abraham Bookstein, Shmuel T. Klein, Timo Raita
    Detecting Content-Bearing Words by Serial Clustering. [Citation Graph (0, 0)][DBLP]
    SIGIR, 1995, pp:319-327 [Conf]
  26. Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein, E. Segal
    Improved Techniques for Processing Queries in Full-Text Systems. [Citation Graph (0, 0)][DBLP]
    SIGIR, 1987, pp:306-315 [Conf]
  27. Yaacov Choueka, Shmuel T. Klein, Yehoshua Perl
    Efficient Variants of Huffman Codes in High Level Languages. [Citation Graph (0, 0)][DBLP]
    SIGIR, 1985, pp:122-130 [Conf]
  28. Shmuel T. Klein
    Efficient Recompression Techniques for Dynamic Full-Text Retrieval Systems. [Citation Graph (0, 0)][DBLP]
    SIGIR, 1995, pp:39-47 [Conf]
  29. Shmuel T. Klein, Abraham Bookstein, Scott C. Deerwester
    Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. [Citation Graph (0, 0)][DBLP]
    SIGIR, 1989, pp:160-167 [Conf]
  30. Shmuel T. Klein, B. Riva Shalom
    Searching for a Set of Correlated Patterns. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:68-69 [Conf]
  31. Yair Kaufman, Shmuel T. Klein
    Semi-Lossless Text Compression. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:114-123 [Conf]
  32. Aviezri S. Fraenkel, Shmuel T. Klein
    Complexity Aspects of Guessing Prefix Codes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:4/5, pp:409-419 [Journal]
  33. Aviezri S. Fraenkel, Shmuel T. Klein
    Bidirectional Huffman Coding. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1990, v:33, n:4, pp:296-307 [Journal]
  34. Aviezri S. Fraenkel, Shmuel T. Klein
    Bounding the Depth of Search Trees. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1993, v:36, n:7, pp:668-678 [Journal]
  35. Shmuel T. Klein
    Efficient Optimal Recompression. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1997, v:40, n:2/3, pp:117-126 [Journal]
  36. Aviezri S. Fraenkel, Shmuel T. Klein
    Robust Universal Complete Codes for Transmission and Compression. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:1, pp:31-55 [Journal]
  37. Yair Kaufman, Shmuel T. Klein
    Semi-lossless text compression. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1167-1178 [Journal]
  38. Shmuel T. Klein, Dana Shapira
    Compressed Pattern Matching in Jpeg Images. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1297-1306 [Journal]
  39. Abraham Bookstein, Shmuel T. Klein
    Using bitmaps for medium sized information retrieval systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Manage., 1990, v:26, n:4, pp:525-533 [Journal]
  40. Abraham Bookstein, Shmuel T. Klein
    Models of Bitmap Generation: A Systematic Approach to Bitmap Compression. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Manage., 1992, v:28, n:6, pp:735-748 [Journal]
  41. Abraham Bookstein, Shmuel T. Klein, Timo Raita
    An overhead reduction technique for mega-state compression schemes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Manage., 1997, v:33, n:6, pp:745-760 [Journal]
  42. Abraham Bookstein, Shmuel T. Klein, Timo Raita
    Simple Bayesian Model for Bitmap Compression. [Citation Graph (0, 0)][DBLP]
    Inf. Retr., 2000, v:1, n:4, pp:315-328 [Journal]
  43. Shmuel T. Klein
    Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts. [Citation Graph (0, 0)][DBLP]
    Inf. Retr., 2000, v:3, n:1, pp:7-23 [Journal]
  44. Abraham Bookstein, Shmuel T. Klein
    Compression of correlated bit-vectors. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1991, v:16, n:4, pp:387-400 [Journal]
  45. Abraham Bookstein, Shmuel T. Klein, Timo Raita
    Clumping Properties of Content-Bearing Words. [Citation Graph (0, 0)][DBLP]
    JASIS, 1998, v:49, n:2, pp:102-114 [Journal]
  46. Aviezri S. Fraenkel, Shmuel T. Klein
    Information Retrieval from Annotated Texts. [Citation Graph (0, 0)][DBLP]
    JASIS, 1999, v:50, n:10, pp:845-854 [Journal]
  47. Shmuel T. Klein, B. Riva Shalom, Yair Kaufman
    Searching for a set of correlated patterns. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:149-161 [Journal]
  48. Abraham Bookstein, Shmuel T. Klein
    Compression, Information Theory, and Grammars: A Unified Approach. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Inf. Syst., 1990, v:8, n:1, pp:27-49 [Journal]
  49. Abraham Bookstein, Shmuel T. Klein, Timo Raita
    Modeling Word Occurrences for the Compression of Concordances. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Inf. Syst., 1997, v:15, n:3, pp:254-290 [Journal]
  50. Shmuel T. Klein, Abraham Bookstein, Scott C. Deerwester
    Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Inf. Syst., 1989, v:7, n:3, pp:230-245 [Journal]
  51. Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein
    The number of fixed points of the majority rule. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:70, n:3, pp:295-302 [Journal]

  52. The design of a similarity based deduplication system. [Citation Graph (, )][DBLP]


Search in 0.027secs, Finished in 0.028secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002