Lucia Moura - Publications

• DUNIA MARCHIORO, RICARDO CUSTODIO, DANIEL PANARIO, LUCIA MOURA, Probabilistic root-finding in code-based cryptography, Journal of Cryptographical Engineeringi 35 pages, accepted 2023.
• ANDRE GUERINO CASTOLDI, EMERSON LUIZ DO MONTE CARMELO, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, Ordered covering arrays and upper bounds on covering codes. Journal of Combinatorial Designs 31 (2023), 304-329. https://doi.org/10.1002/jcd.21882 (preprint: https://doi.org/10.48550/arXiv.2208.01410)
• LUCAS PERIN, GUSTAVO ZAMBONIN, RICARDO CUSTODIO, LUCIA MOURA, DANIEL PANARIO. Faster Hash-Based Signatures with Constant-Sum Winternitz Scheme, Journal of Cryptographic Engineering 11 (2021), 329-351. https://doi.org/10.1007/s13389-021-00264-9
• THAIS BARDINI IDALINO, LUCIA MOURA, Nested cover-free families for unbounded fault-tolerant aggregate signatures, Theoretical Computer Science 854 (2021), 116-130. https://doi.org/10.1016/j.tcs.2020.12.008
• THAIS BARDINI IDALINO, LUCIA MOURA, Embedding cover-free families and cryptographical applications, Advances in Mathematics of Communications 13(4) 2019, 629-643. http://dx.doi.org/10.3934/amc.2019039 (preprint: arXiv:1811.00126)
• LUCIA MOURA, SEBASTIAN RAAPHORST, BRETT STEVENS, Upper bounds on the sizes of variable strength covering arrays using the Lovasz local lemma, Theoretical Computer Science 800 (2019), 146-154. https://doi.org/10.1016/j.tcs.2019.10.022 (preprint: arXiv:1901.05386)
• ELIZABETH MALTAIS, LUCIA MOURA, MIKE NEWMAN, Binary covering arrays on tournaments, The Electronic Journal of Combinatorics 25(2) (2018), #P2.47 EJC link
• SEBASTIAN RAAPHORST, LUCIA MOURA, BRETT STEVENS, Variable strength covering arrays, Journal of Combinatorial Designs (2018), published online March 2018, 22 pages. https://doi.org/10.1002/jcd.21602
• GEORGIOS TZANAKIS, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, Covering arrays from m-sequences and character sums, Designs, Codes and Cryptography 85 (2017), 437-456. http://dx.doi.org/10.1007/s10623-016-0316-2.
• ANDRE CASTOLDI, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, Ordered orhtogonal array construction using LFSR sequences, IEEE Transactions on Information Theory 63 (2017), 1336-1347. http://dx.doi.org/10.1109/TIT.2016.2634010
• ELIZABETH MALTAIS, LUCIA MOURA, MIKE NEWMAN, Graph Intersecting Set Systems, Discrete Mathematics 340 (2017), 379-398. http://dx.doi.org/10.1016/j.disc.2016.08.027
• LUCIA MOURA, GARY MULLEN, DANIEL PANARIO, Finite field constructions of combinatorial arrays, Designs, Codes and Cryptography 78 (2016), 197-219. http://dx.doi.org/10.1007/s10623-015-0152-9.
• GEORGIOS TZANAKIS, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, Constructing new covering arrays from LFSR sequences over finite fields, Discrete Mathematics 339 (2016), 1158-1171. (preprint) http://dx.doi.org/10.1016/j.disc.2015.10.040
• JACOB CHODORIWSKY, LUCIA MOURA, An adaptive algorithm for group testing for complexes, Theoretical Computer Science 592 (2015), 1-8. http://dx.doi.org/10.1016/j.tcs.2015.05.005
• THAIS BARDINI IDALINO, LUCIA MOURA, RICARDO FELIPE CUSTODIO, DANIEL PANARIO, Locating modifications in signed data for partial data integrity, Information Processing Letters 115 (2015), 731-737. http://dx.doi.org/10.1016/j.ipl.2015.02.014
• SEBASTIAN RAAPHORST, LUCIA MOURA, BRETT STEVENS, A construction for strength-3 covering arrays from linear feedback shift register sequences, Designs, Codes and Cryptography 73 (2014), 949-968. http://dx.doi.org/10.1007/s10623-013-9835-2
• SEBASTIAN RAAPHORST, LUCIA MOURA, BRETT STEVENS, A density-based greedy algorithm for variable strength covering arrays, preprint, December 2011.
• ELIZABETH MALTAIS, LUCIA MOURA, Hardness results for covering arrays avoiding forbidden edges and error-locating arrays, Theoretical Computer Science 412 (2011), pp 6517-6530. http://dx.doi.org/10.1016/j.tcs.2011.07.010
• PETER DANZIGER, ERIC MENDELSOHN, LUCIA MOURA, BRETT STEVENS, Covering arrays avoiding forbidden edges, Theoretical Computer Science 410 (2009), 5403-5414. http://dx.doi.org/10.1016/j.tcs.2009.07.057
• CONRADO MARTINEZ, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, Locating errors using ELAs, covering arrays and adaptive testing algorithms, SIAM Journal on Discrete Mathematics 23 (2009), 1776-1799. http://dx.doi.org/10.1137/080730706
• ARIANE MASUDA, LUCIA MOURA, DANIEL PANARIO, DAVID THOMSON, Low complexity of normal elements over finite fields of characteristic two, IEEE Transactions on Computers 57 (2008), 990-1001.
• MICHAEL DEWAR, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, STEVEN WANG, Division of trinomials by pentanomials and orthogonal arrays, Designs, Codes and Cryptography 45 (2007), 1-17.
• KAREN MEAGHER, LUCIA MOURA, LATIFA ZEKAOUI, Mixed covering arrays on graphs, Journal of Combinatorial Designs 15 (2007), 393-404.
• GUNES KARABULUT, LUCIA MOURA, DANIEL PANARIO, ABAS YONGACOGLU, Integrating flexible tree searches to orthogonal matching pursuit algorithm, IEE Proc. Vision, Image & Signal Processing 153(2006), 538-548.
• LUCIA MOURA, SEBASTIAN RAAPHORST, Distributed isomorph-free exhaustive generation of certain triple systems, Journal of Combinatorial Mathematics and Combinatorial Computing 56 (2006), 101-121.
• KAREN MEAGHER, LUCIA MOURA, BRETT STEVENS, A Sperner-type theorem for set-partition systems, Electronic Journal of Combinatorics 12 (2005) N20, 6 pages.
• KAREN MEAGHER, LUCIA MOURA, Erdos-Ko-Rado theorems for uniform set-partition systems, Electronic Journal of Combinatorics 12 (2005) R40, 12 pages.
• LUCIA MOURA, JOHN STARDOM, BRETT STEVENS, ALAN WILLIAMS, Covering arrays with mixed alphabet sizes, Journal of Combinatorial Designs 11 (2003), 413-432.
• LUCIA MOURA, Rank inequalities and separation algorithms for packing designs and sparse triple systems, Theoretical Computer Science 297 (2003), 367-384.
• LUCIA MOURA, Maximal s-wise t-intersecting families of sets: kernels, generating sets, and enumeration, Journal of Combinatorial Theory, Ser.A 87 (1999), 52-73.
• BRETT STEVENS, LUCIA MOURA, ERIC MENDELSOHN, Lower bounds for transversal covers, Designs, Codes and Cryptography 15 (1998), 279-299.

