Two new perspectives on multi-stage group testing
type: Item
instance of: scholarly article
title: Two new perspectives on multi-stage group testing
zbMATH Open document ID: 1311.68187
author: Peter Damaschke
author: Azam Sheikh Muhammad
author: Eberhard Triesch
published in: Algorithmica
publication date: 2013-11-11T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6225285
zbMATH Keywords: group testing
zbMATH Keywords: randomization
zbMATH Keywords: Sperner family
zbMATH Keywords: Huffman code
zbMATH Keywords: parallel testing
zbMATH Keywords: transversal matroid
MaRDI profile type: Publication
full work available at URL: s00453-013-9781-4
OpenAlex ID: W1995522343
cites work: Q3994535
cites work: Optimal pooling designs with error detection
cites work: Incomplete identification models for group-testable items
cites work: Computational Science – ICCS 2005
cites work: Overlaps help: Improved bounds for group testing with interval queries
cites work: The minimal number of basic elements in a multiset antichain
cites work: Q4873725
cites work: A Canonical Form for Testing Boolean Function Properties
cites work: Randomized Group Testing Both Query-Optimal and Minimal Adaptive
cites work: Combinatorial Group Testing for Corruption Localizing Hashing
cites work: Optimal Two-Stage Algorithms for Group Testing Problems
cites work: Q4506360
cites work: Q5395177
cites work: Q4745752
cites work: Matroids and the greedy algorithm
cites work: Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
cites work: On the cut-off point for combinatorial group testing
cites work: Three theorems regarding testing graph properties
cites work: Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: When is individual testing optimal for nonadaptive group testing?
cites work: A Sequential Method for Screening Experimental Variables
cites work: A short proof of Sperner's lemma
cites work: Group Testing With Random Pools: Optimal Two-Stage Algorithms
cites work: On the upper bound of the size of the \(r\)-cover-free families
cites work: Improved Results for Competitive Group Testing
cites work: Q4111952
DOI: 10.1007/S00453-013-9781-4
description: scientific article; zbMATH DE number 6225285