DOUBLE HASHING WITH MULTIPLE PASSBITS

DOI10.1142/S0129054103002242MaRDI QIDQ5696961zbMATH OpenFDO

Authors Paul M. Martini, Walter A. Burkhard

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054103002242

zbMATH Keywords

algorithmsanalysishashingopen-addressingpassbits

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• Double hashing with passbits
• The analysis of double hashing
• More analysis of double hashing
• Analysis of new variants of coalesced hashing
• Last-come-first-served hashing

Cites work

• A Note on the Efficiency of Hashing Functions
• Analysis of Uniform Hashing
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 236854 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• More analysis of double hashing
• Ordered hash tables
• Space/time trade-offs in hash coding with allowable errors
• The analysis of double hashing
• Uniform hashing is optimal

Cited in

(1)

• Double hashing with passbits

This page was built for publication: DOUBLE HASHING WITH MULTIPLE PASSBITS

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