Efficient conditional expectation algorithms for constructing hash families

DOI10.1007/978-3-642-25011-8_12MaRDI QIDQ3111647zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn

Publication date 13 January 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25011-8_12

Mathematics Subject Classification ID

Other designs, configurations (05B30) Combinatorics in computer science (68R05) Approximation algorithms (68W25)

Recommendations

• Asymptotic and constructive methods for covering perfect hash families and covering arrays
• Distributing hash families and covering arrays
• Covering arrays and hash families
• Heterogeneous hash families and covering arrays
• Distributing hash families with few rows

Cited in

(2)

• Strengthening hash families and compressive sensing
• Deterministic coupon collection and better strong dispersers

This page was built for publication: Efficient conditional expectation algorithms for constructing hash families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3111647)