Randomized Group Testing Both Query-Optimal and Minimal Adaptive

DOI10.1007/978-3-642-27660-6_18zbMath1298.68052MaRDI QIDQ2891370

Azam Sheikh Muhammad, Peter Damaschke

Publication date: 15 June 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_18

Mathematics Subject Classification ID

68M15: Reliability, testing and fault tolerance of networks and computer systems

68W20: Randomized algorithms

Related Items

Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing, Two new perspectives on multi-stage group testing, A new strongly competitive group testing algorithm with small sequentiality, A new randomized algorithm for group testing with unknown number of defective items, Exact learning from an honest teacher that answers membership queries, An improved zig zag approach for competitive group testing, A Zig-Zag Approach for Competitive Group Testing, Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing

Uses Software

• poolMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
• Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
• COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY
• Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
• A Dichotomous Search for a Geometric Random Variable
• Improved Results for Competitive Group Testing
• Group Testing With Random Pools: Optimal Two-Stage Algorithms
• Optimal Two-Stage Algorithms for Group Testing Problems
• Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
• A Method for the Construction of Minimum-Redundancy Codes
• A short proof of Sperner's lemma
• Minimal completely separating systems