Design Strategies for Minimal Perfect Hash Functions

DOI10.1007/978-3-540-74871-7_2zbMATH Open1175.68556OpenAlexW1541806040MaRDI QIDQ3608495FDOQ3608495

Authors: Martin Dietzfelbinger 

Publication date: 5 March 2009

Published in: Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74871-7_2

Recommendations

• scientific article; zbMATH DE number 1875411
• scientific article; zbMATH DE number 88958
• scientific article; zbMATH DE number 1688373
• Simple and Space-Efficient Minimal Perfect Hash Functions
• Experimental and Efficient Algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Data structures (68P05)

Cited In (5)

• A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
• Title not available (Why is that?)
• Simple and Space-Efficient Minimal Perfect Hash Functions
• Analysis of the Hash Function Design Strategy Called SMASH
• Minimal and monotone minimal perfect hash functions

This page was built for publication: Design Strategies for Minimal Perfect Hash Functions

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