Efficient algorithms for chemical threshold testing problems

DOI10.1016/S0304-3975(00)00037-2zbMath0972.68051MaRDI QIDQ5941290

Luisa Gargano, A. D. Bonis, Ugo Vaccaro

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

search algorithmsgroup testingunbounded search

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (2)

Operations research applications of dichotomous search ⋮ Density-Based Group Testing

Cites Work

• Unnamed Item
• Unnamed Item
• Improved algorithms for group testing with inhibitors
• An almost optimal algorithm for unbounded searching
• Group testing with unreliable tests
• Competitive group testing
• A Sequential Method for Screening Experimental Variables
• Born again group testing: Multiaccess communications
• Modifications of Competitive Group Testing
• Nonrandom binary superimposed codes
• A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory

This page was built for publication: Efficient algorithms for chemical threshold testing problems