| Publication | Date of Publication | Type |
|---|
| Fast decoding of group testing results from Reed-Solomon d-disjunct matrices | 2025-04-15 | Paper |
New families of strength-3 covering arrays using linear feedback shift register sequences
Journal of Combinatorial Designs | 2025-03-31 | Paper |
| A survey of cover-free families: constructions, applications, and generalizations | 2024-10-02 | Paper |
Ordered covering arrays and upper bounds on covering codes
Journal of Combinatorial Designs | 2023-11-09 | Paper |
Structure-aware combinatorial group testing: a new method for pandemic screening
(available as arXiv preprint) | 2022-08-30 | Paper |
Ordered Orthogonal Array Construction Using LFSR Sequences
(available as arXiv preprint) | 2022-07-30 | Paper |
Bounds on Covering Codes in RT spaces using Ordered Covering Arrays
(available as arXiv preprint) | 2022-07-30 | Paper |
Structure-aware combinatorial group testing: a new method for pandemic screening
(available as arXiv preprint) | 2022-02-16 | Paper |
Nested cover-free families for unbounded fault-tolerant aggregate signatures
Theoretical Computer Science | 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
Theoretical Computer Science | 2019-11-13 | Paper |
Embedding cover-free families and cryptographical applications
Advances in Mathematics of Communications | 2019-09-19 | Paper |
| Normal basis exhaustive search: 10 years later | 2019-02-15 | Paper |
Variable strength covering arrays
Journal of Combinatorial Designs | 2018-11-23 | Paper |
| Efficient unbounded fault-tolerant aggregate signatures using nested cover-free families | 2018-09-06 | Paper |
Binary covering arrays on tournaments
The Electronic Journal of Combinatorics | 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
Designs, Codes and Cryptography | 2017-10-27 | Paper |
Ordered Orthogonal Array Construction Using LFSR Sequences
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Graph-intersecting set systems and LYM inequalities
Discrete Mathematics | 2016-12-22 | Paper |
Finite field constructions of combinatorial arrays
Designs, Codes and Cryptography | 2016-02-02 | Paper |
Constructing new covering arrays from LFSR sequences over finite fields
Discrete Mathematics | 2015-12-17 | Paper |
An adaptive algorithm for group testing for complexes
Theoretical Computer Science | 2015-10-08 | Paper |
Locating modifications in signed data for partial data integrity
Information Processing Letters | 2015-06-15 | Paper |
A construction for strength-3 covering arrays from linear feedback shift register sequences
Designs, Codes and Cryptography | 2014-09-04 | Paper |
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
Theoretical Computer Science | 2011-12-07 | Paper |
Locating errors using ELAs, covering arrays, and adaptive testing algorithms
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
Finding the best CAFE is NP-hard
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Covering arrays avoiding forbidden edges
Theoretical Computer Science | 2009-11-25 | Paper |
| scientific article; zbMATH DE number 5556019 (Why is no real title available?) | 2009-05-22 | Paper |
Covering Arrays Avoiding Forbidden Edges
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Low Complexity Normal Elements over Finite Fields of Characteristic Two
IEEE Transactions on Computers | 2008-09-10 | Paper |
Algorithms to Locate Errors Using Covering Arrays
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Mixed covering arrays on graphs
Journal of Combinatorial Designs | 2008-01-07 | Paper |
Division of trinomials by pentanomials and orthogonal arrays
Designs, Codes and Cryptography | 2007-09-20 | Paper |
| scientific article; zbMATH DE number 5145348 (Why is no real title available?) | 2007-04-23 | Paper |
| scientific article; zbMATH DE number 5056645 (Why is no real title available?) | 2006-09-25 | Paper |
Erdős-Ko-Rado theorems for uniform set-partition systems
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
Erdős-Ko-Rado theorems for uniform set-partition systems
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
A Sperner-type theorem for set-partition systems
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
A Sperner-type theorem for set-partition systems
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
Rank inequalities and separation algorithms for packing designs and sparse triple systems.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1512680 (Why is no real title available?) | 2001-11-08 | Paper |
Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
Journal of Combinatorial Theory. Series A | 2000-05-28 | Paper |
| scientific article; zbMATH DE number 1405802 (Why is no real title available?) | 2000-03-27 | Paper |
Lower bounds for transversal covers
Designs, Codes and Cryptography | 1999-06-20 | Paper |
| scientific article; zbMATH DE number 898426 (Why is no real title available?) | 1996-07-08 | Paper |
