The following pages link to Perfect hashing (Q1391123):
Displaying 17 items.
- Computing the conjugate of convex piecewise linear-quadratic bivariate functions (Q353145) (← links)
- Constructing heterogeneous hash families by puncturing linear transversal designs (Q408964) (← links)
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations (Q626960) (← links)
- Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- Explicit constructions for perfect hash families (Q1008968) (← links)
- Perfect hash families: Probabilistic methods and explicit constructions (Q1586126) (← links)
- Volumetric geometry for DSMC and the Voldipar code (Q1645988) (← links)
- New constructions for IPP codes (Q1781000) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Distributing hash families with few rows (Q2333821) (← links)
- Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem (Q2759107) (← links)
- How to squeeze a lexicon (Q2783368) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- Secure two-party input-size reduction: challenges, solutions and applications (Q6081302) (← links)
