default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbraham Bookstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j48]Abraham Bookstein:
In memoriam. J. Assoc. Inf. Sci. Technol. 64(5): 1086-1088 (2013)
2000 – 2009
- 2006
- [j47]Abraham Bookstein, Henk F. Moed, Moshe Yitzhaki:
Measures of international collaboration in scientific literature: Part I. Inf. Process. Manag. 42(6): 1408-1421 (2006) - [j46]Abraham Bookstein, Henk F. Moed, Moshe Yitzhaki:
Measures of international collaboration in scientific literature: Part II. Inf. Process. Manag. 42(6): 1422-1427 (2006) - 2003
- [j45]Abraham Bookstein, Vladimir A. Kulyukin, Timo Raita, John Nicholson:
Adapting measures of clumping strength to assess term-term similarity. J. Assoc. Inf. Sci. Technol. 54(7): 611-620 (2003) - 2002
- [j44]Abraham Bookstein, Vladimir A. Kulyukin, Timo Raita:
Generalized Hamming Distance. Inf. Retr. 5(4): 353-375 (2002) - 2001
- [j43]Abraham Bookstein:
Implications of ambiguity for scientometric measurement. J. Assoc. Inf. Sci. Technol. 52(1): 74-79 (2001) - [j42]Abraham Bookstein, Timo Raita:
Discovering term occurrence structure in text. J. Assoc. Inf. Sci. Technol. 52(6): 476-486 (2001) - [j41]Don R. Swanson, Neil R. Smalheiser
, Abraham Bookstein:
Information discovery from complementary literatures: Categorizing viruses as potential weapons. J. Assoc. Inf. Sci. Technol. 52(10): 797-812 (2001) - [c22]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Fuzzy Hamming Distance: A New Dissimilarity Measure. CPM 2001: 86-97 - 2000
- [j40]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Simple Bayesian Model for Bitmap Compression. Inf. Retr. 1(4): 315-328 (2000)
1990 – 1999
- 1999
- [j39]Abraham Bookstein, Moshe Yitzhaki:
Own-language preference: A new measure of "relative language self-citation". Scientometrics 46(2): 337-348 (1999) - 1998
- [j38]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Clumping Properties of Content-Bearing Words. J. Am. Soc. Inf. Sci. 49(2): 102-114 (1998) - 1997
- [j37]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
An overhead reduction technique for mega-state compression schemes. Inf. Process. Manag. 33(6): 745-760 (1997) - [j36]Abraham Bookstein:
Informetric Distributions. III. Ambiguity and Randomness. J. Am. Soc. Inf. Sci. 48(1): 2-10 (1997) - [j35]Abraham Bookstein, Benjamin D. Wright:
Ambiguity in measurement. Scientometrics 40(3): 369-384 (1997) - [j34]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Modeling Word Occurrences for the Compression of Concordances. ACM Trans. Inf. Syst. 15(3): 254-290 (1997) - [c21]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
An Overhead Reduction Technique For Mega-State Compression Schemes. Data Compression Conference 1997: 367-376 - 1996
- [j33]Abraham Bookstein:
Bibliocryptography. J. Am. Soc. Inf. Sci. 47(12): 886-895 (1996) - 1995
- [c20]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Detecting Content-Bearing Words by Serial Clustering. SIGIR 1995: 319-327 - 1994
- [j32]Abraham Bookstein, James A. Storer:
Introduction to the Special Issue on Data Compression. Inf. Process. Manag. 30(6): 731-732 (1994) - [j31]Abraham Bookstein:
Towards a multi-disciplinary Bradford law. Scientometrics 30(1): 353-361 (1994) - [j30]Abraham Bookstein:
Scientometrics: New opportunities. Scientometrics 30(2-3): 455-460 (1994) - [c19]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Markov Models for Clusters in Concordance Compression. Data Compression Conference 1994: 116-125 - 1993
- [j29]Abraham Bookstein, Shmuel Tomi Klein:
Is Huffman coding dead? Computing 50(4): 279-296 (1993) - [c18]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 - [c17]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Is Huffman Coding Dead? SIGIR 1993: 80-87 - 1992
- [j28]Abraham Bookstein, Edward T. O'Neill, Martin Dillon, David Stephens:
Application of Loglinear Models to Informetric Phenomena. Inf. Process. Manag. 28(1): 75-88 (1992) - [j27]Abraham Bookstein, James A. Storer:
Data Compression. Inf. Process. Manag. 28(6): 675-680 (1992) - [j26]Abraham Bookstein, Shmuel T. Klein:
Models of Bitmap Generation: A Systematic Approach to Bitmap Compression. Inf. Process. Manag. 28(6): 735-748 (1992) - [j25]Abraham Bookstein, Shmuel T. Klein, Donald A. Ziff:
A Systematic Approach to Compressing a Full-Text Retrieval System. Inf. Process. Manag. 28(6): 795-806 (1992) - [c16]Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Model Based Concordance Compression. Data Compression Conference 1992: 82-91 - 1991
- [j24]Abraham Bookstein, Shmuel T. Klein:
Compression of correlated bit-vectors. Inf. Syst. 16(4): 387-400 (1991) - [c15]Abraham Bookstein, Shmuel T. Klein:
Flexible Compression for Bitmap Sets. Data Compression Conference 1991: 402-410 - [c14]Abraham Bookstein, Shmuel Tomi Klein, Donald A. Ziff:
The ARTFL data compression project. RIAO 1991: 967-985 - [c13]Abraham Bookstein, Shmuel T. Klein:
Compression of a Set of Correlated Bitmaps. SIGIR 1991: 63-71 - [e1]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, ISBN 0-89791-448-1 [contents] - 1990
- [j23]Abraham Bookstein, Shmuel T. Klein:
Using bitmaps for medium sized information retrieval systems. Inf. Process. Manag. 26(4): 525-533 (1990) - [j22]Abraham Bookstein:
Informetric distributions, part I: Unified overview. J. Am. Soc. Inf. Sci. 41(5): 368-375 (1990) - [j21]Abraham Bookstein:
Informetric distributions, part II: Resilience to ambiguity. J. Am. Soc. Inf. Sci. 41(5): 376-386 (1990) - [j20]Abraham Bookstein, Shmuel T. Klein:
Compression, Information Theory, and Grammars: A Unified Approach. ACM Trans. Inf. Syst. 8(1): 27-49 (1990) - [c12]Abraham Bookstein, Shmuel T. Klein:
Information Retrieval Tools for Literary Analysis. DEXA 1990: 1-7 - [c11]Abraham Bookstein, Shmuel T. Klein:
Construction of Optimal Graphs for Bit-Vector Compression. SIGIR 1990: 327-342
1980 – 1989
- 1989
- [j19]Abraham Bookstein:
Set-oriented retrieval. Inf. Process. Manag. 25(5): 465-475 (1989) - [j18]Shmuel 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) - [c10]Shmuel T. Klein, Abraham Bookstein, Scott C. Deerwester:
Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. SIGIR 1989: 160-167 - 1988
- [j17]Robert M. Losee, Abraham Bookstein:
Integrating Boolean queries in conjunctive normal form with probabilistic retrieval models. Inf. Process. Manag. 24(3): 315-321 (1988) - [c9]Abraham Bookstein:
Set Oriented Retrieval. SIGIR 1988: 583-596 - 1987
- [c8]Paul B. Kantor, Abraham Bookstein, Martin Dillon, Tefko Saracevic:
Clustering of Concepts for Optimal Retrieval. SIGIR 1987: 316 - 1986
- [c7]Abraham Bookstein:
Performance of Self-Taught Documents: Exploiting Co-Relevance Structure in a Document Collection. SIGIR 1986: 244-248 - [c6]Robert 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
- [c5]Abraham Bookstein:
Representing boolean structure within a probabilistic framework. RIAO 1985: 373-386 - [c4]Abraham Bookstein:
Implications of Boolean Structures for Probabilistic Retrieval. SIGIR 1985: 11-17 - 1983
- [j16]Abraham Bookstein:
Information retrieval: A sequential learning process. J. Am. Soc. Inf. Sci. 34(5): 331-342 (1983) - [j15]Abraham Bookstein:
Outline of a General Probabilistic Retrieval Model. J. Documentation 39(2): 63-72 (1983) - 1982
- [c3]Abraham Bookstein:
Explanation and Generalization of Vector Models in Information Retrieval. SIGIR 1982: 118-132 - 1981
- [j14]Abraham Bookstein:
A comparison of two systems of weighted boolean retrieval. J. Am. Soc. Inf. Sci. 32(4): 275-279 (1981) - [c2]Abraham Bookstein:
The Generalized Retrieval Problem. SIGIR 1981: 4-14 - 1980
- [j13]Abraham Bookstein:
Fuzzy requests: An approach to weighted boolean searches. J. Am. Soc. Inf. Sci. 31(4): 240-247 (1980) - [c1]Abraham Bookstein:
A Comparison of Two Weighting Schemes for Boolean Retrieval. SIGIR 1980: 23-34
1970 – 1979
- 1978
- [j12]Donald H. Kraft, Abraham Bookstein:
Evaluation of information retrieval systems: A decision theory approach. J. Am. Soc. Inf. Sci. 29(1): 31-40 (1978) - [j11]Abraham Bookstein:
On the perils of merging boolean and weighted retrieval systems. J. Am. Soc. Inf. Sci. 29(3): 156-158 (1978) - 1977
- [j10]Abraham Bookstein:
When the most "pertinent" document should not be retrieved - An analysis of the Swets model. Inf. Process. Manag. 13(6): 377-383 (1977) - [j9]Abraham Bookstein, Donald H. Kraft:
Operations Research Applied to Document Indexing and Retrieval Decisions. J. ACM 24(3): 418-427 (1977) - 1976
- [j8]Abraham Bookstein, Gary Fouty:
A mathematical model for estimating the effectiveness of bigram coding. Inf. Process. Manag. 12(2): 111-116 (1976) - 1975
- [j7]Abraham Bookstein:
Optimal loan periods. Inf. Process. Manag. 11(8-12): 235-242 (1975) - [j6]Abraham Bookstein, Don R. Swanson:
A decision theoretic foundation for indexing. J. Am. Soc. Inf. Sci. 26(1): 45-50 (1975) - 1974
- [j5]Abraham Bookstein:
Allocation of resources in an information system. J. Am. Soc. Inf. Sci. 25(1): 52-58 (1974) - [j4]Abraham Bookstein:
Hash coding with a non-unique search key. J. Am. Soc. Inf. Sci. 25(4): 232-236 (1974) - [j3]Abraham Bookstein, Don R. Swanson:
Probabilistic models for automatic indexing. J. Am. Soc. Inf. Sci. 25(5): 312-316 (1974) - 1973
- [j2]Abraham Bookstein:
On Harrison's Substring Testing Technique. Commun. ACM 16(3): 180-181 (1973) - 1972
- [j1]Abraham Bookstein:
Double hashing. J. Am. Soc. Inf. Sci. 23(6): 402-405 (1972)
Coauthor Index
aka: Shmuel T. Klein
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-08-05 20:16 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:
