Abraham Bookstein

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2006
52EEAbraham Bookstein, Henk Moed, Moshe Yitzahki: Measures of international collaboration in scientific literature: Part I. Inf. Process. Manage. 42(6): 1408-1421 (2006)
51EEAbraham Bookstein, Henk Moed, Moshe Yitzahki: Measures of international collaboration in scientific literature: Part II. Inf. Process. Manage. 42(6): 1422-1427 (2006)
2003
50EEAbraham Bookstein, Vladimir A. Kulyukin, Timo Raita, John Nicholson: Adapting measures of clumping strength to assess term-term similarity. JASIST 54(7): 611-620 (2003)
2002
49 Abraham Bookstein, Vladimir A. Kulyukin, Timo Raita: Generalized Hamming Distance. Inf. Retr. 5(4): 353-375 (2002)
2001
48EEAbraham Bookstein, Shmuel T. Klein, Timo Raita: Fuzzy Hamming Distance: A New Dissimilarity Measure. CPM 2001: 86-97
47 Abraham Bookstein: Implications of ambiguity for scientometric measurement. JASIST 52(1): 74-79 (2001)
46 Don R. Swanson, Neil R. Smalheiser, Abraham Bookstein: Information discovery from complementary literatures: Categorizing viruses as potential weapons. JASIST 52(10): 797-812 (2001)
45 Abraham Bookstein, Timo Raita: Discovering term occurrence structure in text. JASIST 52(6): 476-486 (2001)
2000
44 Abraham Bookstein, Shmuel T. Klein, Timo Raita: Simple Bayesian Model for Bitmap Compression. Inf. Retr. 1(4): 315-328 (2000)
1998
43 Abraham Bookstein, Shmuel T. Klein, Timo Raita: Clumping Properties of Content-Bearing Words. JASIS 49(2): 102-114 (1998)
1997
42 Abraham Bookstein, Shmuel T. Klein, Timo Raita: An Overhead Reduction Technique For Mega-State Compression Schemes. Data Compression Conference 1997: 367-376
41EEAbraham Bookstein, Shmuel T. Klein, Timo Raita: Modeling Word Occurrences for the Compression of Concordances. ACM Trans. Inf. Syst. 15(3): 254-290 (1997)
40 Abraham Bookstein, Shmuel T. Klein, Timo Raita: An overhead reduction technique for mega-state compression schemes. Inf. Process. Manage. 33(6): 745-760 (1997)
39 Abraham Bookstein: Informetric Distributions. III. Ambiguity and Randomness. JASIS 48(1): 2-10 (1997)
1996
38 Abraham Bookstein: Bibliocryptography. JASIS 47(12): 886-895 (1996)
1995
37EEAbraham Bookstein, Shmuel T. Klein, Timo Raita: Detecting Content-Bearing Words by Serial Clustering. SIGIR 1995: 319-327
1994
36 Abraham Bookstein, Shmuel T. Klein, Timo Raita: Markov Models for Clusters in Concordance Compression. Data Compression Conference 1994: 116-125
35 Abraham Bookstein, James A. Storer: Introduction to the Special Issue on Data Compression. Inf. Process. Manage. 30(6): 731-732 (1994)
1993
34 Abraham Bookstein, Shmuel T. Klein, Timo Raita, I. K. Ravichandra Rao, M. D. Patil: Can Random Fluctuation Be Exploited in Data Compression. Data Compression Conference 1993: 70-78
33EEAbraham Bookstein, Shmuel T. Klein, Timo Raita: Is Huffman Coding Dead? SIGIR 1993: 80-87
1992
32 Abraham Bookstein, Shmuel T. Klein, Timo Raita: Model Based Concordance Compression. Data Compression Conference 1992: 82-91
31 Abraham Bookstein, Edward O'Neill, Martin Dillon, David Stephens: Application of Loglinear Models to Informetric Phenomena. Inf. Process. Manage. 28(1): 75-88 (1992)
30 Abraham Bookstein, James A. Storer: Data Compression. Inf. Process. Manage. 28(6): 675-680 (1992)
29 Abraham Bookstein, Shmuel T. Klein: Models of Bitmap Generation: A Systematic Approach to Bitmap Compression. Inf. Process. Manage. 28(6): 735-748 (1992)
28 Abraham Bookstein, Shmuel T. Klein, Donald A. Ziff: A Systematic Approach to Compressing a Full-Text Retrieval System. Inf. Process. Manage. 28(6): 795- (1992)
1991
27 Abraham Bookstein, Yves Chiaramella, Gerard Salton, Vijay V. Raghavan: Proceedings of the 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Chicago, Illinois, USA, October 13-16, 1991 (Special Issue of the SIGIR Forum). ACM 1991
26 Abraham Bookstein, Shmuel T. Klein: Flexible Compression for Bitmap Sets. Data Compression Conference 1991: 402-410
25EEAbraham Bookstein, Shmuel T. Klein: Compression of a Set of Correlated Bitmaps. SIGIR 1991: 63-71
24 Abraham Bookstein, Shmuel T. Klein: Compression of correlated bit-vectors. Inf. Syst. 16(4): 387-400 (1991)
1990
23 Abraham Bookstein, Shmuel T. Klein: Information Retrieval Tools for Literary Analysis. DEXA 1990: 1-7
22EEAbraham Bookstein, Shmuel T. Klein: Construction of Optimal Graphs for Bit-Vector Compression. SIGIR 1990: 327-342
21EEAbraham Bookstein, Shmuel T. Klein: Compression, Information Theory, and Grammars: A Unified Approach. ACM Trans. Inf. Syst. 8(1): 27-49 (1990)
20EEAbraham Bookstein, Shmuel T. Klein: Using bitmaps for medium sized information retrieval systems. Inf. Process. Manage. 26(4): 525-533 (1990)
19 Abraham Bookstein: Informetric distributions, part I: Unified overview. JASIS 41(5): 368-375 (1990)
18 Abraham Bookstein: Informetric distributions, part II: Resilience to ambiguity. JASIS 41(5): 376-386 (1990)
1989
17EEShmuel T. Klein, Abraham Bookstein, Scott C. Deerwester: Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. SIGIR 1989: 160-167
16EEShmuel T. Klein, Abraham Bookstein, Scott C. Deerwester: Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. ACM Trans. Inf. Syst. 7(3): 230-245 (1989)
15EEAbraham Bookstein: Set-oriented retrieval. Inf. Process. Manage. 25(5): 465-475 (1989)
1988
14EEAbraham Bookstein: Set Oriented Retrieval. SIGIR 1988: 583-596
13EERobert M. Losee, Abraham Bookstein: Integrating Boolean queries in conjunctive normal form with probabilistic retrieval models. Inf. Process. Manage. 24(3): 315-321 (1988)
1987
12 Paul B. Kantor, Abraham Bookstein, Martin Dillon, Tefko Saracevic: Clustering of Concepts for Optimal Retrieval. SIGIR 1987: 316
1986
11EEAbraham Bookstein: Performance of Self-Taught Documents: Exploiting Co-Relevance Structure in a Document Collection. SIGIR 1986: 244-248
10EERobert M. Losee, Abraham Bookstein, Clement T. Yu: Probabilistic Models for Document Retrieval: A Comparison of Performance on Experimental and Synthetic Databases. SIGIR 1986: 258-264
1985
9 Abraham Bookstein: Implications of Boolean Structures for Probabilistic Retrieval. SIGIR 1985: 11-17
1982
8 Abraham Bookstein: Explanation and Generalization of Vector Models in Information Retrieval. SIGIR 1982: 118-132
1981
7EEAbraham Bookstein: The Generalized Retrieval Problem. SIGIR 1981: 4-14
1980
6EEAbraham Bookstein: A Comparison of Two Weighting Schemes for Boolean Retrieval. SIGIR 1980: 23-34
1977
5EEAbraham Bookstein: When the most "pertinent" document should not be retrieved - An analysis of the Swets model. Inf. Process. Manage. 13(6): 377-383 (1977)
4EEAbraham Bookstein, Donald H. Kraft: Operations Research Applied to Document Indexing and Retrieval Decisions. J. ACM 24(3): 418-427 (1977)
1976
3EEAbraham Bookstein, Gary Fouty: A mathematical model for estimating the effectiveness of bigram coding. Inf. Process. Manage. 12(2): 111-116 (1976)
1975
2EEAbraham Bookstein: Optimal loan periods. Inf. Process. Manage. 11(8-12): 235-242 (1975)
1973
1 Abraham Bookstein: On Harrison's Substring Testing Technique. Commun. ACM 16(3): 180-181 (1973)

Coauthor Index

1Yves Chiaramella [27]
2Scott C. Deerwester [16] [17]
3Martin Dillon [12] [31]
4Gary Fouty [3]
5Paul B. Kantor [12]
6Shmuel Tomi Klein (Shmuel T. Klein) [16] [17] [20] [21] [22] [23] [24] [25] [26] [28] [29] [32] [33] [34] [36] [37] [40] [41] [42] [43] [44] [48]
7Donald H. Kraft [4]
8Vladimir A. Kulyukin [49] [50]
9Robert M. Losee [10] [13]
10Henk Moed [51] [52]
11John Nicholson [50]
12Edward O'Neill [31]
13M. D. Patil [34]
14Vijay V. Raghavan (Vijay Raghavan) [27]
15Timo Raita [32] [33] [34] [36] [37] [40] [41] [42] [43] [44] [45] [48] [49] [50]
16I. K. Ravichandra Rao [34]
17Gerard Salton [27]
18Tefko Saracevic [12]
19Neil R. Smalheiser [46]
20David Stephens [31]
21James A. Storer [30] [35]
22Don R. Swanson [46]
23Moshe Yitzahki [51] [52]
24Clement T. Yu [10]
25Donald A. Ziff [28]

Colors in the list of coauthors

Copyright © Fri Oct 3 18:41:27 2008 by Michael Ley (ley@uni-trier.de)