| Publication | Date of Publication | Type |
|---|
| A survey of cover-free families: constructions, applications, and generalizations | 2024-10-02 | Paper |
| Ordered covering arrays and upper bounds on covering codes | 2023-11-09 | Paper |
| Structure-aware combinatorial group testing: a new method for pandemic screening | 2022-08-30 | Paper |
| Ordered Orthogonal Array Construction Using LFSR Sequences | 2022-07-30 | Paper |
| Bounds on Covering Codes in RT spaces using Ordered Covering Arrays | 2022-07-30 | Paper |
| Structure-aware combinatorial group testing: a new method for pandemic screening | 2022-02-16 | Paper |
| Nested cover-free families for unbounded fault-tolerant aggregate signatures | 2021-01-25 | Paper |
| Modification tolerant signature schemes: location and correction | 2020-05-12 | Paper |
| Bounds on covering codes in RT spaces using ordered covering arrays | 2020-04-29 | Paper |
| Maximum clique exhaustive search in circulant \(k\)-hypergraphs | 2020-02-25 | Paper |
| Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma | 2019-11-13 | Paper |
| Embedding cover-free families and cryptographical applications | 2019-09-19 | Paper |
| Normal basis exhaustive search: 10 years later | 2019-02-15 | Paper |
| Variable strength covering arrays | 2018-11-23 | Paper |
| Efficient unbounded fault-tolerant aggregate signatures using nested cover-free families | 2018-09-06 | Paper |
| Binary covering arrays on tournaments | 2018-06-27 | Paper |
| The Lovász local lemma and variable strength covering arrays | 2018-04-12 | Paper |
| Covering arrays from \(m\)-sequences and character sums | 2017-10-27 | Paper |
| Ordered Orthogonal Array Construction Using LFSR Sequences | 2017-06-08 | Paper |
| Graph-intersecting set systems and LYM inequalities | 2016-12-22 | Paper |
| Finite field constructions of combinatorial arrays | 2016-02-02 | Paper |
| Constructing new covering arrays from LFSR sequences over finite fields | 2015-12-17 | Paper |
| An adaptive algorithm for group testing for complexes | 2015-10-08 | Paper |
| Locating modifications in signed data for partial data integrity | 2015-06-15 | Paper |
| A construction for strength-3 covering arrays from linear feedback shift register sequences | 2014-09-04 | Paper |
| Hardness results for covering arrays avoiding forbidden edges and error-locating arrays | 2011-12-07 | Paper |
| Locating errors using ELAs, covering arrays, and adaptive testing algorithms | 2010-12-03 | Paper |
| Finding the best CAFE is NP-hard | 2010-04-27 | Paper |
| Covering arrays avoiding forbidden edges | 2009-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3625883 | 2009-05-22 | Paper |
| Covering Arrays Avoiding Forbidden Edges | 2009-01-27 | Paper |
| Low Complexity Normal Elements over Finite Fields of Characteristic Two | 2008-09-10 | Paper |
| Algorithms to Locate Errors Using Covering Arrays | 2008-04-15 | Paper |
| Mixed covering arrays on graphs | 2008-01-07 | Paper |
| Division of trinomials by pentanomials and orthogonal arrays | 2007-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433913 | 2007-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5488893 | 2006-09-25 | Paper |
| Erdős-Ko-Rado theorems for uniform set-partition systems | 2005-11-01 | Paper |
| A Sperner-type theorem for set-partition systems | 2005-11-01 | Paper |
| Rank inequalities and separation algorithms for packing designs and sparse triple systems. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508367 | 2001-11-08 | Paper |
| Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration | 2000-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938787 | 2000-03-27 | Paper |
| Lower bounds for transversal covers | 1999-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4884219 | 1996-07-08 | Paper |
