scientific article; zbMATH DE number 823957

Publication date 6 December 1995

Reliability, testing and fault tolerance of networks and computer systems (68M15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Reliability, availability, maintenance, inspection in operations research (90B25) Fault detection; testing in circuits and networks (94C12)

Recommendations

scientific article; zbMATH DE number 1508646
scientific article; zbMATH DE number 6530141
An efficient algorithm for combinatorial group testing
New combinatorial designs and their applications to group testing
Combinatorial group testing in bipartite graphs
Sparse Combinatorial Group Testing
Explicit Nonadaptive Combinatorial Group Testing Schemes
Explicit Non-adaptive Combinatorial Group Testing Schemes
Algorithms and Data Structures
On the cut-off point for combinatorial group testing

Cited in

(only showing first 100 items - show all)

Group testing with unreliable tests
A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
Group testing for consecutive positives
Weakly union-free maximum packings
Probabilistic nonadaptive group testing in the presence of errors and DNA library screening
Search problems: One, two or many rounds
A $(\log_ 2 3+{1\over 2})$-competitive algorithm for the counterfeit coin problem
Edge search in hypergraphs
A simple construction of $d$-disjunct matrices with certain constant weights
Two applications of separating systems to nonadaptive procedures
A nonadaptive version of Ulam's problem with one lie
A non-adaptive search algorithm that identifies up to three defects
Simplified searching for two defects
Error-correcting nonadaptive group testing with $d^e$-disjunct matrices
Weakly union-free twofold triple systems
Deterministic broadcasting time with partial knowledge of the network.
Algorithmic complexity of protein identification: Combinatorics of weighted strings
Optimal detection of two counterfeit coins with two-arms balance.
Consecutive positive detectable matrices and group testing for consecutive positives.
Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
A coloring problem on the $n$-cube
Faster broadcasting in unknown radio networks
Identification of points using disks
A ternary search problem on two disjoint sets
A class of asymptotically optimal group testing strategies to identify good items
Binary search in graphs revisited
From discrepancy to majority
Recycled incomplete identification procedures for blood screening
Smart elements in combinatorial group testing problems
Minimum number of queries for an adaptive liar search game with small sets
A universal bound for a covering in regular posets and its application to pool testing
Application of cover-free codes and combinatorial designs to two-stage testing.
Searching in trees
A group testing problem for hypergraphs of bounded rank
Strengthening hash families and compressive sensing
Comparing the strength of query types in property testing: the case of $k$-colorability
An NP-completeness result of edge search in graphs
On optimal randomized group testing with one defective item and a constrained number of positive responses
A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework
Nested cover-free families for unbounded fault-tolerant aggregate signatures
Group testing problem with two defectives
Low-weight superimposed codes and related combinatorial structures: bounds and applications
Sampling schemes and recovery algorithms for functions of few coordinate variables
On separating systems with bounded set size
Pooling design and bias correction in DNA library screening
A class of asymptotically optimal group screening strategies with limited item participation
Truth tellers and liars with fewer questions
Locating modifications in signed data for partial data integrity
Quantum algorithms for learning symmetric juntas via the adversary bound
Applications of bulk queues to group testing models with incomplete identification
Efficiently correcting matrix products
Identifying defective sets using queries of small size
Steiner systems for two-stage disjunctive testing
On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
New combinatorial structures with applications to efficient group testing with inhibitors
Strict group testing and the set basis problem
Cyclic sequences of k-subsets with distinct consecutive unions
On error-tolerant DNA screening
Optimal search procedure on coin-weighing problem
Searching for a counterfeit coin with two unreliable weighings
An improved model-based method to test circuit faults
Improved bounds for group testing designs
Adaptive group testing with a constrained number of positive responses improved
An improved zig zag approach for competitive group testing
Disjoint spread systems and fault location
Efficiently correcting matrix products
Combinatorial Group Testing for Corruption Localizing Hashing
Three-Dimensional Array-Based Group Testing Algorithms
Bounds for the number of tests in non-adaptive randomized algorithms for group testing
Applicability of a static model in a dynamic context in group-screening decision making
Threshold Group Testing
Separating families of convex sets
Reconstructing weighted graphs with minimal query complexity
Finding one of D defective elements in some group testing models
Efficient two-stage group testing algorithms for genetic screening
On optimal superimposed codes
A general framework for estimation and inference from clusters of features
Detecting deficiencies: an optimal group testing algorithm
Superimposed codes and threshold group testing
New Construction of Error-Tolerant Pooling Designs
Density-based group testing
Randomized Post-optimization for t-Restrictions
Search when the lie depends on the target
Comparing the strength of query types in property testing: the case of testing $k$-colorability
Search problems in vector spaces
Binary search in graphs revisited
Smart elements in combinatorial group testing problems with more defectives
Sparse Combinatorial Group Testing
Almost separable matrices
Affine-invariant strictly cyclic Steiner quadruple systems
Pharmaceutical Applications of a Multi-Stage Group Testing Method
On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
Explicit Nonadaptive Combinatorial Group Testing Schemes
Finding defectives on a line by random docking and interval group tests
Finding at least one excellent element in two rounds
Some constructions for block sequences of Steiner quadruple systems with error correcting consecutive unions
scientific article; zbMATH DE number 5262869 (Why is no real title available?)
A Combinatorial Model of Two-Sided Search
Optimal deterministic group testing algorithms to estimate the number of defectives

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857782)