Lucia Moura

Algorithmica, March, 2023

Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161).

[BibT_eX]

[DOI]

Anamari Nakic

Patric R. J. Östergård

Alfred Wassermann

Charlene Weiß

Dagstuhl Reports, 2023

2022

Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces.

[BibT_eX]

[DOI]

André Guerino Castoldi

Emerson L. Monte Carmelo

CoRR, 2022

Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

Nested cover-free families for unbounded fault-tolerant aggregate signatures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Improved constant-sum encodings for hash-based signatures.

[BibT_eX]

[DOI]

Lucas Pandolfo Perin

Gustavo Zambonin

Ricardo Felipe Custódio

J. Cryptogr. Eng., 2021

2019

Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma.

[BibT_eX]

[DOI]

Sebastian Raaphorst

Theor. Comput. Sci., 2019

Embedding cover-free families and cryptographical applications.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2019

Maximum Clique Exhaustive Search in Circulant k-Hypergraphs.

[BibT_eX]

[DOI]

Lachlan Plant

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Modification Tolerant Signature Schemes: Location and Correction.

[BibT_eX]

[DOI]

Emerson Luiz do Monte Carmelo

Carlisle Adams

Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays.

[BibT_eX]

[DOI]

André Guerino Castoldi

Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2018

Preface.

[BibT_eX]

[DOI]

Dimitris E. Simos

Electron. Notes Discret. Math., 2018

The Lovász Local Lemma and Variable Strength Covering Arrays.

[BibT_eX]

[DOI]

Sebastian Raaphorst

Electron. Notes Discret. Math., 2018

Binary Covering Arrays on Tournaments.

[BibT_eX]

[DOI]

Mike Newman

Electron. J. Comb., 2018

Normal Basis Exhaustive Search: 10 Years Later.

[BibT_eX]

[DOI]

David Thomson

Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families.

[BibT_eX]

[DOI]

Martín A. Gagliotti Vigil

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Secret Sharing Schemes with Hidden Sets.

[BibT_eX]

[DOI]

Rick Lopes de Souza

Ricardo Felipe Custódio

Florian Caullery

Proceedings of the 2018 IEEE Symposium on Computers and Communications, 2018

2017

Ordered Orthogonal Array Construction Using LFSR Sequences.

[BibT_eX]

[DOI]

André Guerino Castoldi

IEEE Trans. Inf. Theory, 2017

Graph-intersecting set systems and LYM inequalities.

[BibT_eX]

[DOI]

Mike Newman

Discret. Math., 2017

Covering arrays from m-sequences and character sums.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

2016

Constructing new covering arrays from LFSR sequences over finite fields.

[BibT_eX]

[DOI]

Discret. Math., 2016

Finite field constructions of combinatorial arrays.

[BibT_eX]

[DOI]

Gary L. Mullen

Des. Codes Cryptogr., 2016

2015

An adaptive algorithm for group testing for complexes.

[BibT_eX]

[DOI]

Jacob Chodoriwsky

Theor. Comput. Sci., 2015

Locating modifications in signed data for partial data integrity.

[BibT_eX]

[DOI]

Ricardo Felipe Custódio

Inf. Process. Lett., 2015

2014

A construction for strength-3 covering arrays from linear feedback shift register sequences.

[BibT_eX]

[DOI]

Sebastian Raaphorst

Des. Codes Cryptogr., 2014

2011

Hardness results for covering arrays avoiding forbidden edges and error-locating arrays.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2010

Finding the Best CAFE Is NP-Hard.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Covering arrays avoiding forbidden edges.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

2008

Low Complexity Normal Elements over Finite Fields of Characteristic Two.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2008

Algorithms to Locate Errors Using Covering Arrays.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Division of trinomials by pentanomials and orthogonal arrays.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2007

2005

A Sperner-Type Theorem for Set-Partition Systems.

[BibT_eX]

[DOI]

Karen Meagher

Electron. J. Comb., 2005

Erdos-Ko-Rado theorems for uniform set-partition systems.

[BibT_eX]

[DOI]

Karen Meagher

Electron. J. Comb., 2005

Flexible tree-search based orthogonal matching pursuit algorithm.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

2003

Rank inequalities and separation algorithms for packing designs and sparse triple systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2000

Rank Inequalities for Packing Designs and Sparse Triple Systems.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Polyhedral aspects of combinatorial designs.

[BibT_eX]

[DOI]

PhD thesis, 1999

Maximal s-Wise t-Intersecting Families of Sets: Kernels, Generating Sets, and Enumeration.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1999

A Polyhedral Algorithm for Packings and Designs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Lower Bounds for Transversal Covers.

[BibT_eX]

[DOI]