Perfect Hashing and Probability

DOI10.1017/S0963548300001280MaRDI QIDQ4314156zbMATH OpenOpenAlexFDO

Authors Noga Alon

Publication date 20 November 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548300001280

zbMATH Keywords

perfect hash functions

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Perfect hash families: Probabilistic methods and explicit constructions
• Recursive bounds for perfect hashing
• New bounds for perfect \(k\)-hashing
• Optimal linear perfect hash families
• scientific article; zbMATH DE number 1875411

Cites work

• Fredman–Komlós bounds and information theory
• New bounds for perfect hashing via information theory
• On the Size of Separating Systems and Families of Perfect Hash Functions

Cited in

(24)

• Generalized hashing and parent-identifying codes.
• Perfect hash families: Probabilistic methods and explicit constructions
• Some intriguing upper bounds for separating hash families
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
• Beating Fredman-Komlós for perfect \(k\)-hashing
• Bipartite Hansel results for hypergraphs
• New bounds for perfect \(k\)-hashing
• On perfect hashing of numbers with sparse digit representation via multiplication by a constant
• On two continuum armed bandit problems in high dimensions
• Interval packing and covering in the Boolean lattice
• Linear Time Constructions of Some d-Restriction Problems
• On the Circuit Complexity of Perfect Hashing
• Quasi-perfect Hashing
• Beating Fredman-Komlós for Perfect k-Hashing.
• Covering complete \(r\)-graphs with spanning complete \(r\)-partite \(r\)-graphs
• Separating hash families: a Johnson-type bound and new constructions
• Separation and Witnesses
• Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
• Recursive bounds for perfect hashing
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
• Deterministic replacement path covering
• Separating systems and oriented graphs of diameter two
• On separating systems
• Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem

This page was built for publication: Perfect Hashing and Probability

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