The following pages link to (Q4010313):
Displaying 18 items.
- Improved algorithms for group testing with inhibitors (Q293316) (← links)
- Deterministic versus randomized adaptive test cover (Q329717) (← links)
- An efficient randomized group testing procedure to determine the number of defectives (Q408399) (← links)
- Minimum average-case queries of \(q+1\)-ary search game with small sets (Q412374) (← links)
- An adaptive algorithm for group testing for complexes (Q500957) (← links)
- Separation with restricted families of sets (Q739393) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- Overlaps help: Improved bounds for group testing with interval queries (Q868385) (← links)
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices (Q875600) (← links)
- Faster deterministic wakeup in multiple access channels (Q881569) (← links)
- Nonadaptive group testing with lies: probabilistic existence theorems (Q984649) (← links)
- Probabilistic existence theorems in group testing (Q1395870) (← links)
- On Macula's error-correcting pool designs. (Q1398276) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Minimal average cost of searching for a counterfeit coin: restricted model (Q2506364) (← links)
- Deterministic M2M multicast in radio networks (Q2508975) (← links)
- Multinomial group testing models with incomplete identification (Q2573520) (← links)
- Searching for two counterfeit coins with two-arms balance (Q2576348) (← links)
