| Publication | Date of Publication | Type |
|---|
Disaster incident analysis via algebra stories
Mathematics in Computer Science | 2024-09-30 | Paper |
Optimal ordered covering arrays via an exact algorithm
Bulletin of the Institute of Combinatorics and its Applications | 2024-09-27 | Paper |
Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
Journal of Combinatorial Designs | 2024-02-05 | Paper |
Correction to: ``Preface: selected revised papers from the LION 15 conference
Annals of Mathematics and Artificial Intelligence | 2024-01-08 | Paper |
Combinatorial sequences for disaster scenario generation
SN Operations Research Forum | 2023-08-08 | Paper |
An exploration of combinatorial testing-based approaches to fault localization for explainable AI
Annals of Mathematics and Artificial Intelligence | 2022-08-11 | Paper |
Factorials experiments, covering arrays, and combinatorial testing
Mathematics in Computer Science | 2022-01-28 | Paper |
Correction to: ``Factorials experiments, covering arrays, and combinatorial testing
Mathematics in Computer Science | 2022-01-28 | Paper |
Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
Optimization Letters | 2020-08-24 | Paper |
| Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets | 2020-04-29 | Paper |
Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques
Annals of Mathematics and Artificial Intelligence | 2020-02-11 | Paper |
A survey on the problems and algorithms for covering arrays via set covers
Theoretical Computer Science | 2019-11-13 | Paper |
Problems and algorithms for covering arrays via set covers
Theoretical Computer Science | 2019-11-13 | Paper |
| Algebraic techniques for covering arrays and related structures | 2019-04-29 | Paper |
| Weighted \(t\)-way sequences | 2019-04-29 | Paper |
An efficient design and implementation of the in-parameter-order algorithm
Mathematics in Computer Science | 2018-11-05 | Paper |
| Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation | 2018-09-06 | Paper |
| Covering arrays via set covers | 2018-04-12 | Paper |
Algebraic modelling of covering arrays
Applications of Computer Algebra | 2018-04-05 | Paper |
| Constructing orthogonal designs in powers of two: Gröbner bases meet equational unification | 2017-07-12 | Paper |
A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
Applications of Mathematics and Informatics in Military Science | 2015-07-01 | Paper |
An algebraic framework for extending orthogonal designs
ACM Communications in Computer Algebra | 2015-02-20 | Paper |
| Encryption schemes based on Hadamard matrices with circulant cores | 2015-02-16 | Paper |
The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
Post-Quantum Cryptography | 2013-06-14 | Paper |
On the average complexity for the verification of compatible sequences
Information Processing Letters | 2013-04-04 | Paper |
Competent genetic algorithms for weighing matrices
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs
Journal of Statistical Theory and Practice | 2012-09-15 | Paper |
| On the computation of the non-periodic autocorrelation function of two ternary sequences and its related complexity analysis | 2011-12-19 | Paper |
| A meta-software system for orthogonal designs and Hadamard matrices | 2011-12-08 | Paper |
| scientific article; zbMATH DE number 5976589 (Why is no real title available?) | 2011-11-22 | Paper |
Quasi-cyclic codes from cyclic-structured designs with good properties
Discrete Mathematics, Algorithms and Applications | 2011-08-02 | Paper |
Hadamard matrices, designs and their secret-sharing schemes
Algebraic Informatics | 2011-07-08 | Paper |
| Inequivalent Hadamard matrices from near normal sequences | 2011-05-31 | Paper |
| New infinite families of orthogonal designs constructed from complementary sequences | 2011-05-25 | Paper |
| New classes of orthogonal designs and weighing matrices derived from near normal sequences | 2011-04-18 | Paper |
| scientific article; zbMATH DE number 5717185 (Why is no real title available?) | 2010-06-07 | Paper |
Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques
Applied Numerical Mathematics | 2010-05-25 | Paper |
Encryption schemes using orthogonal arrays
Journal of Discrete Mathematical Sciences and Cryptography | 2010-05-14 | Paper |
Construction of new self-dual codes over \(GF(5)\) using skew-Hadamard matrices
Advances in Mathematics of Communications | 2010-03-10 | Paper |
MDS and near-MDS self-dual codes over large prime fields
Advances in Mathematics of Communications | 2010-03-08 | Paper |
An algorithmic construction of four-level response surface designs
Communications in Statistics. Simulation and Computation | 2009-12-16 | Paper |
Self-dual Codes over Small Prime Fields from Combinatorial Designs
Algebraic Informatics | 2009-11-05 | Paper |
Exploring \(k\)-circulant supersaturated designs via genetic algorithms
Computational Statistics and Data Analysis | 2009-05-29 | Paper |
| scientific article; zbMATH DE number 5556283 (Why is no real title available?) | 2009-05-22 | Paper |
A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs
Journal of Statistical Planning and Inference | 2008-12-08 | Paper |
| scientific article; zbMATH DE number 5258060 (Why is no real title available?) | 2008-04-03 | Paper |
\(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing
Journal of Statistical Planning and Inference | 2008-03-28 | Paper |
| Large orthogonal designs via amicable sets of matrices | 2008-01-28 | Paper |
