Pages that link to "Item:Q2986358"
From MaRDI portal
The following pages link to Group Testing Algorithms: Bounds and Simulations (Q2986358):
Displaying 17 items.
- Almost separable matrices (Q512882) (← links)
- Group testing in bipartite graphs (Q1607719) (← links)
- A group testing problem for hypergraphs of bounded rank (Q1917312) (← links)
- On the construction of unbiased estimators for the group testing problem (Q1987726) (← links)
- Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
- Random and quasi-random designs in group testing (Q2156803) (← links)
- Strict group testing and the set basis problem (Q2452424) (← links)
- Three-Dimensional Array-Based Group Testing Algorithms (Q3183239) (← links)
- Noise-Resilient Group Testing: Limitations and Constructions (Q3183597) (← links)
- Performance of Group Testing Algorithms With Near-Constant Tests Per Item (Q4615335) (← links)
- Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms (Q5088467) (← links)
- (Q5091194) (← links)
- Static Risk-Based Group Testing Schemes Under Imperfectly Observable Risk (Q5141708) (← links)
- Group Testing With Random Pools: Optimal Two-Stage Algorithms (Q5281052) (← links)
- Optimal group testing (Q5886113) (← links)
- (Q6084356) (← links)
- Flexible, efficient, and accurate tests for epidemics (Q6595570) (← links)