ACM references a-e
"Space/Time trade-offs in hash coding with allowable errors",
Communications of the ACM, 13, 7, pp. 422-426, July, 1970.
|422 ;;Quote: if allow false hits and a sparse message universe, then can use a much smaller hash area to identify messages|
|423 ;;Quote: Bloom filter (failure hash) by hashing to multiple bits; need at least half 0's and constant time processing
ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references a-b (396 items)
Topic: hash filter (18 items)