The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
James K. Mullin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James K. Mullin
    Tightly Controlled Linear Hashing without Separate Overflow Storage. [Citation Graph (12, 0)][DBLP]
    BIT, 1981, v:21, n:4, pp:390-400 [Journal]
  2. James K. Mullin
    Optimal Semijoins for Distributed Database Systems. [Citation Graph (5, 0)][DBLP]
    IEEE Trans. Software Eng., 1990, v:16, n:5, pp:558-560 [Journal]
  3. James K. Mullin
    Unified Dynamic Hashing. [Citation Graph (3, 4)][DBLP]
    VLDB, 1984, pp:473-480 [Conf]
  4. James K. Mullin
    A Second Look at Bloom Filters. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1983, v:26, n:8, pp:570-571 [Journal]
  5. James K. Mullin
    Spiral Storage: Efficient Dynamic Hashing with Constant Performance. [Citation Graph (2, 0)][DBLP]
    Comput. J., 1985, v:28, n:3, pp:330-334 [Journal]
  6. James K. Mullin
    Retrieval-Update Speed Tradeoffs Using Combined Indices. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1971, v:14, n:12, pp:775-776 [Journal]
  7. James K. Mullin
    An Improved Index Sequential Access Method Using Hashed Overflow. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1972, v:15, n:5, pp:301-307 [Journal]
  8. James K. Mullin
    Change Area B-Trees: A Technique to Aid Error Recovery. [Citation Graph (1, 0)][DBLP]
    Comput. J., 1981, v:24, n:4, pp:367-373 [Journal]
  9. J. W. Dempsey, James K. Mullin
    Problems of Building a Hybrid Data Definition Facility. [Citation Graph (0, 0)][DBLP]
    SIGFIDET Workshop, 1970, pp:174-187 [Conf]
  10. James K. Mullin
    Accessing Textual Documents Using Compressed Indexes of Arrays of Small Bloom Filters. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1987, v:30, n:4, pp:343-348 [Journal]
  11. James K. Mullin, G. F. Stuart
    Optimum Blocking Factors for a Mix of Sequentially Processed Jobs. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1974, v:17, n:3, pp:224-228 [Journal]
  12. James K. Mullin
    A Caution on Universal Classes of Hash Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:5, pp:247-256 [Journal]
  13. James K. Mullin
    Estimating the size of a relational join. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1993, v:18, n:3, pp:189-196 [Journal]
  14. James K. Mullin
    Interfacing criteria for recognition logic used with a context post-processor. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1982, v:15, n:3, pp:271-273 [Journal]
  15. James K. Mullin, Daniel J. Margoliash
    A Tale of Three Spelling Checkers. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1990, v:20, n:6, pp:625-630 [Journal]

Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002