• THAIS BARDINI IDALINO, LUCIA MOURA, Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening, In: Bazgan, C., Fernau, H. (eds) Combinatorial Algorithms. IWOCA 2022. Lecture Notes in Computer Science, vol 13270. Springer, Cham. https://doi.org/10.1007/978-3-031-06678-8_11 https://arxiv.org/abs/2202.09264
• DUNIA MARCHIORI, RICARDO CUSTODIO, DANIEL PANARIO, LUCIA MOURA, Towards constant-time probabilistic root finding for code-based cryptography, in Proceedings XXI Brazilian Symposium on Information and Computational Systems Security, SBSEG 2021, 2021, 14 pages. (https://doi.org/10.5753/sbseg.2021.17313).
• THIAGO ASTRIZI, RICARDO CUSTODIO, LUCIA MOURA, Post-quantum signature with preimage chameleon hashing, in Proceedings XX Brazilian Symposium on Information and Computational Systems Security, SBSEG2020, 2020, 14 pages. link to article
• THAIS BARDINI IDALINO, LUCIA MOURA, CARLISLE ADAMS, Modification Tolerant Signature Schemes: Location and Correction, In: Hao F., Ruj S., Sen Gupta S. (eds) Progress in Cryptology - INDOCRYPT 2019. INDOCRYPT 2019. Lecture Notes in Computer Science, vol 11898. Springer, Cham. 23-44. https://doi.org/10.1007/978-3-030-35423-7_2
• LACHLAN PLANT, LUCIA MOURA, Maximum clique exhaustive search in circulant k-hypergraphs, In: Colbourn C., Grossi R., Pisanti N. (eds) Combinatorial Algorithms. IWOCA 2019. Lecture Notes in Computer Science, vol 11638. Springer, Cham, 378-392. https://doi.org/10.1007/978-3-030-25005-8_31
• ANDRE GUERINO CASTOLDI, EMERSON LUIZ DO MONTE CARMELO, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, Bounds on covering codes in RT spaces using ordered covering arrays, In: Ciric M., Droste M., Pin JE. (eds) Algebraic Informatics. CAI 2019. Lecture Notes in Computer Science, vol 11545. Springer, Cham, 100-111. https://doi.org/10.1007/978-3-030-21363-3_9
• THAIS BARDINI IDALINO, LUCIA MOURA, Efficient unbounded fault-tolerant aggregate signatures using nested cover-free families, In: Iliopoulos C., Leong H., Sung WK. (eds) Combinatorial Algorithms. IWOCA 2018. Lecture Notes in Computer Science, vol 10979, Springeri Cham, Singapore, 2018, 52-62. https://doi.org/10.1007/978-3-319-94667-2_5
• LUCIA MOURA, DANIEL PANARIO and DAVID THOMSON, Normal Basis Exhastive Search: 10 years later, Proceedings of WAIFI 2018 - International Workshop on the Arithmetic of Finite Fields, In: Budaghyan L., Rodriguez-Henriquez F. (eds), Arithmetic of Finite Fields. WAIFI 2018. Lecture Notes in Computer Sciencei vol 11321 , Springer, Cham, 2018, 188-206. https://doi.org/10.1007/978-3-030-05153-2_10
• RICK LOPES DE SOUZA, MARTIN VIGIL, RICARDO CUSTODIO, FLORIAN CAULLERY, LUCIA MOURA, DANIEL PANARIO, Secret sharing with hidden sets, Proceedings of IEEE-ISSC - IEEE Symposium on Computers and Communications, Natal, Brazil, June 2018, 713-718. doi:10.1109/ISCC.2018.8538542
• LUCIA MOURA, BRETT STEVENS, SEBASTIAN RAAPHORST, The Lovasz local lemma and variable strength covering arrays, in 7th International Conference on Algebraic Informatics (CAI 2017): Design Theory Track, Electronic Notes in Discrete Mathematics 65 (2018), Kalamata, Greece, June 2017, 43-49. https://doi.org/10.1016/j.endm.2018.02.019
• ELIZABETH MALTAIS, LUCIA MOURA, Finding the best CAFE is NP-hard, LATIN 2010 9th Latin American Theoretical Informatics, Lecture Notes in Computer Science 6034, Oaxaca, Mexico, April 2010, 356-371. http://dx.doi.org/10.1007/978-3-642-12200-2_32
• PETER DANZIGER, ERIC MENDELSOHN, LUCIA MOURA, BRETT STEVENS, Covering arrays avoiding forbidden edges, COCOA 2008 - 2nd Annual International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science 5165, St Johns, Canda, August 2008, 296-308.
• CONRADO MARTINEZ, LUCIA MOURA, DANIEL PANARIO, BRETT STEVENS, Algorithms to locate errors using covering arrays, LATIN 2008 8th Latin American Theoretical Informatics, Lecture Notes in Computer Science 4957, Buzios, Brazil, April 2008, 504-519.
• GUNES KARABULUT, LUCIA MOURA, DANIEL PANARIO, ABBAS YONGACOGLU, Flexible Tree-Search based Orthogonal Matching Pursuit, Int. Conf. on Acoustics Speech, and Signal Processing (ICASSP), vol. 4, 2005, 673-676.
• LUCIA MOURA, Rank inequalities for packing designs and sparse triple systems, LATIN 2000: Theoretical Informatics - 4th Latin American Theoretical Informatics, Lecture Notes in Computer Science 1776, G.H. Gonnet , D. Panario and A. Viola (eds.), Springer, Punta del Este, Uruguay, April 2000, 105--114.
• LUCIA MOURA, A polyhedral algorithm for packings and designs, ESA'99 - 7th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 1643, J. Nesetril (ed.), Springer, Prague, Czech Rep., July 1999, 462-475.

• THAIS BARDINI IDALINO, LUCIA MOURA, A survey of cover-free families: constructions, applications and generalizations, Accepted to Stinson66 - New Advances in Designs, Codes and Cryptography, Colbourn and Dinitz (eds.), Fields Institute Communications, 45 pages, Springer, 2023.
• LUCIA MOURA, IVAN STOJMENOVIC, Backtracking and isomorph-free generation of polyhexes, in Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems, Nayak and Stojmenovic, eds., John Wiley & Sons, New York , 2007, In Press.
• LUCIA MOURA, Polyhedral methods in design theory, Computational and Constructive Design Theory, 227-254, W.D. Wallis (ed.), Math. Appl. 368, Kluwer, 1996.

• PAOLA FLOCCHINI, LUCIA MOURA (eds.), Combinatorial Algorithms, 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings, Lecture Notes in Computer Science, LNCS, Volume 12757, 588 pages, Springer June 2021, https://doi.org/10.1007/978-3-030-79987-8

Theses

• LUCIA MOURA, Polyhedral Aspects of Combinatorial Designs (abstract, postscript), PhD thesis, University of Toronto, Canada, January 1999.
• LUCIA MOURA, Outer linearizations and interior-point methods in convex programming, master's thesis (in portuguese), University of São Paulo, Brazil, August 1992.