In a recent paper  de Villiers and Wilson discuss hashing functions in connection with chained hash storage of sparse matrices. This short communication expands upon some points raised in the cited paper and gives a brief comparison of the storage requirements of open and chained hash tables in this context.
Key wordsscatter storage open hash table chained hash table hash function sparse matrices
Unable to display preview. Download preview PDF.
- 1.L. V. Atkinson,Hash code storage of sparse matrices, in preparation.Google Scholar
- 2.L. V. Atkinson and A. J. Cornah,Full period quadratic hashing, Int. Jour. of Comp. Math. Vol. 4, No. 2 (1974), 177–189.Google Scholar
- 5.E. v. d. S. de Villiers and L. B. Wilson,Hashing the subscripts of a sparse matrix, BIT Vol. 14, No. 3 (1974), 347–358.Google Scholar