Recursive bounds for perfect hashing

DOI10.1016/S0166-218X(00)00291-2MaRDI QIDQ5939232zbMATH OpenOpenAlexWikidataFDO

Authors Emanuela Fachini, Noga Alon

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)

Recommendations

• New bounds for perfect hashing via information theory
• Improved bounds for separating hash families
• New bounds for perfect \(k\)-hashing
• Perfect Hashing and Probability
• Improved bounds on the size of separating hash families of short length

Cites work

• An upper bound on the zero-error list-coding capacity
• Compressing inconsistent data
• Families of finite sets in which no set is covered by the union of two others
• Fredman–Komlós bounds and information theory
• scientific article; zbMATH DE number 3908323 (Why is no real title available?)
• scientific article; zbMATH DE number 3468645 (Why is no real title available?)
• scientific article; zbMATH DE number 3801449 (Why is no real title available?)
• New bounds for perfect hashing via information theory
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Perfect Hashing and Probability
• Should Tables Be Sorted?

Cited in

(10)

• New bounds for perfect hashing via information theory
• An algebraic approach to Cichelli's perfect hashing
• Beating Fredman-Komlós for perfect \(k\)-hashing
• New bounds for perfect \(k\)-hashing
• On the Circuit Complexity of Perfect Hashing
• A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
• Quasi-perfect Hashing
• Perfect Hashing and Probability
• Leftover Hash Lemma, Revisited
• Deterministic replacement path covering

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

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