| 2026 | IWOCA | One Sequence to Rule Them All: 풪(1)-Time Parallel Generation of Mixed-Radix Gray Codes. | Lucia Moura, Prangya Parida, Brett Stevens, Aaron Williams |
| 2024 | WAIFI | Fast Decoding of Group Testing Results from Reed-Solomon d-Disjunct Matrices. | Dongxia Luo, Lucia Moura |
| 2022 | IWOCA | Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening. | Thas Bardini Idalino, Lucia Moura |
| 2019 | INDOCRYPT | Modification Tolerant Signature Schemes: Location and Correction. | Thas Bardini Idalino, Lucia Moura, Carlisle Adams |
| 2019 | IWOCA | Maximum Clique Exhaustive Search in Circulant k-Hypergraphs. | Lachlan Plant, Lucia Moura |
| 2018 | ISCC | Secret Sharing Schemes with Hidden Sets. | Rick Lopes de Souza, Martn Augusto Gagliotti Vigil, Ricardo Felipe Custdio, Florian Caullery, Lucia Moura, Daniel Panario |
| 2018 | IWOCA | Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families. | Thas Bardini Idalino, Lucia Moura |
| 2018 | WAIFI | Normal Basis Exhaustive Search: 10 Years Later. | Lucia Moura, Daniel Panario, David Thomson |
| 2010 | LATIN | Finding the Best CAFE Is NP-Hard. | Elizabeth Maltais, Lucia Moura |
| 2008 | COCOA | Covering Arrays Avoiding Forbidden Edges. | Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens |
| 2008 | LATIN | Algorithms to Locate Errors Using Covering Arrays. | Conrado Martnez, Lucia Moura, Daniel Panario, Brett Stevens |
| 2005 | ICASSP | Flexible tree-search based orthogonal matching pursuit algorithm. | Gnes Karabulut, Lucia Moura, Daniel Panario, Abbas Yongaoglu |
| 2000 | LATIN | Rank Inequalities for Packing Designs and Sparse Triple Systems. | Lucia Moura |
| 1999 | ESA | A Polyhedral Algorithm for Packings and Designs. | Lucia Moura |