Group Testing With Random Pools: Optimal Two-Stage Algorithms
From MaRDI portal
(Redirected from Publication:5281052)
Recommendations
- Optimal Two-Stage Algorithms for Group Testing Problems
- Group testing with random pools: Phase transitions and optimal strategy
- Group Testing Algorithms: Bounds and Simulations
- Bounds on the efficiency of two-stage group testing
- On optimal nested group testing algorithms
- Efficient group testing algorithms with a constrained number of positive responses
- scientific article; zbMATH DE number 3980896
- Efficient two-stage group testing
- Randomized group testing both query-optimal and minimal adaptive
Cited in
(18)- Optimal group testing with processing times and incomplete identification
- Trivial two-stage group testing with high error rates
- A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework
- Random and quasi-random designs in group testing
- Applications of bulk queues to group testing models with incomplete identification
- Strict group testing and the set basis problem
- An improved zig zag approach for competitive group testing
- Randomized group testing both query-optimal and minimal adaptive
- A zig-zag approach for competitive group testing
- Deterministic versus randomized adaptive test cover
- Two new perspectives on multi-stage group testing
- A new strongly competitive group testing algorithm with small sequentiality
- Decoding from pooled data: sharp information-theoretic bounds
- Group Testing With Nested Pools
- A tractable non-adaptative group testing method for non-binary measurements
- scientific article; zbMATH DE number 5262866 (Why is no real title available?)
- Optimal Dorfman group testing for symmetric distributions
- A new adaptive algorithm for competitive group testing
This page was built for publication: Group Testing With Random Pools: Optimal Two-Stage Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281052)