On the optimal pairwise group testing algorithm
From MaRDI portal
Publication:6593997
DOI10.1214/24-BJPS603MaRDI QIDQ6593997FDOQ6593997
Authors: Ugnė Čiżikovienė, V. Skorniakov 
Publication date: 27 August 2024
Published in: Brazilian Journal of Probability and Statistics (Search for Journal in Brave)
Cites Work
- Large deviations techniques and applications.
- Sequential Classification on Partially Ordered Sets
- Code and parse trees for lossless source encoding
- The cutoff point for group testing
- Some Completeness Results on Decision Trees and Group Testing
- Algorithms for infinite Huffman-codes
- Title not available (Why is that?)
- On optimal nested group testing algorithms
- A Fundamental Monotonicity in Group Testing
- Huffman-type codes for infinite source distributions
- An optimal strategy for sequential classification on partially ordered sets
- Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness
- A combinatorial approach to Golomb forests
- Conjectures on optimal nested generalized group testing algorithm
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)
