Quasi-perfect Hashing

DOI10.1093/COMJNL/41.6.416MaRDI QIDQ4246267zbMATH OpenOpenAlexFDO

Authors Zbigniew J. Czech

Publication date 25 January 2000

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c939dd6600d4d1ec8256fce14a31283496d5d674

zbMATH Keywords

hash functionstatic dictionary problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Perfect hashing
• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 2065606
• Perfect Hashing and Probability
• Optimal hashing
• Recursive bounds for perfect hashing
• Nearly optimal property preserving hashing
• scientific article; zbMATH DE number 898085
• scientific article; zbMATH DE number 1688373
• Minimal perfect hashing in polynomial time

Cited in

(10)

• Multidimensional quantile hashing is very efficient for nonuniform distributions
• Phorma: perfectly hashable order restricted multidimensional arrays
• scientific article; zbMATH DE number 2089203 (Why is no real title available?)
• On the Circuit Complexity of Perfect Hashing
• Last-come-first-served hashing
• Nonoblivious hashing
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Vowel-consonant addressing mode on hashing for English letter-oriented keys
• Strongly Constrained Discrete Hashing
• A dictionary implementation based on dynamic perfect hashing

This page was built for publication: Quasi-perfect Hashing

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