Pages that link to "Item:Q5422490"
From MaRDI portal
The following pages link to Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes (Q5422490):
Displaying 16 items.
- Synthetic sequence design for signal location search (Q378252) (← links)
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- Non-adaptive complex group testing with multiple positive sets (Q393127) (← links)
- A new strongly competitive group testing algorithm with small sequentiality (Q492805) (← links)
- From discrepancy to majority (Q1751093) (← links)
- Structure-aware combinatorial group testing: a new method for pandemic screening (Q2169949) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- Combinatorial search in two and more rounds (Q2420609) (← links)
- Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis (Q2426667) (← links)
- Strict group testing and the set basis problem (Q2452424) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Randomized Group Testing Both Query-Optimal and Minimal Adaptive (Q2891370) (← links)
- BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES (Q2905282) (← links)
- Non-adaptive Complex Group Testing with Multiple Positive Sets (Q3010399) (← links)
- COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY (Q3063600) (← links)
- On Efficient Gossiping in Radio Networks (Q3408156) (← links)
