Lucia Moura

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 31

Top Topics

Covering Arrays

Computationally Feasible

Johnson Lindenstrauss

Top Venues

Des. Codes Cryptogr.

Theor. Comput. Sci.

Publications

Dúnia Marchiori, Ricardo Custódio, Daniel Panario, Lucia Moura
Probabilistic root finding in code-based cryptography. J. Cryptogr. Eng. 14 (1) (2024)
Lucia Moura, Anamari Nakic, Patric R. J. Östergård, Alfred Wassermann, Charlene Weiß
Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). Dagstuhl Reports 13 (4) (2023)
Paola Flocchini, Lucia Moura
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021. Algorithmica 85 (3) (2023)
André Guerino Castoldi, Emerson L. Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens
Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces. CoRR (2022)
Thaís Bardini Idalino, Lucia Moura
Structure-aware combinatorial group testing: a new method for pandemic screening. CoRR (2022)
André Guerino Castoldi, Lucia Moura, Daniel Panario, Brett Stevens
Ordered Orthogonal Array Construction Using LFSR Sequences. CoRR (2022)
Thaís Bardini Idalino, Lucia Moura
Nested Cover-Free Families for Unbounded Fault-Tolerant Aggregate Signatures. CoRR (2022)
Thaís Bardini Idalino, Lucia Moura, Carlisle Adams
Modification tolerant signature schemes: location and correction. CoRR (2022)
André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens
Bounds on Covering Codes in RT spaces using Ordered Covering Arrays. CoRR (2022)
Thaís Bardini Idalino, Lucia Moura
Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening. IWOCA (2022)
Thaís Bardini Idalino, Lucia Moura, Ricardo Felipe Custódio, Daniel Panario
Locating modifications in signed data for partial data integrity. CoRR (2022)
Lucas Pandolfo Perin, Gustavo Zambonin, Ricardo Felipe Custódio, Lucia Moura, Daniel Panario
Improved constant-sum encodings for hash-based signatures. J. Cryptogr. Eng. 11 (4) (2021)
Thaís Bardini Idalino, Lucia Moura
Nested cover-free families for unbounded fault-tolerant aggregate signatures. Theor. Comput. Sci. 854 (2021)
André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens
Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays. CAI (2019)
Lachlan Plant, Lucia Moura
Maximum Clique Exhaustive Search in Circulant k-Hypergraphs. IWOCA (2019)
Thaís Bardini Idalino, Lucia Moura, Carlisle Adams
Modification Tolerant Signature Schemes: Location and Correction. INDOCRYPT (2019)
Thaís Bardini Idalino, Lucia Moura
Embedding cover-free families and cryptographical applications. Adv. Math. Commun. 13 (4) (2019)
Lucia Moura, Sebastian Raaphorst, Brett Stevens
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma. Theor. Comput. Sci. 800 (2019)
Thaís Bardini Idalino, Lucia Moura
Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families. IWOCA (2018)
Lucia Moura, Daniel Panario, David Thomson
Normal Basis Exhaustive Search: 10 Years Later. WAIFI (2018)
Elizabeth Maltais, Lucia Moura, Mike Newman
Binary Covering Arrays on Tournaments. Electron. J. Comb. 25 (2) (2018)
Lucia Moura, Dimitris E. Simos
Preface. Electron. Notes Discret. Math. 65 (2018)
Lucia Moura, Sebastian Raaphorst, Brett Stevens
The Lovász Local Lemma and Variable Strength Covering Arrays. Electron. Notes Discret. Math. 65 (2018)
Rick Lopes de Souza, Martín A. Gagliotti Vigil, Ricardo Felipe Custódio, Florian Caullery, Lucia Moura, Daniel Panario
Secret Sharing Schemes with Hidden Sets. ISCC (2018)
André Guerino Castoldi, Lucia Moura, Daniel Panario, Brett Stevens
Ordered Orthogonal Array Construction Using LFSR Sequences. IEEE Trans. Inf. Theory 63 (2) (2017)
Georgios Tzanakis, Lucia Moura, Daniel Panario, Brett Stevens
Covering arrays from m-sequences and character sums. Des. Codes Cryptogr. 85 (3) (2017)
Elizabeth Maltais, Lucia Moura, Mike Newman
Graph-intersecting set systems and LYM inequalities. Discret. Math. 340 (3) (2017)
Lucia Moura, Gary L. Mullen, Daniel Panario
Finite field constructions of combinatorial arrays. Des. Codes Cryptogr. 78 (1) (2016)
Georgios Tzanakis, Lucia Moura, Daniel Panario, Brett Stevens
Constructing new covering arrays from LFSR sequences over finite fields. Discret. Math. 339 (3) (2016)
Thaís Bardini Idalino, Lucia Moura, Ricardo Felipe Custódio, Daniel Panario
Locating modifications in signed data for partial data integrity. Inf. Process. Lett. 115 (10) (2015)
Jacob Chodoriwsky, Lucia Moura
An adaptive algorithm for group testing for complexes. Theor. Comput. Sci. 592 (2015)
Sebastian Raaphorst, Lucia Moura, Brett Stevens
A construction for strength-3 covering arrays from linear feedback shift register sequences. Des. Codes Cryptogr. 73 (3) (2014)
Elizabeth Maltais, Lucia Moura
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays. Theor. Comput. Sci. 412 (46) (2011)
Elizabeth Maltais, Lucia Moura
Finding the Best CAFE Is NP-Hard. LATIN (2010)
Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms. SIAM J. Discret. Math. 23 (4) (2009)
Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens
Covering arrays avoiding forbidden edges. Theor. Comput. Sci. 410 (52) (2009)
Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens
Algorithms to Locate Errors Using Covering Arrays. LATIN (2008)
Ariane M. Masuda, Lucia Moura, Daniel Panario, David Thomson
Low Complexity Normal Elements over Finite Fields of Characteristic Two. IEEE Trans. Computers 57 (7) (2008)
Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens
Covering Arrays Avoiding Forbidden Edges. COCOA (2008)
Michael Dewar, Lucia Moura, Daniel Panario, Brett Stevens, Qiang Wang
Division of trinomials by pentanomials and orthogonal arrays. Des. Codes Cryptogr. 45 (1) (2007)
Karen Meagher, Lucia Moura, Brett Stevens
A Sperner-Type Theorem for Set-Partition Systems. Electron. J. Comb. 12 (2005)
Karen Meagher, Lucia Moura
Erdos-Ko-Rado theorems for uniform set-partition systems. Electron. J. Comb. 12 (2005)
Günes Karabulut, Lucia Moura, Daniel Panario, Abbas Yongaçoglu
Flexible tree-search based orthogonal matching pursuit algorithm. ICASSP (4) (2005)
Lucia Moura
Rank inequalities and separation algorithms for packing designs and sparse triple systems. Theor. Comput. Sci. 297 (1-3) (2003)
Lucia Moura
Rank Inequalities for Packing Designs and Sparse Triple Systems. LATIN (2000)
Lucia Moura
Maximal s-Wise t-Intersecting Families of Sets: Kernels, Generating Sets, and Enumeration. J. Comb. Theory, Ser. A 87 (1) (1999)
Lucia Moura
A Polyhedral Algorithm for Packings and Designs. ESA (1999)
Brett Stevens, Lucia Moura, Eric Mendelsohn
Lower Bounds for Transversal Covers. Des. Codes Cryptogr. 15 (3) (1998)