Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing

DOI10.1007/978-3-030-38919-2_9zbMath1440.68325arXiv1911.01694OpenAlexW3003757297MaRDI QIDQ3297759

George Haddad, Catherine A. Haddad-Zaknoon, Nader H. Bshouty

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.01694

zbMATH Keywords

randomized algorithmsgroup testingnon-adaptive algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Cites Work

• On two random search problems
• On the upper bound of the size of the \(r\)-cover-free families
• Random pooling designs under various structures
• A group testing method for finding patterns in data
• On \(r\)-cover-free families
• Queries and concept learning
• THE EXPECTED NUMBERS OF UNRESOLVED POSITIVE CLONES FOR VARIOUS RANDOM POOL DESIGNS
• Randomized Group Testing Both Query-Optimal and Minimal Adaptive
• Born again group testing: Multiaccess communications
• RANDOM k-SET POOL DESIGNS WITH DISTINCT COLUMNS
• A GENERAL APPROACH TO COMPUTE THE PROBABILITIES OF UNRESOLVED CLONES IN RANDOM POOLING DESIGNS
• Explicit Nonadaptive Combinatorial Group Testing Schemes
• Nonrandom binary superimposed codes
• A Method for Detecting All Defective Members in a Population by Group Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing