The following publications are possibly variants of this publication:
- In-Parameter-Order strategies for covering perfect hash familiesMichael Wagner 0026, Charles J. Colbourn, Dimitris E. Simos. amc, 421:126952, 2022. [doi]
- Asymptotic and constructive methods for covering perfect hash families and covering arraysCharles J. Colbourn, Erin Lanus, Kaushik Sarkar. dcc, 86(4):907-937, 2018. [doi]
- Subspace restrictions and affine composition for covering perfect hash familiesCharles J. Colbourn, Erin Lanus. adam, 1(2), 2018. [doi]
- Covering arrays and hash familiesCharles J. Colbourn. In Dean Crnkovic, Vladimir D. Tonchev, editors, Information Security, Coding Theory and Related Combinatorics. Volume 29 of NATO Science for Peace and Security Series - D: Information and Communication Security, pages 99-135, IOS Press, 2011. [doi]
- Perfect Hash Families: Constructions and ExistenceRobert A. Walker, Charles J. Colbourn. jmc, 1(2):125-150, 2007. [doi]
- A recursive construction for perfect hash familiesCharles J. Colbourn, Alan C. H. Ling. jmc, 3(4):291-306, 2009. [doi]