scientific article; zbMATH DE number 1508646

Publication date: 17 September 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

complexity designs combinatorial group testing competitive group testing sequential algorithms multiaccess channels analysis of DNA conterfeit coin problem symmetric group testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (80)

On a combinatorial framework for fault characterization ⋮ Coding with noiseless feedback ⋮ Almost Optimal Cover-Free Families ⋮ A group testing method for finding patterns in data ⋮ Generalized framework for group testing: queries, feedbacks and adversaries ⋮ Exact learning from an honest teacher that answers membership queries ⋮ A Survey of Compressed Sensing ⋮ The identification of positive clones in a general inhibitor model ⋮ Random and quasi-random designs in group testing ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Tandem queues with impatient customers for blood screening procedures ⋮ Exact learning of juntas from membership queries ⋮ Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Real-valued group testing for quantitative molecular assays ⋮ Strongly separable matrices for nonadaptive combinatorial group testing ⋮ Synthetic sequence design for signal location search ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Two new perspectives on multi-stage group testing ⋮ Rounds in combinatorial search ⋮ Black-box Trace\&Revoke codes ⋮ A tractable non-adaptative group testing method for non-binary measurements ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Randomized Adaptive Test Cover ⋮ Non-adaptive complex group testing with multiple positive sets ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ The design of (almost) disjunct matrices by evolutionary algorithms ⋮ Approaching pooling design with smaller efficient ratio ⋮ On metric dimension of nonbinary Hamming spaces ⋮ Search for a moving element with the minimum total cardinality of tests ⋮ On the complexity of neighbourhood learning in radio networks ⋮ On a couple of unresolved group testing conjectures ⋮ Non-adaptive Group-Testing Aggregate MAC Scheme ⋮ On the Rényi-Ulam game with restricted size queries ⋮ Vertex-connectivity for node failure identification in Boolean network tomography ⋮ Group testing aggregate signatures with soundness ⋮ Hypothesis group testing for disjoint pairs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantum algorithms for learning hidden strings with applications to matroid problems ⋮ Improvements on some error-tolerance pooling designs ⋮ Maximal antichains of minimum size ⋮ Upper and lower bounds for competitive group testing ⋮ Unnamed Item ⋮ Trivial two-stage group testing for complexes using almost disjunct matrices. ⋮ An efficient FPRAS type group testing procedure to approximate the number of defectives ⋮ Threshold group testing with consecutive positives ⋮ A NOTE ON THE HU–HWANG–WANG CONJECTURE FOR GROUP TESTING ⋮ 2-Stage Fault Tolerant Interval Group Testing ⋮ Learning a hidden graph ⋮ F-Chord: Improved uniform routing on Chord ⋮ Group testing with random pools: Phase transitions and optimal strategy ⋮ A new strongly competitive group testing algorithm with small sequentiality ⋮ An upper bound of the number of tests in pooling designs for the error-tolerant complex model ⋮ A randomized competitive group testing procedure ⋮ Non-adaptive Complex Group Testing with Multiple Positive Sets ⋮ Induced-bisecting families of bicolorings for hypergraphs ⋮ Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications ⋮ Adaptive group testing for consecutive positives ⋮ Adaptive search for one defective in the additive group testing model ⋮ Threshold and Majority Group Testing ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ An Efficient Algorithm for Combinatorial Group Testing ⋮ Interval group testing for consecutive positives ⋮ Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time ⋮ A competitive algorithm to find all defective edges in a graph ⋮ Equivalence classes of matchings and lattice-square designs ⋮ Optimal quantitative group testing on cycles and paths ⋮ Quaternary splitting algorithm in group testing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Subquadratic non-adaptive threshold group testing ⋮ PCR NONADAPTIVE GROUP TESTING OF DNA LIBRARIES FOR BIOMOLECULAR COMPUTING AND TAGGANT APPLICATIONS ⋮ Group testing with geometry of classical groups over finite fields ⋮ Unnamed Item ⋮ On Efficient Gossiping in Radio Networks ⋮ Group testing: Revisiting the ideas ⋮ Identifying defective network components through restricted group testing ⋮ Quantum algorithm for learning secret strings and its experimental demonstration ⋮ A new randomized algorithm for group testing with unknown number of defective items

This page was built for publication: