Author:
Colbourn Charles J.,Nayeri Peyman
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Lecture Notes in Computer Science;R. Ahlswede,2013
2. Ahlswede, R., Wegener, I.: Search Problems. Wiley Interscience (1987)
3. Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Transactions on Algorithms 2, 153–177 (2006)
4. Colbourn, C.J.: Constructing perfect hash families using a greedy algorithm. In: Li, Y., Zhang, S., Ling, S., Wang, H., Xing, C., Niederreiter, H. (eds.) Coding and Cryptology, pp. 109–118. World Scientific, Singapore (2008)
5. Colbourn, C.J.: Distributing hash families and covering arrays. J. Combin. Inf. Syst. Sci. 34, 113–126 (2009)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献