A Note on the Efficiency of Hashing Functions

DOI10.1145/321707.321722zbMath0261.68013OpenAlexW2094606009MaRDI QIDQ5677056

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

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

Related Items

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