scientific article; zbMATH DE number 1508646
From MaRDI portal
Publication:4506360
Recommendations
Cited in
(only showing first 100 items - show all)- New combinatorial designs and their applications to group testing
- Probabilistic existence theorems in group testing
- Trivial two-stage group testing for complexes using almost disjunct matrices.
- On a combinatorial framework for fault characterization
- A randomized competitive group testing procedure
- Induced-bisecting families of bicolorings for hypergraphs
- Adaptive search for one defective in the additive group testing model
- Smart elements in combinatorial group testing problems
- Equivalence classes of matchings and lattice-square designs
- Application of cover-free codes and combinatorial designs to two-stage testing.
- A group testing method for finding patterns in data
- Maximal antichains of minimum size
- Quaternary splitting algorithm in group testing
- Quantum algorithm for learning secret strings and its experimental demonstration
- Generalized framework for group testing: queries, feedbacks and adversaries
- Random and quasi-random designs in group testing
- Structure-aware combinatorial group testing: a new method for pandemic screening
- Real-valued group testing for quantitative molecular assays
- On metric dimension of nonbinary Hamming spaces
- Search for a moving element with the minimum total cardinality of tests
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
- Group testing with geometry of classical groups over finite fields
- Identifying defective network components through restricted group testing
- A new randomized algorithm for group testing with unknown number of defective items
- Coding with noiseless feedback
- Hypothesis group testing for disjoint pairs
- New combinatorial structures with applications to efficient group testing with inhibitors
- An efficient FPRAS type group testing procedure to approximate the number of defectives
- Threshold group testing with consecutive positives
- Adaptive group testing for consecutive positives
- A competitive algorithm to find all defective edges in a graph
- Exact learning from an honest teacher that answers membership queries
- The identification of positive clones in a general inhibitor model
- Strongly separable matrices for nonadaptive combinatorial group testing
- Deterministic non-adaptive contention resolution on a shared channel
- Upper and lower bounds for competitive group testing
- On a parity based group testing algorithm
- Combinatorial algorithms making support of managerial decisions
- Linear Time Constructions of Some d-Restriction Problems
- Randomized adaptive test cover
- -almost selectors and their applications
- Non-adaptive complex group testing with multiple positive sets
- Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
- scientific article; zbMATH DE number 4016572 (Why is no real title available?)
- On Efficient Gossiping in Radio Networks
- A survey of compressed sensing
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
- Tandem queues with impatient customers for blood screening procedures
- A NOTE ON THE HU–HWANG–WANG CONJECTURE FOR GROUP TESTING
- F-Chord: Improved uniform routing on Chord
- PCR NONADAPTIVE GROUP TESTING OF DNA LIBRARIES FOR BIOMOLECULAR COMPUTING AND TAGGANT APPLICATIONS
- Synthetic sequence design for signal location search
- Two new perspectives on multi-stage group testing
- Rounds in combinatorial search
- Black-box Trace\&Revoke codes
- Some Completeness Results on Decision Trees and Group Testing
- Non-adaptive complex group testing with multiple positive sets
- scientific article; zbMATH DE number 147182 (Why is no real title available?)
- A chasm between identity and equivalence testing with conditional queries
- Learning a hidden graph
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- Threshold and Majority Group Testing
- Group Testing with Multiple Mutually-Obscuring Positives
- An efficient algorithm for combinatorial group testing
- A new strongly competitive group testing algorithm with small sequentiality
- Group testing: revisiting the ideas
- Error-tolerant non-adaptive learning of a hidden hypergraph
- Boolean tensor decomposition for conjunctive queries with negation
- Information-theoretic and algorithmic thresholds for group testing
- A tractable non-adaptative group testing method for non-binary measurements
- Sparse Combinatorial Group Testing
- Interval group testing for consecutive positives
- Almost optimal cover-free families
- 2-Stage Fault Tolerant Interval Group Testing
- scientific article; zbMATH DE number 5262869 (Why is no real title available?)
- scientific article; zbMATH DE number 7650113 (Why is no real title available?)
- Subquadratic non-adaptive threshold group testing
- Optimal quantitative group testing on cycles and paths
- The design of (almost) disjunct matrices by evolutionary algorithms
- scientific article; zbMATH DE number 7758315 (Why is no real title available?)
- 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
- Quantum algorithms for learning hidden strings with applications to matroid problems
- Approaching pooling design with smaller efficient ratio
- Vertex-connectivity for node failure identification in Boolean network tomography
- Flexible, efficient, and accurate tests for epidemics
- Improved lower bound for estimating the number of defective items
- A survey of cover-free families: constructions, applications, and generalizations
- Optimal Dorfman group testing for symmetric distributions
- Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing
- Non-iterative sparse signal recovery algorithms for sparse matrices and their guarantees
- Realizing graphs with cut constraints
- Identification of a monotone Boolean function with \(k\) ``reasons as a combinatorial search problem
- Greedy heuristics and linear relaxations for the random hitting set problem
- Pooled Testing for COVID-19 Using Coding Theory
- Constructions of optimal sparse r-disjunct matrices via packings
- Non-adaptive edge counting and sampling via bipartite independent set queries
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 Q4506360)
