 | 2008 |
|---|
| 11 |       | Peter Danziger,
Eric Mendelsohn,
Lucia Moura,
Brett Stevens:
Covering Arrays Avoiding Forbidden Edges.
COCOA 2008: 296-308 |
| 10 | | Conrado Martínez,
Lucia Moura,
Daniel Panario,
Brett Stevens:
Algorithms to Locate Errors Using Covering Arrays.
LATIN 2008: 504-519 |
| 9 | | 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) |
| 2007 |
|---|
| 8 | | Michael Dewar,
Lucia Moura,
Daniel Panario,
Brett Stevens,
Qiang Wang:
Division of trinomials by pentanomials and orthogonal arrays.
Des. Codes Cryptography 45(1): 1-17 (2007) |
| 2005 |
|---|
| 7 | | Karen Meagher,
Lucia Moura,
Brett Stevens:
A Sperner-Type Theorem for Set-Partition Systems.
Electr. J. Comb. 12: (2005) |
| 6 | | Karen Meagher,
Lucia Moura:
Erdos-Ko-Rado theorems for uniform set-partition systems.
Electr. J. Comb. 12: (2005) |
| 2003 |
|---|
| 5 | | Lucia Moura:
Rank inequalities and separation algorithms for packing designs and sparse triple systems.
Theor. Comput. Sci. 297(1-3): 367-384 (2003) |
| 2000 |
|---|
| 4 |  | Lucia Moura:
Rank Inequalities for Packing Designs and Sparse Triple Systems.
LATIN 2000: 105-114 |
| 1999 |
|---|
| 3 | | Lucia Moura:
A Polyhedral Algorithm for Packings and Designs.
ESA 1999: 462-475 |
| 2 | | Lucia Moura:
Maximal s-Wise t-Intersecting Families of Sets: Kernels, Generating Sets, and Enumeration.
J. Comb. Theory, Ser. A 87(1): 52-73 (1999) |
| 1998 |
|---|
| 1 | | Brett Stevens,
Lucia Moura,
Eric Mendelsohn:
Lower Bounds for Transversal Covers.
Des. Codes Cryptography 15(3): 279-299 (1998) |
