On the optimal nested ordered algorithm

DOI10.1007/S11009-025-10211-4MaRDI QIDQ6894696zbMATH OpenFDO

Authors V. Skorniakov

Publication date 25 November 2025

Published in Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11009-025-10211-4

zbMATH Keywords

complexitydynamic proceduregroup testingoptimal nested ordered algorithm

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40)

Cites work

• A Fundamental Monotonicity in Group Testing
• A Generalized Binomial Group Testing Problem
• A Group Testing Problem
• A Method for the Construction of Minimum-Redundancy Codes
• An Optimum Nested Procedure in Binomial Group Testing
• Born again group testing: Multiaccess communications
• Conjectures on optimal nested generalized group testing algorithm
• Group testing: an information theory perspective
• scientific article; zbMATH DE number 1805583 (Why is no real title available?)
• scientific article; zbMATH DE number 3782264 (Why is no real title available?)
• scientific article; zbMATH DE number 3500898 (Why is no real title available?)
• scientific article; zbMATH DE number 3327924 (Why is no real title available?)
• Individual Testing of Independent Items in Optimal Group Testing
• Isolating a Single Defective Using Group Testing
• On optimal nested group testing algorithms
• Optimal binary search trees
• Optimal Dorfman group testing for symmetric distributions
• Optimal partitions
• Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness
• Screening for the Presence of a Disease by Pooling Sera Samples
• Some Completeness Results on Decision Trees and Group Testing
• Sterrett procedure for the generalized group testing problem
• The cutoff point for group testing

This page was built for publication: On the optimal nested ordered algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894696)