Recursive bounds for perfect hashing

DOI10.1016/S0166-218X(00)00291-2zbMath0996.68039OpenAlexW2079896000WikidataQ127064083 ScholiaQ127064083MaRDI QIDQ5939232

Noga Alon, Emanuela Fachini

Publication date: 29 July 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00291-2

zbMATH Keywords

perfect hash functions

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New bounds for perfect hashing via information theory
• Families of finite sets in which no set is covered by the union of two others
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Fredman–Komlós bounds and information theory
• Should Tables Be Sorted?
• Perfect Hashing and Probability
• An upper bound on the zero-error list-coding capacity
• Compressing inconsistent data

This page was built for publication: Recursive bounds for perfect hashing