Nader H. Bshouty

activity

20182026

most citedElementary Proofs of Some Stirling Bounds

1 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing cs.DSShow all

4 papers · 1 filter

cs.DS2026

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 $n$ . We measure complexity by the number of additions performed in the groups and by t…

cs.DS2026

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 $d$ of defectives is unknown. Bshouty and H…

cs.DS2026

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…

cs.DS2026

A Note on Second-Order Expected Maximum-Load Bounds for Binary Linear Hashing

Nader H. Bshouty

Let $S \subseteq F_{2}^{u}$ have size $n = 2^{ℓ}$ , and let $h : F_{2}^{u} \to F_{2}^{ℓ}$ be a uniformly random linear map. For $y \in F_{2}^{ℓ}$ , write $L o a d_{h} (y) := ∣ h^{- 1} (y) \cap S ∣$ , and let $M(S…