Double hashing. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1972)

On Harrison's Substring Testing Technique. - Abraham Bookstein (Commun. ACM, 1973)

Allocation of resources in an information system. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1974)

Hash coding with a non-unique search key. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1974)

Probabilistic models for automatic indexing. - Abraham Bookstein; Don R. Swanson (J. Am. Soc. Inf. Sci., 1974)

Optimal loan periods. - Abraham Bookstein (Inf. Process. Manag., 1975)

A decision theoretic foundation for indexing. - Abraham Bookstein; Don R. Swanson (J. Am. Soc. Inf. Sci., 1975)

A mathematical model for estimating the effectiveness of bigram coding. - Abraham Bookstein; Gary Fouty (Inf. Process. Manag., 1976)

When the most "pertinent" document should not be retrieved - An analysis of the Swets model. - Abraham Bookstein (Inf. Process. Manag., 1977)

Operations Research Applied to Document Indexing and Retrieval Decisions. - Abraham Bookstein; Donald H. Kraft (J. ACM, 1977)

On the perils of merging boolean and weighted retrieval systems. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1978)

Evaluation of information retrieval systems: A decision theory approach. - Donald H. Kraft; Abraham Bookstein (J. Am. Soc. Inf. Sci., 1978)

A Comparison of Two Weighting Schemes for Boolean Retrieval. - Abraham Bookstein (SIGIR, 1980)

Fuzzy requests: An approach to weighted boolean searches. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1980)

The Generalized Retrieval Problem. - Abraham Bookstein (SIGIR, 1981)

A comparison of two systems of weighted boolean retrieval. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1981)

Explanation and Generalization of Vector Models in Information Retrieval. - Abraham Bookstein (SIGIR, 1982)

Information retrieval: A sequential learning process. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1983)

Outline of a General Probabilistic Retrieval Model. - Abraham Bookstein (J. Documentation, 1983)

Representing boolean structure within a probabilistic framework. - Abraham Bookstein (RIAO, 1985)

Implications of Boolean Structures for Probabilistic Retrieval. - Abraham Bookstein (SIGIR, 1985)

Performance of Self-Taught Documents: Exploiting Co-Relevance Structure in a Document Collection. - Abraham Bookstein (SIGIR, 1986)

Probabilistic Models for Document Retrieval: A Comparison of Performance on Experimental and Synthetic Databases. - Robert M. Losee; Abraham Bookstein; Clement T. Yu (SIGIR, 1986)

Clustering of Concepts for Optimal Retrieval. - Paul B. Kantor; Abraham Bookstein; Martin Dillon; Tefko Saracevic (SIGIR, 1987)

Integrating Boolean queries in conjunctive normal form with probabilistic retrieval models. - Robert M. Losee; Abraham Bookstein (Inf. Process. Manag., 1988)

Set-oriented retrieval. - Abraham Bookstein (Inf. Process. Manag., 1989)

Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations. - Shmuel T. Klein; Abraham Bookstein; Scott C. Deerwester (ACM Trans. Inf. Syst., 1989)

Information Retrieval Tools for Literary Analysis. - Abraham Bookstein; Shmuel T. Klein (DEXA, 1990)

Construction of Optimal Graphs for Bit-Vector Compression. - Abraham Bookstein; Shmuel T. Klein (SIGIR, 1990)

Using bitmaps for medium sized information retrieval systems. - Abraham Bookstein; Shmuel T. Klein (Inf. Process. Manag., 1990)

Informetric distributions, part I: Unified overview. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1990)

Informetric distributions, part II: Resilience to ambiguity. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1990)

Compression, Information Theory, and Grammars: A Unified Approach. - Abraham Bookstein; Shmuel T. Klein (ACM Trans. Inf. Syst., 1990)

Flexible Compression for Bitmap Sets. - Abraham Bookstein; Shmuel T. Klein (Data Compression Conference, 1991)

The ARTFL data compression project. - Abraham Bookstein; Shmuel Tomi Klein; Donald A. Ziff (RIAO, 1991)

Compression of a Set of Correlated Bitmaps. - Abraham Bookstein; Shmuel T. Klein (SIGIR, 1991)

