In-Parameter-Order strategies for covering perfect hash families-Reference-Cited by-同舟云学术

In-Parameter-Order strategies for covering perfect hash families

Published:2022-05 Issue: Volume:421 Page:126952
ISSN:0096-3003
Container-title:Applied Mathematics and Computation
language:en
Short-container-title:Applied Mathematics and Computation

Author:

Wagner Michael,Colbourn Charles J.,Simos Dimitris E.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Mathematics

Reference25 articles.

1. A survey on the state of the art of complexity problems for covering arrays;Kampel;Theor Comput Sci,2019

2. C. J. Colbourn, Covering Array Tables for t=2,3,4,5,6, (Available at http://www.public.asu.edu/~ccolbou/src/tabby/catable.html, Accessed on 2021-08-03).

3. Practical combinatorial testing;Kuhn;NIST special Publication,2010

4. Applying combinatorial testing to large-scale data processing at adobe;Jarman,2019

5. Covering arrays of higher strength from permutation vectors;Sherwood;J. Comb. Des.,2006

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. COVERING PERFECT HASH FAMILIES AND COVERING ARRAYS OF HIGHER INDEX;INT J GROUP THEORY;2024

2. New Upper Bounds for Covering Arrays of Order Seven;Mathematics;2024-06-20

3. State of the CArt: evaluating covering array generators at scale;International Journal on Software Tools for Technology Transfer;2024-05-06

4. Summary of In-Parameter-Order strategies for covering perfect hash families;2023 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW);2023-04

5. Algorithmic methods for covering arrays of higher index;Journal of Combinatorial Optimization;2022-12-08