The following pages link to (Q3780312):
Displaying 28 items.
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing (Q346522) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Tracing a single user (Q850073) (← links)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
- Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix (Q1003685) (← links)
- On the upper bounds of the minimum number of rows of disjunct matrices (Q1024738) (← links)
- Families of finite sets in which no set is covered by the union of \(r\) others (Q1072559) (← links)
- Finding defective coins (Q1112024) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- On the structure of a class of sets useful in nonadaptive group testing (Q1330209) (← links)
- A simple construction of \(d\)-disjunct matrices with certain constant weights (Q1356684) (← links)
- Weakly union-free twofold triple systems (Q1387611) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Generalized cover-free families. (Q1428544) (← links)
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
- Faster broadcasting in unknown radio networks (Q1603436) (← links)
- Application of cover-free codes and combinatorial designs to two-stage testing. (Q1811089) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- Some new bounds for cover-free families (Q1976329) (← links)
- Union-intersection-bounded families and their applications (Q2026353) (← links)
- Linial for lists (Q2104037) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- Improved bounds for group testing designs (Q2581815) (← links)
- Some Completeness Results on Decision Trees and Group Testing (Q3801062) (← links)
- New Construction of Error-Tolerant Pooling Designs (Q4915255) (← links)
- Smart elements in combinatorial group testing problems with more defectives (Q5121559) (← links)
- (Q5150557) (← links)
