A Note on the Efficiency of Hashing Functions

DOI10.1145/321707.321722MaRDI QIDQ5677056zbMATH OpenOpenAlexFDO

Authors Jeffrey D. Ullman

Publication date 1972

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321707.321722

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20)

Cited in

(7)

• Linear open addressing and Peterson's theorem rehashed
• Hashing via finite field
• The analysis of double hashing
• Fast algorithms for bin packing
• DOUBLE HASHING WITH MULTIPLE PASSBITS
• Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
• More analysis of double hashing

This page was built for publication: A Note on the Efficiency of Hashing Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5677056)