On the optimal pairwise group testing algorithm
From MaRDI portal
Publication:6593997
Cites work
- scientific article; zbMATH DE number 3327924 (Why is no real title available?)
- A Fundamental Monotonicity in Group Testing
- A combinatorial approach to Golomb forests
- Algorithms for infinite Huffman-codes
- An optimal strategy for sequential classification on partially ordered sets
- Code and parse trees for lossless source encoding
- Conjectures on optimal nested generalized group testing algorithm
- Huffman-type codes for infinite source distributions
- Large deviations techniques and applications.
- On optimal nested group testing algorithms
- Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness
- Sequential Classification on Partially Ordered Sets
- Some Completeness Results on Decision Trees and Group Testing
- The cutoff point for group testing
This page was built for publication: On the optimal pairwise group testing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593997)