Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. A. Brookstein: On Harrison’s substring testing Technique Commun. Assoc. Comp. Mach. 16, 3 (1973), P. 180–181
2. D.G. Corneil/C.C. Gotlieb: An efficient algorithm for graph isomorphism J. Assoc. Comp. Mach. 17, 1 (1970), p. 51–64
3. E. Depero: A particular representation of algebraic structures Preprints Int. Comp. Symp., Venice, 1972, p. 507–515
4. W. Feller: An introduction to probability theory and its applications 2nd edition, Wiley, New York, 1957
5. M.C. Harrison: Implementation of the substring test by hashing Commun. Assoc. Comp. Mach. 14, 12 (1971), p. 777–779