Nader H. Bshouty

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 69

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

ALT

Theor. Comput. Sci.

Publications

Nader H. Bshouty
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning. Electron. Colloquium Comput. Complex. (2024)
Nader H. Bshouty, George Haddad
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning. CoRR (2024)
Nader H. Bshouty
On one-sided testing affine subspaces. Theor. Comput. Sci. 1013 (2024)
Nader H. Bshouty, Gergely Harcos
A Tight Lower Bound of Ω(log n) for the Estimation of the Number of Defective Items. Electron. Colloquium Comput. Complex. (2023)
Nader H. Bshouty
A Note on Property Testing of the Binary Rank. CoRR (2023)
Nader H. Bshouty
On One-Sided Testing Affine Subspaces. CIAC (2023)
Nader H. Bshouty
On Property Testing of the Binary Rank. MFCS (2023)
Nader H. Bshouty
Non-Adaptive Proper Learning Polynomials. STACS (2023)
Nader H. Bshouty
Improved Lower Bound for Estimating the Number of Defective Items. COCOA (1) (2023)
Nader H. Bshouty
Improved Lower Bound for Estimating the Number of Defective Items. CoRR (2023)
Nader H. Bshouty
Superpolynomial Lower Bounds for Learning Monotone Classes. CoRR (2023)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
On Detecting Some Defective Items in Group Testing. CoRR (2023)
Nader H. Bshouty, Gergely Harcos
A Tight Lower Bound of Ω(log n) for the Estimation of the Number of Defective Items. CoRR (2023)
Nader H. Bshouty
Superpolynomial Lower Bounds for Learning Monotone Classes. Electron. Colloquium Comput. Complex. (2023)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
On Detecting Some Defective Items in Group Testing. COCOON (1) (2023)
Nader H. Bshouty
-linear. Theor. Comput. Sci. 950 (2023)
Nader H. Bshouty
Superpolynomial Lower Bounds for Learning Monotone Classes. APPROX/RANDOM (2023)
Nader H. Bshouty
Almost Optimal Proper Learning and Testing Polynomials. LATIN (2022)
Nader H. Bshouty, Oded Goldreich
On properties that are non-trivial to test. Electron. Colloquium Comput. Complex. 29 (2022)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
On Testing Decision Tree. STACS (2022)
Nader H. Bshouty
On One-Sided Testing Affine Subspaces. Electron. Colloquium Comput. Complex. (2022)
Nader H. Bshouty
Non-Adaptive Proper Learning Polynomials. Electron. Colloquium Comput. Complex. (2022)
Nader H. Bshouty
Almost Optimal Proper Learning and Testing Polynomials. CoRR (2022)
Nader H. Bshouty
An Optimal Tester for k-Linear. WALCOM (2022)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
Optimal deterministic group testing algorithms to estimate the number of defectives. Theor. Comput. Sci. 874 (2021)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
On Learning and Testing Decision Tree. CoRR (2021)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon, Raghd Boulos, Foad Moalem, Jalal Nada, Elias Noufi, Yara Zaknoon
Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives. SWAT (2020)
Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon
Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing. SOFSEM (2020)
Nader H. Bshouty
Lecture Note on LCSSX's Lower Bounds for Non-Adaptive Distribution-free Property Testing. CoRR (2020)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives. COCOA (2020)
Nader H. Bshouty
An Optimal Tester for $k$-Linear. CoRR (2020)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives. CoRR (2020)
Nader H. Bshouty
Almost Optimal Testers for Concise Representations. APPROX-RANDOM (2020)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon, Raghd Boulos, Foad Moalem, Jalal Nada, Elias Noufi, Yara Zaknoon
Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives. CoRR (2020)
Nader H. Bshouty
An Optimal Tester for k-Linear. Electron. Colloquium Comput. Complex. 27 (2020)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
Adaptive Exact Learning of Decision Trees from Membership Queries. ALT (2019)
Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon
Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing. CoRR (2019)
Nader H. Bshouty
Almost Optimal Testers for Concise Representations. CoRR (2019)
Nader H. Bshouty
Almost Optimal Distribution-free Junta Testing. CoRR (2019)
Nader H. Bshouty
Lower Bound for Non-Adaptive Estimation of the Number of Defective Items. ISAAC (2019)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
Adaptive Exact Learning of Decision Trees from Membership Queries. CoRR (2019)
Nader H. Bshouty
Almost Optimal Distribution-Free Junta Testing. Computational Complexity Conference (2019)
Nader H. Bshouty
Almost Optimal Testers for Concise Representations. Electron. Colloquium Comput. Complex. 26 (2019)
Hasan Abasi, Nader H. Bshouty
On Learning Graphs with Edge-Detecting Queries. ALT (2019)
Nader H. Bshouty, Areej Costa
Exact learning of juntas from membership queries. Theor. Comput. Sci. 742 (2018)
Nader H. Bshouty
Lower Bound for Non-Adaptive Estimate the Number of Defective Items. Electron. Colloquium Comput. Complex. 25 (2018)
Hasan Abasi, Nader H. Bshouty
On Learning Graphs with Edge-Detecting Queries. CoRR (2018)
Nader H. Bshouty, Waseem Makhoul
On Polynomial time Constructions of Minimum Height Decision Tree. CoRR (2018)
Nader H. Bshouty
Exact learning from an honest teacher that answers membership queries. Theor. Comput. Sci. 733 (2018)
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
Non-adaptive learning of a hidden hypergraph. Theor. Comput. Sci. 716 (2018)
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad, Thomas Hashem, Fadi Khoury, Omar Sharafy
Adaptive Group Testing Algorithms to Estimate the Number of Defectives. ALT (2018)
Nader H. Bshouty, Waseem Makhoul
On Polynomial Time Constructions of Minimum Height Decision Tree. ISAAC (2018)
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad, Thomas Hashem, Fadi Khoury, Omar Sharafy
Elementary Proofs of Some Stirling Bounds. CoRR (2018)
Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla
Non-Adaptive Randomized Algorithm for Group Testing. CoRR (2017)
Nader H. Bshouty, Areej Costa
Exact Learning of Juntas from Membership Queries. CoRR (2017)
Nader H. Bshouty, Ariel Gabizon
Almost Optimal Cover-Free Families. CIAC (2017)
Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav
Learning Disjunctions of Predicates. COLT (2017)
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad, Thomas Hashem, Fadi Khoury, Omar Sharafy
Adaptive Group Testing Algorithms to Estimate the Number of Defectives. CoRR (2017)
Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla
Non-Adaptive Randomized Algorithm for Group Testing. ALT (2017)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers. CoRR (2017)
Nader H. Bshouty
Exact Learning from an Honest Teacher That Answers Membership Queries. CoRR (2017)
Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav
Learning Disjunctions of Predicates. CoRR (2017)
Nader H. Bshouty
-wise Independent Sets. Electron. Colloquium Comput. Complex. 23 (2016)
Nader H. Bshouty, Areej Costa
Exact Learning of Juntas from Membership Queries. ALT (2016)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers. ALT (2016)
Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla
Enumerating all the Irreducible Polynomials over Finite Field. CoRR (2016)
Nader H. Bshouty
Derandomizing Chernoff Bound with Union Bound with an Application to $k$-wise Independent Sets. CoRR (2016)
Ali Z. Abdi, Nader H. Bshouty
Lower Bounds for Cover-Free Families. Electron. J. Comb. 23 (2) (2016)
Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty
Learning boolean halfspaces with small weights from membership queries. Theor. Comput. Sci. 650 (2016)
Nader H. Bshouty, Hanna Mazzawi
. SIAM J. Discret. Math. 29 (1) (2015)
Nader H. Bshouty
Linear Time Constructions of Some d -Restriction Problems. CIAC (2015)
Nader H. Bshouty, Ariel Gabizon
Almost Optimal Cover-Free Families. CoRR (2015)
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
Non-adaptive Learning of a Hidden Hypergraph. ALT (2015)
Ali Z. Abdi, Nader H. Bshouty
Lower Bounds for Cover-Free Families. CoRR (2015)
Nader H. Bshouty
Dense Testers: Almost Linear Time and Locally Explicit Constructions. Electron. Colloquium Comput. Complex. 22 (2015)
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
Non-Adaptive Learning a Hidden Hipergraph. CoRR (2015)
Nader H. Bshouty, Ali Z. Abdi
Lower Bounds for Cover-Free Families. CTW (2015)
Nader H. Bshouty
Testers and their applications. ITCS (2014)
Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty
On r-Simple k-Path. MFCS (2) (2014)
Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann
Guest Editors' foreword. Theor. Comput. Sci. 558 (2014)
Hasan Abasi, Nader H. Bshouty
A Simple Algorithm for Hamiltonicity. CoRR (2014)
Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty
-Path. Electron. Colloquium Comput. Complex. 21 (2014)
Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty
Learning Boolean Halfspaces with Small Weights from Membership Queries. ALT (2014)
Nader H. Bshouty
Dense Testers: Almost Linear Time and Locally Explicit Constructions. CoRR (2014)
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
On Exact Learning Monotone DNF from Membership Queries. ALT (2014)
Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty
Learning Boolean Halfspaces with Small Weights from Membership Queries. CoRR (2014)
Nader H. Bshouty
Linear time Constructions of some $d$-Restriction Problems. CoRR (2014)
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
On Exact Learning Monotone DNF from Membership Queries. CoRR (2014)
Nader H. Bshouty
Multilinear Complexity is Equivalent to Optimal Tester Size. Electron. Colloquium Comput. Complex. 20 (2013)
Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty
On $r$-Simple $k$-Path. CoRR (2013)
Nader H. Bshouty
Exact Learning from Membership Queries: Some Techniques, Results and New Directions. ALT (2013)
Hasan Abasi, Nader H. Bshouty
A Simple Algorithm for Undirected Hamiltonicity. Electron. Colloquium Comput. Complex. 20 (2013)
Nader H. Bshouty, Hanna Mazzawi
Toward a deterministic polynomial time algorithm with optimal additive query complexity. Theor. Comput. Sci. 417 (2012)
Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann
Editors' Introduction. ALT (2012)
Nader H. Bshouty, Philip M. Long
Linear classifiers are nearly optimal when hidden variables have diverse effects. Mach. Learn. 86 (2) (2012)
Nader H. Bshouty
Testers and their Applications. Electron. Colloquium Comput. Complex. 19 (2012)
Nader H. Bshouty
Testers. ACM Commun. Comput. Algebra 46 (3/4) (2012)
Nader H. Bshouty
On the Coin Weighing Problem with the Presence of Noise. APPROX-RANDOM (2012)
Nader H. Bshouty, Hanna Mazzawi
Reconstructing weighted graphs with minimal query complexity. Theor. Comput. Sci. 412 (19) (2011)
Nader H. Bshouty, Hanna Mazzawi
. SODA (2011)

Nader H. Bshouty.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nader H. Bshouty