5 citations · 12 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020★ 4 cited
Near optimal sparsity-constrained group testing: improved bounds and algorithms
Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk +4
Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the subli…
cs.IT2020★ 1 cited
Improved Bounds and Algorithms for Sparsity-Constrained Group Testing
Nelvin Tan, Jonathan Scarlett
In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. Thi…