1 citations · 2 across the 6 of their papers we have counts for
8 papers
Almost Tight Bounds for Isomorphism Testing and Basis Construction in Finite Abelian Groups
Nader H. Bshouty
We study isomorphism decision and basis construction for finite Abelian groups of known order . We measure complexity by the number of additions performed in the groups and by t…
A Tight Scale-Locality Bound for Partial Detection in Non-Adaptive Group Testing
Nader H. Bshouty
We give a lower bound for randomized non-adaptive group testing when the goal is to find any defective items but the total number of defectives is unknown. Bshouty and H…
Sublinear Time Algorithms for Abelian Group Property Testing
Nader H. Bshouty
In this paper, we study the problems of abelian group property testing in two models. In the partially specified model (PS-model), the algorithm does not know the group size but ca…
A Note on Second-Order Expected Maximum-Load Bounds for Binary Linear Hashing
Nader H. Bshouty
Let have size , and let be a uniformly random linear map. For , write , and let $M(S…
Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction
Nader H. Bshouty
In this paper, we study the problems of abelian group isomorphism and basis construction in two models. In the {\it partially specified model} (PS-model), the algorithm does not kn…
On Exact Learning of -Monotone Functions
Nader H. Bshouty
In this paper, we study the learnability of the Boolean class of -monotone functions from membership and equivalence queries, where is a…
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning
Nader H. Bshouty, George Haddad
Consider the model where we can access a parity function through random uniform labeled examples in the presence of random classification noise. In this paper, we show that approxi…
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…