James K. Mullin

According to our database1, James K. Mullin authored at least 18 papers between 1970 and 1993.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1993
Estimating the size of a relational join.
Inf. Syst., 1993

1992
Hash Functions for Hash-based Join Methods.
Comput. J., 1992

1991
A Caution on Universal Classes of Hash Functions.
Inf. Process. Lett., 1991

1990
Optimal Semijoins for Distributed Database Systems.
IEEE Trans. Software Eng., 1990

A Tale of Three Spelling Checkers.
Softw. Pract. Exp., 1990

1987
Accessing Textual Documents Using Compressed Indexes of Arrays of Small Bloom Filters.
Comput. J., 1987

1985
Spiral Storage: Efficient Dynamic Hashing with Constant Performance.
Comput. J., 1985

1984
Unified Dynamic Hashing.
Proceedings of the Tenth International Conference on Very Large Data Bases, 1984

1983
A Second Look at Bloom Filters.
Commun. ACM, 1983

1982
Interfacing criteria for recognition logic used with a context post-processor.
Pattern Recognit., 1982

1981
Reliable Indexing Using Unreliable Recognition Devices.
IEEE Trans. Pattern Anal. Mach. Intell., 1981

Change Area B-Trees: A Technique to Aid Error Recovery.
Comput. J., 1981

Tightly Controlled Linear Hashing without Separate Overflow Storage.
BIT, 1981

1974
Optimum Blocking Factors for a Mix of Sequentially Processed Jobs.
Comput. J., 1974

Simulated demand in large-scale batch processor acquisitions: Role and justification.
Proceedings of the 2nd Symposium on Simulation of Computer Systems, 1974

1972
An Improved Index Sequential Access Method Using Hashed Overflow.
Commun. ACM, 1972

1971
Retrieval-Update Speed Tradeoffs Using Combined Indices.
Commun. ACM, 1971

1970
Problems of Building a Hybrid Data Definition Facility.
Proceedings of the Record of the 1970 ACM SIGFIDET Workshop on Data Description and Access, 1970


  Loading...