default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucia Moura
Person information
- affiliation: University of Ottawa, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Dúnia Marchiori
, Ricardo Custódio, Daniel Panario, Lucia Moura:
Probabilistic root finding in code-based cryptography. J. Cryptogr. Eng. 14(1): 71-85 (2024)- 2023
- [j26]Paola Flocchini, Lucia Moura:
Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021. Algorithmica 85(3): 639-641 (2023) - [i8]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): 40-57 (2023) - 2022
- [c13]Thaís Bardini Idalino, Lucia Moura:
Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening. IWOCA 2022: 143-156 - [i7]Thaís Bardini Idalino, Lucia Moura:
Structure-aware combinatorial group testing: a new method for pandemic screening. CoRR abs/2202.09264 (2022) - [i6]André Guerino Castoldi, Lucia Moura, Daniel Panario, Brett Stevens:
Ordered Orthogonal Array Construction Using LFSR Sequences. CoRR abs/2208.00333 (2022) - [i5]Thaís Bardini Idalino, Lucia Moura:
Nested Cover-Free Families for Unbounded Fault-Tolerant Aggregate Signatures. CoRR abs/2208.00371 (2022) - [i4]Thaís Bardini Idalino, Lucia Moura, Carlisle Adams:
Modification tolerant signature schemes: location and correction. CoRR abs/2208.00373 (2022) - [i3]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 abs/2208.01410 (2022) - [i2]Thaís Bardini Idalino, Lucia Moura, Ricardo Felipe Custódio, Daniel Panario:
Locating modifications in signed data for partial data integrity. CoRR abs/2208.01411 (2022) - [i1]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 abs/2208.01412 (2022) - 2021
- [j25]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): 329-351 (2021) - [j24]Thaís Bardini Idalino, Lucia Moura:
Nested cover-free families for unbounded fault-tolerant aggregate signatures. Theor. Comput. Sci. 854: 116-130 (2021) - [e1]Paola Flocchini, Lucia Moura:
Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings. Lecture Notes in Computer Science 12757, Springer 2021, ISBN 978-3-030-79986-1 [contents]
2010 – 2019
- 2019
- [j23]Thaís Bardini Idalino, Lucia Moura:
Embedding cover-free families and cryptographical applications. Adv. Math. Commun. 13(4): 629-643 (2019) - [j22]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: 146-154 (2019) - [c12]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: 100-111 - [c11]Thaís Bardini Idalino, Lucia Moura, Carlisle Adams:
Modification Tolerant Signature Schemes: Location and Correction. INDOCRYPT 2019: 23-44 - [c10]Lachlan Plant, Lucia Moura:
Maximum Clique Exhaustive Search in Circulant k-Hypergraphs. IWOCA 2019: 378-392 - 2018
- [j21]Elizabeth Maltais, Lucia Moura, Mike Newman:
Binary Covering Arrays on Tournaments. Electron. J. Comb. 25(2): 2 (2018) - [j20]Lucia Moura, Dimitris E. Simos:
Preface. Electron. Notes Discret. Math. 65: 1 (2018) - [j19]Lucia Moura, Sebastian Raaphorst, Brett Stevens:
The Lovász Local Lemma and Variable Strength Covering Arrays. Electron. Notes Discret. Math. 65: 43-49 (2018) - [c9]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: 713-718 - [c8]Thaís Bardini Idalino, Lucia Moura:
Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families. IWOCA 2018: 52-64 - [c7]Lucia Moura, Daniel Panario, David Thomson:
Normal Basis Exhaustive Search: 10 Years Later. WAIFI 2018: 188-206 - 2017
- [j18]Georgios Tzanakis, Lucia Moura, Daniel Panario, Brett Stevens:
Covering arrays from m-sequences and character sums. Des. Codes Cryptogr. 85(3): 437-456 (2017) - [j17]Elizabeth Maltais, Lucia Moura, Mike Newman:
Graph-intersecting set systems and LYM inequalities. Discret. Math. 340(3): 379-398 (2017) - [j16]André Guerino Castoldi, Lucia Moura, Daniel Panario, Brett Stevens:
Ordered Orthogonal Array Construction Using LFSR Sequences. IEEE Trans. Inf. Theory 63(2): 1336-1347 (2017) - 2016
- [j15]Lucia Moura, Gary L. Mullen, Daniel Panario:
Finite field constructions of combinatorial arrays. Des. Codes Cryptogr. 78(1): 197-219 (2016) - [j14]Georgios Tzanakis, Lucia Moura, Daniel Panario, Brett Stevens:
Constructing new covering arrays from LFSR sequences over finite fields. Discret. Math. 339(3): 1158-1171 (2016) - 2015
- [j13]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): 731-737 (2015) - [j12]Jacob Chodoriwsky, Lucia Moura:
An adaptive algorithm for group testing for complexes. Theor. Comput. Sci. 592: 1-8 (2015) - 2014
- [j11]Sebastian Raaphorst, Lucia Moura, Brett Stevens:
A construction for strength-3 covering arrays from linear feedback shift register sequences. Des. Codes Cryptogr. 73(3): 949-968 (2014) - 2011
- [j10]Elizabeth Maltais, Lucia Moura:
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays. Theor. Comput. Sci. 412(46): 6517-6530 (2011) - 2010
- [c6]Elizabeth Maltais, Lucia Moura:
Finding the Best CAFE Is NP-Hard. LATIN 2010: 356-371
2000 – 2009
- 2009
- [j9]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): 1776-1799 (2009) - [j8]Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens:
Covering arrays avoiding forbidden edges. Theor. Comput. Sci. 410(52): 5403-5414 (2009) - 2008
- [j7]Ariane M. Masuda, Lucia Moura, Daniel Panario, David Thomson:
Low Complexity Normal Elements over Finite Fields of Characteristic Two. IEEE Trans. Computers 57(7): 990-1001 (2008) - [c5]Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens:
Covering Arrays Avoiding Forbidden Edges. COCOA 2008: 296-308 - [c4]Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens:
Algorithms to Locate Errors Using Covering Arrays. LATIN 2008: 504-519 - 2007
- [j6]Michael Dewar, Lucia Moura, Daniel Panario, Brett Stevens, Qiang Wang:
Division of trinomials by pentanomials and orthogonal arrays. Des. Codes Cryptogr. 45(1): 1-17 (2007) - 2005
- [j5]Karen Meagher, Lucia Moura:
Erdos-Ko-Rado theorems for uniform set-partition systems. Electron. J. Comb. 12 (2005) - [j4]Karen Meagher, Lucia Moura, Brett Stevens:
A Sperner-Type Theorem for Set-Partition Systems. Electron. J. Comb. 12 (2005) - [c3]Günes Karabulut, Lucia Moura, Daniel Panario, Abbas Yongaçoglu:
Flexible tree-search based orthogonal matching pursuit algorithm. ICASSP (4) 2005: 673-676 - 2003
- [j3]Lucia Moura:
Rank inequalities and separation algorithms for packing designs and sparse triple systems. Theor. Comput. Sci. 297(1-3): 367-384 (2003) - 2000
- [c2]Lucia Moura:
Rank Inequalities for Packing Designs and Sparse Triple Systems. LATIN 2000: 105-114
1990 – 1999
- 1999
- [b1]Lucia Moura:
Polyhedral aspects of combinatorial designs. University of Toronto, Canada, 1999 - [j2]Lucia Moura:
Maximal s-Wise t-Intersecting Families of Sets: Kernels, Generating Sets, and Enumeration. J. Comb. Theory A 87(1): 52-73 (1999) - [c1]Lucia Moura:
A Polyhedral Algorithm for Packings and Designs. ESA 1999: 462-475 - 1998
- [j1]Brett Stevens, Lucia Moura, Eric Mendelsohn:
Lower Bounds for Transversal Covers. Des. Codes Cryptogr. 15(3): 279-299 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
