In-parameter-order strategies for covering perfect hash families
From MaRDI portal
Publication:2079142
DOI10.1016/J.AMC.2022.126952OpenAlexW4210300272MaRDI QIDQ2079142FDOQ2079142
Authors: Yanyan Li 
Publication date: 4 March 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2022.126952
Recommendations
- Improved covering arrays using covering perfect hash families with groups of restricted entries
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Covering arrays of higher strength from permutation vectors
- An efficient design and implementation of the in-parameter-order algorithm
- Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation
Discrete mathematics in relation to computer science (68Rxx) Mathematical programming (90Cxx) Designs and configurations (05Bxx)
Cites Work
- Covering and radius-covering arrays: constructions and classification
- Roux-type constructions for covering arrays of strengths three and four
- Constructing strength three covering arrays with augmented annealing
- Tabu search for covering arrays using permutation vectors
- Covering arrays of higher strength from permutation vectors
- Covering arrays from cyclotomy
- A survey on the problems and algorithms for covering arrays via set covers
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Algebraic modelling of covering arrays
- Covering arrays of strength three from extended permutation vectors
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
- A greedy-metaheuristic 3-stage approach to construct covering arrays
- Improved covering arrays using covering perfect hash families with groups of restricted entries
- Subspace restrictions and affine composition for covering perfect hash families
Cited In (5)
- Algorithmic methods for covering arrays of higher index
- An efficient design and implementation of the in-parameter-order algorithm
- Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation
- Phorma: perfectly hashable order restricted multidimensional arrays
- Improved covering arrays using covering perfect hash families with groups of restricted entries
Uses Software
This page was built for publication: In-parameter-order strategies for covering perfect hash families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079142)