Compression of correlated bit-vectors. - Abraham Bookstein; Shmuel T. Klein (Inf. Syst., 1991)

Model Based Concordance Compression. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (Data Compression Conference, 1992)

Models of Bitmap Generation: A Systematic Approach to Bitmap Compression. - Abraham Bookstein; Shmuel T. Klein (Inf. Process. Manag., 1992)

A Systematic Approach to Compressing a Full-Text Retrieval System. - Abraham Bookstein; Shmuel T. Klein; Donald A. Ziff (Inf. Process. Manag., 1992)

Application of Loglinear Models to Informetric Phenomena. - Abraham Bookstein; Edward T. O'Neill; Martin Dillon; David Stephens (Inf. Process. Manag., 1992)

Data Compression. - Abraham Bookstein; James A. Storer (Inf. Process. Manag., 1992)

Can Random Fluctuation Be Exploited in Data Compression. - Abraham Bookstein; Shmuel T. Klein; Timo Raita; I. K. Ravichandra Rao; M. D. Patil (Data Compression Conference, 1993)

Is Huffman Coding Dead? - Abraham Bookstein; Shmuel T. Klein; Timo Raita (SIGIR, 1993)

Is Huffman coding dead? - Abraham Bookstein; Shmuel Tomi Klein (Computing, 1993)

Markov Models for Clusters in Concordance Compression. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (Data Compression Conference, 1994)

Introduction to the Special Issue on Data Compression. - Abraham Bookstein; James A. Storer (Inf. Process. Manag., 1994)

Towards a multi-disciplinary Bradford law. - Abraham Bookstein (Scientometrics, 1994)

Scientometrics: New opportunities. - Abraham Bookstein (Scientometrics, 1994)

Detecting Content-Bearing Words by Serial Clustering. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (SIGIR, 1995)

Bibliocryptography. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1996)

An overhead reduction technique for mega-state compression schemes. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (Inf. Process. Manag., 1997)

Informetric Distributions. III. Ambiguity and Randomness. - Abraham Bookstein (J. Am. Soc. Inf. Sci., 1997)

Ambiguity in measurement. - Abraham Bookstein; Benjamin D. Wright (Scientometrics, 1997)

Modeling Word Occurrences for the Compression of Concordances. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (ACM Trans. Inf. Syst., 1997)

Clumping Properties of Content-Bearing Words. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (J. Am. Soc. Inf. Sci., 1998)

Own-language preference: A new measure of "relative language self-citation". - Abraham Bookstein; Moshe Yitzhaki (Scientometrics, 1999)

Simple Bayesian Model for Bitmap Compression. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (Inf. Retr., 2000)

Fuzzy Hamming Distance: A New Dissimilarity Measure. - Abraham Bookstein; Shmuel T. Klein; Timo Raita (CPM, 2001)

Implications of ambiguity for scientometric measurement. - Abraham Bookstein (J. Assoc. Inf. Sci. Technol., 2001)

Discovering term occurrence structure in text. - Abraham Bookstein; Timo Raita (J. Assoc. Inf. Sci. Technol., 2001)

Information discovery from complementary literatures: Categorizing viruses as potential weapons. - Don R. Swanson; Neil R. Smalheiser; Abraham Bookstein (J. Assoc. Inf. Sci. Technol., 2001)

Generalized Hamming Distance. - Abraham Bookstein; Vladimir A. Kulyukin; Timo Raita (Inf. Retr., 2002)

Adapting measures of clumping strength to assess term-term similarity. - Abraham Bookstein; Vladimir A. Kulyukin; Timo Raita; John Nicholson (J. Assoc. Inf. Sci. Technol., 2003)

Measures of international collaboration in scientific literature: Part I. - Abraham Bookstein; Henk F. Moed; Moshe Yitzhaki (Inf. Process. Manag., 2006)

Measures of international collaboration in scientific literature: Part II. - Abraham Bookstein; Henk F. Moed; Moshe Yitzhaki (Inf. Process. Manag., 2006)

In memoriam. - Abraham Bookstein (J. Assoc. Inf. Sci. Technol., 2013)