The following pages link to (Q4857782):
Displaying 50 items.
- Adaptive group testing with a constrained number of positive responses improved (Q266968) (← links)
- Applicability of a static model in a dynamic context in group-screening decision making (Q337158) (← links)
- Separating families of convex sets (Q364852) (← links)
- Finding one of \(D\) defective elements in some group testing models (Q375957) (← links)
- Efficient two-stage group testing algorithms for genetic screening (Q378260) (← links)
- Search problems in vector spaces (Q498971) (← links)
- Almost separable matrices (Q512882) (← links)
- Affine-invariant strictly cyclic Steiner quadruple systems (Q517265) (← links)
- Finding at least one excellent element in two rounds (Q538153) (← links)
- On combinatorial testing problems (Q605939) (← links)
- Separating codes and a new combinatorial search model (Q619509) (← links)
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
- Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing (Q827753) (← links)
- Uniqueness of some optimal superimposed codes (Q926629) (← links)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
- A new construction of \(\bar 3\)-separable matrices via an improved decoding of Macula's construction (Q955328) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- Two error-correcting pooling designs from symplectic spaces over a finite field (Q989053) (← links)
- A queueing model for general group screening policies and dynamic item arrivals (Q992685) (← links)
- Group testing with unreliable tests (Q1269106) (← links)
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance (Q1270819) (← links)
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping (Q1281767) (← links)
- Group testing for consecutive positives (Q1306739) (← links)
- Weakly union-free maximum packings (Q1306740) (← links)
- Probabilistic nonadaptive group testing in the presence of errors and DNA library screening (Q1306742) (← links)
- Search problems: One, two or many rounds (Q1344611) (← links)
- A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem (Q1356538) (← links)
- Edge search in hypergraphs (Q1356674) (← links)
- A simple construction of \(d\)-disjunct matrices with certain constant weights (Q1356684) (← links)
- Two applications of separating systems to nonadaptive procedures (Q1357749) (← links)
- A nonadaptive version of Ulam's problem with one lie (Q1360979) (← links)
- A non-adaptive search algorithm that identifies up to three defects (Q1361624) (← links)
- Simplified searching for two defects (Q1378780) (← links)
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices (Q1382279) (← links)
- Weakly union-free twofold triple systems (Q1387611) (← links)
- Deterministic broadcasting time with partial knowledge of the network. (Q1401209) (← links)
- Algorithmic complexity of protein identification: Combinatorics of weighted strings (Q1422404) (← links)
- Optimal detection of two counterfeit coins with two-arms balance. (Q1427807) (← links)
- Consecutive positive detectable matrices and group testing for consecutive positives. (Q1428539) (← links)
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
- A coloring problem on the \(n\)-cube (Q1570845) (← links)
- Faster broadcasting in unknown radio networks (Q1603436) (← links)
- Identification of points using disks (Q1618247) (← links)
- A ternary search problem on two disjoint sets (Q1627863) (← links)
- A class of asymptotically optimal group testing strategies to identify good items (Q1741503) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- From discrepancy to majority (Q1751093) (← links)
- Recycled incomplete identification procedures for blood screening (Q1751814) (← links)
- Smart elements in combinatorial group testing problems (Q1752611) (← links)
- Minimum number of queries for an adaptive liar search game with small sets (Q1799380) (← links)
