Perfect hash families: Probabilistic methods and explicit constructions
From MaRDI portal
Recommendations
- Perfect Hash Families: Constructions and Existence
- Explicit constructions for perfect hash families
- A recursive construction for perfect hash families
- Structures of a type of perfect hash function family
- A new lower bound on perfect hash families
- Perfect hash families: the generalization to higher indices
- scientific article; zbMATH DE number 1228785
- Fractal perfect hash families (extended abstract)
- Constructing Perfect Hash Families Using a Greedy Algorithm
- Perfect Hashing and Probability
Cites work
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 1228785 (Why is no real title available?)
- scientific article; zbMATH DE number 1284201 (Why is no real title available?)
- scientific article; zbMATH DE number 1462939 (Why is no real title available?)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- Efficient Multiplicative Sharing Schemes
- Explicit construction of exponential sized families of k-independent sets
- Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
- New bounds for perfect hashing via information theory
- On codes with the identifiable parent property
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Optimal linear perfect hash families
- Perfect hashing
- Probabilistic methods
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
Cited in
(40)- Computing and Combinatorics
- Fractal perfect hash families (extended abstract)
- On generalized separating hash families
- Geometric constructions of optimal linear perfect hash families
- Computing Autotopism Groups of Partial Latin Rectangles
- Perfect hash families from transversal designs
- Improved bounds for separating hash families
- Some intriguing upper bounds for separating hash families
- On the relationships between perfect nonlinear functions and universal hash families
- Separating hash families: a Johnson-type bound and new constructions
- On the state of strength-three covering arrays
- A recursive construction for perfect hash families
- Perfect Hash Families: Constructions and Existence
- Bounds for \(c\)-ideal hashing
- A sequence approach to linear perfect hash families
- Constructing heterogeneous hash families by puncturing linear transversal designs
- Balanced Families of Perfect Hash Functions and Their Applications
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Linear hash families and forbidden configurations
- An algebraic approach to Cichelli's perfect hashing
- Roux-type constructions for covering arrays of strengths three and four
- Generalised cumulative arrays in secret sharing
- Bounds for separating hash families
- Balanced families of perfect hash functions and their applications
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
- Improving two recursive constructions for covering arrays
- Perfect Hashing and Probability
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3
- A bound on the size of separating hash families
- On the cell probe complexity of membership and perfect hashing
- Constructing Perfect Hash Families Using a Greedy Algorithm
- Explicit constructions for perfect hash families
- Beating the probabilistic lower bound on \(q\)-perfect hashing
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- Perfect hash families of strength three with three rows from varieties on finite projective geometries
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- Perfect and separating hash families: new bounds via the algorithmic cluster expansion local lemma
- scientific article; zbMATH DE number 3930363 (Why is no real title available?)
- Perfect hash families: the generalization to higher indices
- Explicit constructions of perfect hash families from algebraic curves over finite fields
This page was built for publication: Perfect hash families: Probabilistic methods and explicit constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586126)
