Lower Bounds for Transversal Covers. - Brett Stevens; Lucia Moura; Eric Mendelsohn (Des. Codes Cryptogr., 1998)

A Polyhedral Algorithm for Packings and Designs. - Lucia Moura (ESA, 1999)

Maximal s-Wise t-Intersecting Families of Sets: Kernels, Generating Sets, and Enumeration. - Lucia Moura (J. Comb. Theory A, 1999)

Polyhedral aspects of combinatorial designs. - Lucia Moura (1999)

Rank Inequalities for Packing Designs and Sparse Triple Systems. - Lucia Moura (LATIN, 2000)

Rank inequalities and separation algorithms for packing designs and sparse triple systems. - Lucia Moura (Theor. Comput. Sci., 2003)

Flexible tree-search based orthogonal matching pursuit algorithm. - Günes Karabulut; Lucia Moura; Daniel Panario; Abbas Yongaçoglu (ICASSP (4), 2005)

Erdos-Ko-Rado theorems for uniform set-partition systems. - Karen Meagher; Lucia Moura (Electron. J. Comb., 2005)

A Sperner-Type Theorem for Set-Partition Systems. - Karen Meagher; Lucia Moura; Brett Stevens (Electron. J. Comb., 2005)

Division of trinomials by pentanomials and orthogonal arrays. - Michael Dewar; Lucia Moura; Daniel Panario; Brett Stevens; Qiang Wang 012 (Des. Codes Cryptogr., 2007)

Algorithms to Locate Errors Using Covering Arrays. - Conrado Martínez; Lucia Moura; Daniel Panario; Brett Stevens (LATIN, 2008)

Low Complexity Normal Elements over Finite Fields of Characteristic Two. - Ariane M. Masuda; Lucia Moura; Daniel Panario; David Thomson (IEEE Trans. Computers, 2008)

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms. - Conrado Martínez; Lucia Moura; Daniel Panario; Brett Stevens (SIAM J. Discret. Math., 2009)

Covering arrays avoiding forbidden edges. - Peter Danziger; Eric Mendelsohn; Lucia Moura; Brett Stevens (Theor. Comput. Sci., 2009)

Finding the Best CAFE Is NP-Hard. - Elizabeth Maltais; Lucia Moura (LATIN, 2010)

Hardness results for covering arrays avoiding forbidden edges and error-locating arrays. - Elizabeth Maltais; Lucia Moura (Theor. Comput. Sci., 2011)

A construction for strength-3 covering arrays from linear feedback shift register sequences. - Sebastian Raaphorst; Lucia Moura; Brett Stevens (Des. Codes Cryptogr., 2014)

Locating modifications in signed data for partial data integrity. - Thaís Bardini Idalino; Lucia Moura; Ricardo Felipe Custódio; Daniel Panario (Inf. Process. Lett., 2015)

An adaptive algorithm for group testing for complexes. - Jacob Chodoriwsky; Lucia Moura (Theor. Comput. Sci., 2015)

Finite field constructions of combinatorial arrays. - Lucia Moura; Gary L. Mullen; Daniel Panario (Des. Codes Cryptogr., 2016)

Constructing new covering arrays from LFSR sequences over finite fields. - Georgios Tzanakis; Lucia Moura; Daniel Panario; Brett Stevens (Discret. Math., 2016)

Covering arrays from m-sequences and character sums. - Georgios Tzanakis; Lucia Moura; Daniel Panario; Brett Stevens (Des. Codes Cryptogr., 2017)

Graph-intersecting set systems and LYM inequalities. - Elizabeth Maltais; Lucia Moura; Mike Newman (Discret. Math., 2017)

Ordered Orthogonal Array Construction Using LFSR Sequences. - André Guerino Castoldi; Lucia Moura; Daniel Panario; Brett Stevens (IEEE Trans. Inf. Theory, 2017)

Secret Sharing Schemes with Hidden Sets. - Rick Lopes de Souza; Martín A. Gagliotti Vigil; Ricardo Felipe Custódio; Florian Caullery; Lucia Moura; Daniel Panario (ISCC, 2018)

Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families. - Thaís Bardini Idalino; Lucia Moura (IWOCA, 2018)

Normal Basis Exhaustive Search: 10 Years Later. - Lucia Moura; Daniel Panario; David Thomson (WAIFI, 2018)

Binary Covering Arrays on Tournaments. - Elizabeth Maltais; Lucia Moura; Mike Newman (Electron. J. Comb., 2018)

The Lovász Local Lemma and Variable Strength Covering Arrays. - Lucia Moura; Sebastian Raaphorst; Brett Stevens (Electron. Notes Discret. Math., 2018)

Preface. - Lucia Moura; Dimitris E. Simos (Electron. Notes Discret. Math., 2018)

Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays. - André Guerino Castoldi; Emerson Luiz do Monte Carmelo; Lucia Moura; Daniel Panario; Brett Stevens (CAI, 2019)

Modification Tolerant Signature Schemes: Location and Correction. - Thaís Bardini Idalino; Lucia Moura; Carlisle Adams (INDOCRYPT, 2019)

Maximum Clique Exhaustive Search in Circulant k-Hypergraphs. - Lachlan Plant; Lucia Moura (IWOCA, 2019)

Embedding cover-free families and cryptographical applications. - Thaís Bardini Idalino; Lucia Moura (Adv. Math. Commun., 2019)

Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma. - Lucia Moura; Sebastian Raaphorst; Brett Stevens (Theor. Comput. Sci., 2019)

Improved constant-sum encodings for hash-based signatures. - Lucas Pandolfo Perin; Gustavo Zambonin; Ricardo Felipe Custódio; Lucia Moura; Daniel Panario (J. Cryptogr. Eng., 2021)

Nested cover-free families for unbounded fault-tolerant aggregate signatures. - Thaís Bardini Idalino; Lucia Moura (Theor. Comput. Sci., 2021)

Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening. - Thaís Bardini Idalino; Lucia Moura (IWOCA, 2022)

Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces. - André Guerino Castoldi; Emerson L. Monte Carmelo; Lucia Moura; Daniel Panario; Brett Stevens (CoRR, 2022)

Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). - Lucia Moura; Anamari Nakic; Patric R. J. Östergård; Alfred Wassermann; Charlene Weiß (Dagstuhl Reports, 2023)

Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021. - Paola Flocchini; Lucia Moura (Algorithmica, 2023)

Fast Decoding of Group Testing Results from Reed-Solomon d-Disjunct Matrices. - Dongxia Luo; Lucia Moura (WAIFI, 2024)

Probabilistic root finding in code-based cryptography. - Dúnia Marchiori; Ricardo Custódio; Daniel Panario; Lucia Moura (J. Cryptogr. Eng., 2024)