Improved Results for Competitive Group Testing
From MaRDI portal
Recommendations
Cited in
(19)- Randomized group testing both query-optimal and minimal adaptive
- A zig-zag approach for competitive group testing
- A new randomized algorithm for group testing with unknown number of defective items
- Bounds for nonadaptive group tests to estimate the amount of defectives
- A randomized competitive group testing procedure
- On detecting some defective items in group testing
- scientific article; zbMATH DE number 65702 (Why is no real title available?)
- An efficient algorithm for combinatorial group testing
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
- Competitive group testing and learning hidden vertex covers with minimum adaptivity
- Exact learning from an honest teacher that answers membership queries
- Competitive group testing
- Learning a hidden graph
- Bounds for nonadaptive group tests to estimate the amount of defectives
- Two new perspectives on multi-stage group testing
- A new strongly competitive group testing algorithm with small sequentiality
- An improved zig zag approach for competitive group testing
- Synthetic sequence design for signal location search
- Upper and lower bounds for competitive group testing
This page was built for publication: Improved Results for Competitive Group Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660563)
