The following pages link to Competitive group testing (Q1309810):
Displaying 21 items.
- Improved algorithms for group testing with inhibitors (Q293316) (← links)
- On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges (Q411849) (← links)
- A new strongly competitive group testing algorithm with small sequentiality (Q492805) (← links)
- A revised algorithm for searching for all defective edges in a graph (Q765324) (← links)
- A competitive algorithm in searching for many edges in a hypergraph (Q869578) (← links)
- Searching for an edge in a graph with restricted test sets (Q1024439) (← links)
- Edge search in graphs with restricted test sets (Q1045083) (← links)
- A group testing problem for graphs with several defective edges (Q1348382) (← links)
- The \(K\)-server problem via a modern optimization lens (Q1728474) (← links)
- A randomized competitive group testing procedure (Q1743476) (← links)
- On searching strategies, parallel questions, and delayed answers (Q1765232) (← links)
- Existence theorems for some group testing strategies (Q1817291) (← links)
- Optimal strategies against a liar (Q1978508) (← links)
- A new randomized algorithm for group testing with unknown number of defective items (Q2352359) (← links)
- An improved zig zag approach for competitive group testing (Q2691200) (← links)
- Upper and lower bounds for competitive group testing (Q2700623) (← links)
- A Zig-Zag Approach for Competitive Group Testing (Q2940059) (← links)
- An Efficient Algorithm for Combinatorial Group Testing (Q4915259) (← links)
- Efficient algorithms for chemical threshold testing problems (Q5941290) (← links)
- Least adaptive optimal search with unreliable tests (Q5958337) (← links)
- On detecting some defective items in group testing (Q6591475) (← links)