2 papers
cs.LG2019
Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing
Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon
We study the group testing problem with non-adaptive randomized algorithms. Several models have been discussed in the literature to determine how to randomly choose the tests. For…
math.FA2018
Elementary Proofs of Some Stirling Bounds
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad +3
We give elementary proofs of several Stirling's precise bounds. We first improve all the precise bounds from the literature and give new precise bounds. In particular, we show that…