Perfect hash families: Probabilistic methods and explicit constructions
type: Item
instance of: scholarly article
title: Perfect hash families: Probabilistic methods and explicit constructions
zbMATH Open document ID: 0962.68042
author: Simon R. Blackburn
published in: Journal of Combinatorial Theory. Series A
publication date: 2000-11-14T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 05D40
zbMATH DE Number: 1530285
zbMATH Keywords: perfect hash family
MaRDI profile type: Publication
full work available at URL: jcta.1999.3050
OpenAlex ID: W2013452001
cites work: Explicit construction of exponential sized families of k-independent sets
cites work: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
cites work: Q4221879
cites work: Q4240560
cites work: Efficient Multiplicative Sharing Schemes
cites work: Optimal linear perfect hash families
cites work: Perfect hashing
cites work: Q4074927
cites work: On the Size of Separating Systems and Families of Perfect Hash Functions
cites work: On codes with the identifiable parent property
cites work: New bounds for perfect hashing via information theory
cites work: Q3219751
cites work: Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
cites work: Probabilistic methods
cites work: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
cites work: Q4487082
DOI: 10.1006/JCTA.1999.3050
Recommended article: Perfect Hash Families: Constructions and Existence
Recommended article: Explicit constructions for perfect hash families
Recommended article: A recursive construction for perfect hash families
Recommended article: Structures of a type of perfect hash function family
Recommended article: Q3611164
Recommended article: Perfect hash families: the generalization to higher indices
Recommended article: Q4221879
Recommended article: Fractal perfect hash families (extended abstract)
Recommended article: Constructing Perfect Hash Families Using a Greedy Algorithm
Recommended article: Perfect Hashing and Probability
description: scientific article; zbMATH DE number 1530285