An improved algorithm for quantitative group testing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 568808 (Why is no real title available?)
- Optimal Detection of Two Complementary Defectives
- Optimal Detection of Two Defectives with a Parity Check Device
- Search problems for two irregular coins with incomplete feedback: The underweight model
- Search problems on graphs
- Searching for Two Objects by Underweight Feedback
- The optimal procedures for quantitative group testing
Cited in
(18)- Determining defectives in a linear order
- Group testing with unreliable tests
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- Search problems: One, two or many rounds
- Simplified searching for two defects
- The optimal procedures for quantitative group testing
- Optimal detection of a counterfeit coin with multi-arms balances
- Group testing problem with two defectives
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
- Optimal search procedure on coin-weighing problem
- Searching for a counterfeit coin with two unreliable weighings
- Searching for two counterfeit coins with two-arms balance
- Efficient testing of groups
- scientific article; zbMATH DE number 3980896 (Why is no real title available?)
- scientific article; zbMATH DE number 1200215 (Why is no real title available?)
- scientific article; zbMATH DE number 1222826 (Why is no real title available?)
- Performance of Group Testing Algorithms With Near-Constant Tests Per Item
- Signature codes for noisy multiple access adder channel
This page was built for publication: An improved algorithm for quantitative group testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193729)