Pages that link to "Item:Q1586126"
From MaRDI portal
The following pages link to Perfect hash families: Probabilistic methods and explicit constructions (Q1586126):
Displaying 34 items.
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3 (Q306344) (← links)
- Improved bounds for separating hash families (Q369437) (← links)
- On the relationships between perfect nonlinear functions and universal hash families (Q391979) (← links)
- Constructing heterogeneous hash families by puncturing linear transversal designs (Q408964) (← links)
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs (Q860816) (← links)
- Perfect hash families of strength three with three rows from varieties on finite projective geometries (Q887417) (← links)
- A bound on the size of separating hash families (Q958729) (← links)
- Explicit constructions for perfect hash families (Q1008968) (← links)
- Linear hash families and forbidden configurations (Q1009168) (← links)
- Optimal linear perfect hash families (Q1269893) (← links)
- Perfect and separating hash families: new bounds via the algorithmic cluster expansion local lemma (Q1645018) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Fractal perfect hash families (extended abstract) (Q1742695) (← links)
- An algebraic approach to Cichelli's perfect hashing (Q1825632) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- Improving two recursive constructions for covering arrays (Q2322060) (← links)
- A sequence approach to linear perfect hash families (Q2384060) (← links)
- Bounds for separating hash families (Q2431271) (← links)
- On generalized separating hash families (Q2469200) (← links)
- Geometric constructions of optimal linear perfect hash families (Q2469464) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- On the state of strength-three covering arrays (Q3150159) (← links)
- Some recursive constructions for perfect hash families (Q4221879) (← links)
- New constructions for perfect hash families and related structures using combinatorial designs and codes (Q4487082) (← links)
- Computing and Combinatorics (Q4681209) (← links)
- On the cell probe complexity of membership and perfect hashing (Q5175998) (← links)
- Perfect Hash Families: Constructions and Existence (Q5295346) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Balanced Families of Perfect Hash Functions and Their Applications (Q5428829) (← links)
- Explicit constructions of perfect hash families from algebraic curves over finite fields (Q5929836) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
- Bounds for \(c\)-ideal hashing (Q6546593) (← links)
