Nader H. Bshouty

Technion – Israel Institute of Technology — Israel

Computer Science · Physical Sciences

27h-index2.7kcitations234works0.42yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Machine Learning and Algorithms(138), Algorithms and Data Compression(66), Complexity and Algorithms in Graphs(65), Optimization and Search Problems(44), semigroups and automata theory(28)

Publications234 total

Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction
ArXiv.org·2025· 1 citedOpen Access
Improved lower bound for estimating the number of defective items
Journal of Combinatorial Optimization·2025· 1 citedOpen Access
On Exact Learning of $d$-Monotone Functions
arXiv (Cornell University)·2025Open Access
A tight lower bound on non-adaptive group testing estimation
Discrete Applied Mathematics·2025
On Exact Learning of d-Monotone Functions
Lecture notes in computer science·2025
On Properties that are Non-trivial to Test
Lecture notes in computer science·2025· 1 cited
On one-sided testing affine subspaces
Theoretical Computer Science·2024· 1 cited
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning
arXiv (Cornell University)·2024Open Access
Tight Lower Bounds on Non-Adaptive Group Testing Estimation
SSRN Electronic Journal·2024Open Access
Almost Optimal Adaptive Proper Learning Polynomials
SSRN Electronic Journal·2024Open Access
On Detecting Some Defective Items in Group Testing
Lecture notes in computer science·2023
Improved Lower Bound for Estimating the Number of Defective Items
Lecture notes in computer science·2023· 3 cited
A Tight Lower Bound of $Ω(\log n)$ for the Estimation of the Number of Defective Items
arXiv (Cornell University)·2023Open Access
Improved Lower Bound for Estimating the Number of Defective Items
arXiv (Cornell University)·2023Open Access
On Detecting Some Defective Items in Group Testing
arXiv (Cornell University)·2023Open Access
Superpolynomial Lower Bounds for Learning Monotone Classes
arXiv (Cornell University)·2023Open Access
A Note on Property Testing of the Binary Rank
arXiv (Cornell University)·2023Open Access
On One-Sided Testing Affine Subspaces
Lecture notes in computer science·2023
Almost Optimal Proper Learning and Testing Polynomials
arXiv (Cornell University)·2022Open Access
Almost Optimal Proper Learning and Testing Polynomials
Lecture notes in computer science·2022
page 1 of 12Next →

Frequent Co-authors

Thomas R. Hancock(7), Lisa Hellerstein(7), Christino Tamon(6), Jeffrey C. Jackson(5), Richard Cleve(5), Sally A. Goldman(4), Eyal Kushilevitz(3), Amos Beimel(2), Francesco Bergadano(2), Stefano Varricchio(2), Lynn Burroughs(2), Michael Kaminski(2), Sleiman Matar(2), Sampath Kannan(2), H. David Mathias(2), G. Seroussi(1), Nadav Eiron(1), Gilles Stoltz(1), Nicolas Vayatis(1), Thomas Zeugmann(1)