scientific article; zbMATH DE number 823957

Publication date: 6 December 1995

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

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

Related Items (only showing first 100 items - show all)

Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Group testing and fault detection for replicated files ⋮ Optimal superimposed codes and designs for Renyi's search model ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Optimal deterministic group testing algorithms to estimate the number of defectives ⋮ Optimal channel utilization with limited feedback ⋮ Adaptive group testing with a constrained number of positive responses improved ⋮ Identification of points using disks ⋮ Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing ⋮ A ternary search problem on two disjoint sets ⋮ Applications of bulk queues to group testing models with incomplete identification ⋮ 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 ⋮ Applicability of a static model in a dynamic context in group-screening decision making ⋮ A non-adaptive search algorithm that identifies up to three defects ⋮ Separating families of convex sets ⋮ A group testing problem for hypergraphs of bounded rank ⋮ Simplified searching for two defects ⋮ Finding one of $D$ defective elements in some group testing models ⋮ Efficient two-stage group testing algorithms for genetic screening ⋮ Error-correcting nonadaptive group testing with $d^e$-disjunct matrices ⋮ Efficiently correcting matrix products ⋮ Efficiently Correcting Matrix Products ⋮ Identifying defective sets using queries of small size ⋮ Weakly union-free twofold triple systems ⋮ Strengthening hash families and compressive sensing ⋮ Separating codes and a new combinatorial search model ⋮ Deterministic broadcasting time with partial knowledge of the network. ⋮ Steiner systems for two-stage disjunctive testing ⋮ On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design ⋮ An improved zig zag approach for competitive group testing ⋮ Comparing the strength of query types in property testing: the case of $k$-colorability ⋮ Finding defectives on a line by random docking and interval group tests ⋮ 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. ⋮ Nested cover-free families for unbounded fault-tolerant aggregate signatures ⋮ Uniqueness of some optimal superimposed codes ⋮ Strict group testing and the set basis problem ⋮ Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing ⋮ Search problems in vector spaces ⋮ A class of asymptotically optimal group testing strategies to identify good items ⋮ Binary search in graphs revisited ⋮ Coding for a multiple access OR channel: A survey ⋮ Cyclic sequences of $k$-subsets with distinct consecutive unions ⋮ Almost separable matrices ⋮ Affine-invariant strictly cyclic Steiner quadruple systems ⋮ From discrepancy to majority ⋮ A new construction of $\bar 3$-separable matrices via an improved decoding of Macula's construction ⋮ Recycled incomplete identification procedures for blood screening ⋮ 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 ⋮ Finding at least one excellent element in two rounds ⋮ Families of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others ⋮ Combinatorial sublinear-time Fourier algorithms ⋮ Group testing problem with two defectives ⋮ An NP-completeness result of edge search in graphs ⋮ Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability ⋮ On optimal randomized group testing with one defective item and a constrained number of positive responses ⋮ On error-tolerant DNA screening ⋮ Two error-correcting pooling designs from symplectic spaces over a finite field ⋮ A queueing model for general group screening policies and dynamic item arrivals ⋮ Optimal search procedure on coin-weighing problem ⋮ A General Framework for Estimation and Inference From Clusters of Features ⋮ Some constructions for block sequences of Steiner quadruple systems with error correcting consecutive unions ⋮ Detecting Deficiencies: An Optimal Group Testing Algorithm ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ A Combinatorial Model of Two-Sided Search ⋮ 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. ⋮ Group testing with unreliable tests ⋮ Sampling schemes and recovery algorithms for functions of few coordinate variables ⋮ A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance ⋮ On optimal superimposed codes ⋮ On separating systems with bounded set size ⋮ A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework ⋮ Disjoint Spread Systems and Fault Location ⋮ Reconstructing Weighted Graphs with Minimal Query Complexity ⋮ Pharmaceutical Applications of a Multi-Stage Group Testing Method ⋮ Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping ⋮ Secure frameproof codes, key distribution patterns, group testing algorithms and related structures ⋮ A coloring problem on the $n$-cube ⋮ Searching in trees ⋮ Pooling design and bias correction in DNA library screening ⋮ Binary Search in Graphs Revisited ⋮ Searching for a counterfeit coin with two unreliable weighings ⋮ An improved model-based method to test circuit faults ⋮ A class of asymptotically optimal group screening strategies with limited item participation ⋮ On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$ ⋮ Group testing for consecutive positives ⋮ Weakly union-free maximum packings

This page was built for publication: