An efficient algorithm for combinatorial group testing
From MaRDI portal
(Redirected from Publication:4915259)
Recommendations
Cites work
- A Boundary Problem for Group Testing
- A group testing problem for hypergraphs of bounded rank
- A Method for Detecting All Defective Members in a Population by Group Testing
- Competitive group testing
- scientific article; zbMATH DE number 568788 (Why is no real title available?)
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- scientific article; zbMATH DE number 2188432 (Why is no real title available?)
- Improved Results for Competitive Group Testing
- Minimizing a Combinatorial Function
- Sharper bounds in adpative group testing
Cited in
(47)- An improved algorithm for quantitative group testing
- On optimal nested group testing algorithms
- On the cut-off point for combinatorial group testing
- A class of asymptotically optimal group testing strategies to identify good items
- Smart elements in combinatorial group testing problems
- Quaternary splitting algorithm in group testing
- An optimal group testing algorithm on \(k\) disjoint sets
- New combinatorial structures with applications to efficient group testing with inhibitors
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
- Strongly separable matrices for nonadaptive combinatorial group testing
- Upper and lower bounds for competitive group testing
- On a parity based group testing algorithm
- Improved algorithms for group testing with inhibitors
- Combinatorial algorithms making support of managerial decisions
- scientific article; zbMATH DE number 4016572 (Why is no real title available?)
- Combinatorial Group Testing for Corruption Localizing Hashing
- Three-Dimensional Array-Based Group Testing Algorithms
- scientific article; zbMATH DE number 4213456 (Why is no real title available?)
- Entropy-based Optimal Group-testing Procedures
- Individual Testing of Independent Items in Optimal Group Testing
- An Improvement Over the Information Lower Bound in Binomial Group Testing
- Optimal Binomial Group Testing with a Test History
- Explicit Non-adaptive Combinatorial Group Testing Schemes
- A NOTE ON THE HU–HWANG–WANG CONJECTURE FOR GROUP TESTING
- Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
- Combinatorial group testing in bipartite graphs
- Efficient testing of groups
- A Fundamental Monotonicity in Group Testing
- scientific article; zbMATH DE number 147182 (Why is no real title available?)
- Modifications of Competitive Group Testing
- Almost Safe Group Testing with Few Tests
- scientific article; zbMATH DE number 2038701 (Why is no real title available?)
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- Performance of Group Testing Algorithms With Near-Constant Tests Per Item
- Adaptive group testing algorithms to estimate the number of defectives
- Improved Results for Competitive Group Testing
- Detecting deficiencies: an optimal group testing algorithm
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- Density-based group testing
- Information-theoretic and algorithmic thresholds for group testing
- Sparse Combinatorial Group Testing
- Explicit Nonadaptive Combinatorial Group Testing Schemes
- Algorithms and Data Structures
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
- scientific article; zbMATH DE number 5262869 (Why is no real title available?)
- scientific article; zbMATH DE number 2188432 (Why is no real title available?)
- Sharper bounds in adpative group testing
This page was built for publication: An efficient algorithm for combinatorial group testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4915259)
