scientific article; zbMATH DE number 65702

MaRDI QIDQ4010313zbMATH OpenFDO

Authors Du Ding-Zhu, Frank K. Hwang

Publication date 27 September 1992

zbMATH Keywords

competitive algorithmgroup testing

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Competitive group testing
• Bounds for nonadaptive group tests to estimate the amount of defectives
• Modifications of Competitive Group Testing
• A randomized competitive group testing procedure
• Improved Results for Competitive Group Testing

Cited in

(25)

• Competitive group testing
• Probabilistic existence theorems in group testing
• On Macula's error-correcting pool designs.
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
• Minimal average cost of searching for a counterfeit coin: restricted model
• Deterministic M2M multicast in radio networks
• Multinomial group testing models with incomplete identification
• Searching for two counterfeit coins with two-arms balance
• Upper and lower bounds for competitive group testing
• Improved algorithms for group testing with inhibitors
• A zig-zag approach for competitive group testing
• Three Versions of a Group Testing Game
• Deterministic versus randomized adaptive test cover
• An efficient randomized group testing procedure to determine the number of defectives
• Minimum average-case queries of q+1-ary search game with small sets
• Modifications of Competitive Group Testing
• Improved Results for Competitive Group Testing
• A new strongly competitive group testing algorithm with small sequentiality
• An adaptive algorithm for group testing for complexes
• Separation with restricted families of sets
• Pattern matching with don't cares and few errors
• Overlaps help: Improved bounds for group testing with interval queries
• Exploring the missing link among d-separable, d-separable and d-disjunct matrices
• Faster deterministic wakeup in multiple access channels
• Nonadaptive group testing with lies: probabilistic existence theorems

This page was built for publication:

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