A non-adaptive search algorithm that identifies up to three defects

DOI10.1016/S0378-3758(96)00144-9MaRDI QIDQ1361624zbMATH OpenOpenAlexFDO

Authors Anthony J. Macula

Publication date 14 December 1997

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0378-3758(96)00144-9

zbMATH Keywords

staticcombinatorial searchseparating systemsnon-adaptive

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Design of statistical experiments (62K99)

Recommendations

• Simplified searching for two defects
• scientific article; zbMATH DE number 1200215
• Identifying defective sets using queries of small size
• Group testing problem with two defectives
• Adaptive search for one defective in the additive group testing model

Cites work

• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 168147 (Why is no real title available?)
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• On two random search problems

Cited in

(3)

• Simplified searching for two defects
• Searching for a counterfeit coin with \(b\)-balance
• Identifying defective sets using queries of small size

This page was built for publication: A non-adaptive search algorithm that identifies up to three defects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361624)