Hash functions Designing good functions is quite nontrivial For now, we assume they exist. Namely, we assume simple uniform hashing Each key k e K of keys is equally likely to be hashed to any slot of table T, independent of where other keys are hashedHash functions Designing good functions is quite nontrivial For now, we assume they exist. Namely, we assume simple uniform hashing: – Each key k ∈ K of keys is equally likely to be hashed to any slot of table T, independent of where other keys are hashed