scientific article; zbMATH DE number 88958

MaRDI QIDQ4016530zbMATH OpenFDO

Authors Vincent G. Winters

Publication date 16 January 1993

zbMATH Keywords

hashingprobabilistic algorithm

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 1688373
• Fast and scalable minimal perfect hashing for massive key sets
• Simple and Space-Efficient Minimal Perfect Hash Functions
• scientific article; zbMATH DE number 1875411

Cited in

(11)

• scientific article; zbMATH DE number 1688373 (Why is no real title available?)
• Graphs, hypergraphs and hashing
• Collections of Functions for Perfect Hashing
• The self-indexed search algorithm: a bit-level approach to minimal perfect hashing
• scientific article; zbMATH DE number 1875411 (Why is no real title available?)
• Design Strategies for Minimal Perfect Hash Functions
• Fast and scalable minimal perfect hashing for massive key sets
• An ordered minimal perfect hashing scheme based upon Euler's theorem
• A resource-frugal probabilistic dictionary and applications in bioinformatics
• Perfect hashing
• A scheme for constructing ordered minimal perfect hashing functions

This page was built for publication:

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