13 citations · 32 across the 25 of their papers we have counts for
4 papers · 1 filter
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…
Almost Optimal Testers for Concise Representations
Nader H. Bshouty
We give improved and almost optimal testers for several classes of Boolean functions on inputs that have concise representation in the uniform and distribution-free model. Clas…
Adaptive Exact Learning of Decision Trees from Membership Queries
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
In this paper we study the adaptive learnability of decision trees of depth at most from membership queries. This has many applications in automated scientific discovery such a…
Almost Optimal Distribution-free Junta Testing
Nader H. Bshouty
We consider the problem of testing whether an unknown -variable Boolean function is a -junta in the distribution-free property testing model, where the distance between funct…