The following pages link to Lucia Moura (Q404946):
Displaying 33 items.
- A construction for strength-3 covering arrays from linear feedback shift register sequences (Q404947) (← links)
- An adaptive algorithm for group testing for complexes (Q500957) (← links)
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays (Q650881) (← links)
- Graph-intersecting set systems and LYM inequalities (Q729770) (← links)
- Constructing new covering arrays from LFSR sequences over finite fields (Q897312) (← links)
- Finite field constructions of combinatorial arrays (Q908047) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Lower bounds for transversal covers (Q1281414) (← links)
- Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration (Q1296753) (← links)
- Rank inequalities and separation algorithms for packing designs and sparse triple systems. (Q1401311) (← links)
- Binary covering arrays on tournaments (Q1648654) (← links)
- Efficient unbounded fault-tolerant aggregate signatures using nested cover-free families (Q1670983) (← links)
- Covering arrays from \(m\)-sequences and character sums (Q1675282) (← links)
- (Q1725944) (redirect page) (← links)
- Normal basis exhaustive search: 10 years later (Q1725945) (← links)
- The Lovász local lemma and variable strength covering arrays (Q1742696) (← links)
- Structure-aware combinatorial group testing: a new method for pandemic screening (Q2169949) (← links)
- Bounds on covering codes in RT spaces using ordered covering arrays (Q2175413) (← links)
- Modification tolerant signature schemes: location and correction (Q2179378) (← links)
- Nested cover-free families for unbounded fault-tolerant aggregate signatures (Q2220866) (← links)
- Embedding cover-free families and cryptographical applications (Q2274240) (← links)
- Maximum clique exhaustive search in circulant \(k\)-hypergraphs (Q2301758) (← links)
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma (Q2333832) (← links)
- Locating modifications in signed data for partial data integrity (Q2348699) (← links)
- Division of trinomials by pentanomials and orthogonal arrays (Q2384052) (← links)
- Erdős-Ko-Rado theorems for uniform set-partition systems (Q2571283) (← links)
- A Sperner-type theorem for set-partition systems (Q2571313) (← links)
- Ordered Orthogonal Array Construction Using LFSR Sequences (Q2989662) (← links)
- Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms (Q3058530) (← links)
- (Q3433913) (← links)
- Mixed covering arrays on graphs (Q5434623) (← links)
- Ordered covering arrays and upper bounds on covering codes (Q6086204) (← links)
- Ordered Orthogonal Array Construction Using LFSR Sequences (Q6506349) (← links)
