default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNader H. Bshouty
- > Home > Persons > Nader H. Bshouty
Publications
- 2024
[c97]Nader H. Bshouty, George Haddad
:
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning. APPROX/RANDOM 2024: 38:1-38:15- [i66]Nader H. Bshouty, George Haddad:
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning. CoRR abs/2407.11832 (2024) - 2023
- [c93]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
On Detecting Some Defective Items in Group Testing. COCOON (1) 2023: 244-271 - [i62]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
On Detecting Some Defective Items in Group Testing. CoRR abs/2307.04822 (2023) - 2022
- [c89]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
On Testing Decision Tree. STACS 2022: 17:1-17:16 - 2021
- [j70]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
Optimal deterministic group testing algorithms to estimate the number of defectives. Theor. Comput. Sci. 874: 46-58 (2021) - [i53]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
On Learning and Testing Decision Tree. CoRR abs/2108.04587 (2021) - 2020
- [c86]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives. COCOA 2020: 393-410 - [c85]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: 101-112 - [c84]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: 18:1-18:12 - [i52]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 abs/2001.00441 (2020) - [i49]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives. CoRR abs/2009.02520 (2020) - 2019
- [c82]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
Adaptive Exact Learning of Decision Trees from Membership Queries. ALT 2019: 207-234 - [i46]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
Adaptive Exact Learning of Decision Trees from Membership Queries. CoRR abs/1901.07750 (2019) - [i44]Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon:
Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing. CoRR abs/1911.01694 (2019) - 2018
- [c79]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: 93-110 - [i41]Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad, Thomas Hashem, Fadi Khoury, Omar Sharafy:
Elementary Proofs of Some Stirling Bounds. CoRR abs/1802.07046 (2018) - 2017
- [i35]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers. CoRR abs/1707.00821 (2017) - [i33]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 abs/1712.00615 (2017) - 2016
- [c73]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers. ALT 2016: 207-222
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-10 21:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
