DOUBLE HASHING WITH MULTIPLE PASSBITS

DOI10.1142/S0129054103002242zbMath1075.68674MaRDI QIDQ5696961

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)

zbMATH Keywords

algorithmsanalysishashingopen-addressingpassbits

Mathematics Subject Classification ID

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

Related Items (1)

Double hashing with passbits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The analysis of double hashing
• More analysis of double hashing
• Analysis of Uniform Hashing
• Uniform hashing is optimal
• Ordered hash tables
• Space/time trade-offs in hash coding with allowable errors
• A Note on the Efficiency of Hashing Functions

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