The following pages link to Dimitris E. Simos (Q452515):
Displaying 49 items.
- On the equivalence of linear codes (Q429744) (← links)
- An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs (Q452516) (← links)
- (Q592081) (redirect page) (← links)
- A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs (Q958805) (← links)
- Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques (Q972300) (← links)
- Exploring \(k\)-circulant supersaturated designs via genetic algorithms (Q1019925) (← links)
- Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation (Q1671001) (← links)
- Weighted \(t\)-way sequences (Q1739925) (← links)
- Algebraic techniques for covering arrays and related structures (Q1739926) (← links)
- Covering arrays via set covers (Q1742691) (← links)
- (Q1928507) (redirect page) (← links)
- Competent genetic algorithms for weighing matrices (Q1928508) (← links)
- On the average complexity for the verification of compatible sequences (Q1944143) (← links)
- An efficient design and implementation of the in-parameter-order algorithm (Q1993364) (← links)
- Factorials experiments, covering arrays, and combinatorial testing (Q2071532) (← links)
- Correction to: ``Factorials experiments, covering arrays, and combinatorial testing'' (Q2071533) (← links)
- An exploration of combinatorial testing-based approaches to fault localization for explainable AI (Q2163858) (← links)
- Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets (Q2175421) (← links)
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm (Q2193001) (← links)
- Construction of new self-dual codes over \(GF(5)\) using skew-Hadamard matrices (Q2268254) (← links)
- MDS and near-MDS self-dual codes over large prime fields (Q2268668) (← links)
- Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques (Q2294604) (← links)
- Problems and algorithms for covering arrays via set covers (Q2333828) (← links)
- A survey on the problems and algorithms for covering arrays via set covers (Q2333829) (← links)
- \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing (Q2480020) (← links)
- (Q3003132) (← links)
- (Q3003879) (← links)
- Hadamard Matrices, Designs and Their Secret-Sharing Schemes (Q3014942) (← links)
- QUASI-CYCLIC CODES FROM CYCLIC-STRUCTURED DESIGNS WITH GOOD PROPERTIES (Q3087097) (← links)
- (Q3101005) (← links)
- (Q3103707) (← links)
- (Q3104028) (← links)
- Encryption schemes using orthogonal arrays (Q3560586) (← links)
- (Q3565856) (← links)
- (Q3626171) (← links)
- Self-dual Codes over Small Prime Fields from Combinatorial Designs (Q3642538) (← links)
- An Algorithmic Construction of Four-Level Response Surface Designs (Q3652751) (← links)
- Algebraic Modelling of Covering Arrays (Q4610003) (← links)
- The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography (Q4928598) (← links)
- (Q5173657) (← links)
- An algebraic framework for extending orthogonal designs (Q5175298) (← links)
- A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs (Q5261011) (← links)
- Constructing Orthogonal Designs in Powers of Two: Gröbner Bases Meet Equational Unification (Q5277882) (← links)
- (Q5393531) (← links)
- (Q5437998) (← links)
- (Q5455119) (← links)
- Correction to: ``Preface: selected revised papers from the LION 15 conference'' (Q6144992) (← links)
- Combinatorial sequences for disaster scenario generation (Q6168351) (← links)
- Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods (Q6187007) (← links)
