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
• Efficient minimal perfect hashing in nearly minimal space
• Fast and scalable minimal perfect hashing for massive key sets
• Simple and Space-Efficient Minimal Perfect Hash Functions
• Simple minimal perfect hashing in less space

Cited in

(12)

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

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)