Problems of Building a Hybrid Data Definition Facility. - J. W. Dempsey; James K. Mullin (SIGFIDET Workshop, 1970)

Retrieval-Update Speed Tradeoffs Using Combined Indices. - James K. Mullin (Commun. ACM, 1971)

An Improved Index Sequential Access Method Using Hashed Overflow. - James K. Mullin (Commun. ACM, 1972)

Simulated demand in large-scale batch processor acquisitions: Role and justification. - Ross T. Newkirk; James K. Mullin (ANSS, 1974)

Optimum Blocking Factors for a Mix of Sequentially Processed Jobs. - James K. Mullin; G. F. Stuart (Comput. J., 1974)

Tightly Controlled Linear Hashing without Separate Overflow Storage. - James K. Mullin (BIT, 1981)

Change Area B-Trees: A Technique to Aid Error Recovery. - James K. Mullin (Comput. J., 1981)

Reliable Indexing Using Unreliable Recognition Devices. - James K. Mullin (IEEE Trans. Pattern Anal. Mach. Intell., 1981)

Interfacing criteria for recognition logic used with a context post-processor. - James K. Mullin (Pattern Recognit., 1982)

A Second Look at Bloom Filters. - James K. Mullin (Commun. ACM, 1983)

Unified Dynamic Hashing. - James K. Mullin (VLDB, 1984)

Spiral Storage: Efficient Dynamic Hashing with Constant Performance. - James K. Mullin (Comput. J., 1985)

Accessing Textual Documents Using Compressed Indexes of Arrays of Small Bloom Filters. - James K. Mullin (Comput. J., 1987)

A Tale of Three Spelling Checkers. - James K. Mullin; Daniel J. Margoliash (Softw. Pract. Exp., 1990)

Optimal Semijoins for Distributed Database Systems. - James K. Mullin (IEEE Trans. Software Eng., 1990)

A Caution on Universal Classes of Hash Functions. - James K. Mullin (Inf. Process. Lett., 1991)

Hash Functions for Hash-based Join Methods. - James K. Mullin (Comput. J., 1992)

Estimating the size of a relational join. - James K. Mullin (Inf. Syst., 1993)