A Note on the Efficiency of Hashing Functions

From MaRDI portal

Revision as of 04:29, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5677056

Jump to:navigation, search

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 (7)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5677056&oldid=30388075"