default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNader H. Bshouty
Person information
- affiliation: Technion, Haifa, Israel
- affiliation: University of Calgary, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j72]Nader H. Bshouty:
On one-sided testing affine subspaces. Theor. Comput. Sci. 1013: 114745 (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) - [i65]Nader H. Bshouty:
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j71]Nader H. Bshouty:
An optimal tester for k-linear. Theor. Comput. Sci. 950: 113759 (2023) - [c96]Nader H. Bshouty:
Superpolynomial Lower Bounds for Learning Monotone Classes. APPROX/RANDOM 2023: 34:1-34:20 - [c95]Nader H. Bshouty:
On One-Sided Testing Affine Subspaces. CIAC 2023: 157-171 - [c94]Nader H. Bshouty
:
Improved Lower Bound for Estimating the Number of Defective Items. COCOA (1) 2023: 303-315 - [c93]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
On Detecting Some Defective Items in Group Testing. COCOON (1) 2023: 244-271 - [c92]Nader H. Bshouty:
On Property Testing of the Binary Rank. MFCS 2023: 27:1-27:14 - [c91]Nader H. Bshouty:
Non-Adaptive Proper Learning Polynomials. STACS 2023: 16:1-16:20 - [i64]Nader H. Bshouty:
A Note on Property Testing of the Binary Rank. CoRR abs/2301.04406 (2023) - [i63]Nader H. Bshouty:
Superpolynomial Lower Bounds for Learning Monotone Classes. CoRR abs/2301.08486 (2023) - [i62]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
On Detecting Some Defective Items in Group Testing. CoRR abs/2307.04822 (2023) - [i61]Nader H. Bshouty:
Improved Lower Bound for Estimating the Number of Defective Items. CoRR abs/2308.07721 (2023) - [i60]Nader H. Bshouty, Gergely Harcos:
A Tight Lower Bound of Ω(log n) for the Estimation of the Number of Defective Items. CoRR abs/2309.09613 (2023) - [i59]Nader H. Bshouty:
Superpolynomial Lower Bounds for Learning Monotone Classes. Electron. Colloquium Comput. Complex. TR23 (2023) - [i58]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. TR23 (2023) - 2022
- [c90]Nader H. Bshouty:
Almost Optimal Proper Learning and Testing Polynomials. LATIN 2022: 312-327 - [c89]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
On Testing Decision Tree. STACS 2022: 17:1-17:16 - [c88]Nader H. Bshouty:
An Optimal Tester for k-Linear. WALCOM 2022: 201-212 - [i57]Nader H. Bshouty:
Almost Optimal Proper Learning and Testing Polynomials. CoRR abs/2202.03207 (2022) - [i56]Nader H. Bshouty, Oded Goldreich:
On properties that are non-trivial to test. Electron. Colloquium Comput. Complex. TR22 (2022) - [i55]Nader H. Bshouty:
Non-Adaptive Proper Learning Polynomials. Electron. Colloquium Comput. Complex. TR22 (2022) - [i54]Nader H. Bshouty:
On One-Sided Testing Affine Subspaces. Electron. Colloquium Comput. Complex. TR22 (2022) - 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
- [c87]Nader H. Bshouty:
Almost Optimal Testers for Concise Representations. APPROX-RANDOM 2020: 5:1-5:20 - [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) - [i51]Nader H. Bshouty:
Lecture Note on LCSSX's Lower Bounds for Non-Adaptive Distribution-free Property Testing. CoRR abs/2004.05922 (2020) - [i50]Nader H. Bshouty:
An Optimal Tester for $k$-Linear. CoRR abs/2006.04409 (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) - [i48]Nader H. Bshouty:
An Optimal Tester for k-Linear. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c83]Hasan Abasi, Nader H. Bshouty:
On Learning Graphs with Edge-Detecting Queries. ALT 2019: 3-30 - [c82]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
Adaptive Exact Learning of Decision Trees from Membership Queries. ALT 2019: 207-234 - [c81]Nader H. Bshouty:
Almost Optimal Distribution-Free Junta Testing. CCC 2019: 2:1-2:13 - [c80]Nader H. Bshouty:
Lower Bound for Non-Adaptive Estimation of the Number of Defective Items. ISAAC 2019: 2:1-2:9 - [i47]Nader H. Bshouty:
Almost Optimal Distribution-free Junta Testing. CoRR abs/1901.00717 (2019) - [i46]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
Adaptive Exact Learning of Decision Trees from Membership Queries. CoRR abs/1901.07750 (2019) - [i45]Nader H. Bshouty:
Almost Optimal Testers for Concise Representations. CoRR abs/1904.09958 (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) - [i43]Nader H. Bshouty:
Almost Optimal Testers for Concise Representations. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j69]Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi:
Non-adaptive learning of a hidden hypergraph. Theor. Comput. Sci. 716: 15-27 (2018) - [j68]Nader H. Bshouty:
Exact learning from an honest teacher that answers membership queries. Theor. Comput. Sci. 733: 4-43 (2018) - [j67]Nader H. Bshouty, Areej Costa:
Exact learning of juntas from membership queries. Theor. Comput. Sci. 742: 82-97 (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 - [c78]Nader H. Bshouty, Waseem Makhoul:
On Polynomial Time Constructions of Minimum Height Decision Tree. ISAAC 2018: 34:1-34:12 - [i42]Nader H. Bshouty, Waseem Makhoul:
On Polynomial time Constructions of Minimum Height Decision Tree. CoRR abs/1802.00233 (2018) - [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) - [i40]Hasan Abasi, Nader H. Bshouty:
On Learning Graphs with Edge-Detecting Queries. CoRR abs/1803.10639 (2018) - [i39]Nader H. Bshouty:
Lower Bound for Non-Adaptive Estimate the Number of Defective Items. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c77]Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla:
Non-Adaptive Randomized Algorithm for Group Testing. ALT 2017: 109-128 - [c76]Nader H. Bshouty, Ariel Gabizon:
Almost Optimal Cover-Free Families. CIAC 2017: 140-151 - [c75]Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav:
Learning Disjunctions of Predicates. COLT 2017: 346-369 - [i38]Nader H. Bshouty:
Exact Learning from an Honest Teacher That Answers Membership Queries. CoRR abs/1706.03935 (2017) - [i37]Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav:
Learning Disjunctions of Predicates. CoRR abs/1706.05070 (2017) - [i36]Nader H. Bshouty, Areej Costa:
Exact Learning of Juntas from Membership Queries. CoRR abs/1706.06934 (2017) - [i35]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers. CoRR abs/1707.00821 (2017) - [i34]Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla:
Non-Adaptive Randomized Algorithm for Group Testing. CoRR abs/1708.02787 (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
- [j66]Ali Z. Abdi, Nader H. Bshouty:
Lower Bounds for Cover-Free Families. Electron. J. Comb. 23(2): 2 (2016) - [j65]Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty:
Learning boolean halfspaces with small weights from membership queries. Theor. Comput. Sci. 650: 45-56 (2016) - [c74]Nader H. Bshouty, Areej Costa:
Exact Learning of Juntas from Membership Queries. ALT 2016: 115-129 - [c73]Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers. ALT 2016: 207-222 - [i32]Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla:
Enumerating all the Irreducible Polynomials over Finite Field. CoRR abs/1602.05032 (2016) - [i31]Nader H. Bshouty:
Derandomizing Chernoff Bound with Union Bound with an Application to $k$-wise Independent Sets. CoRR abs/1608.01568 (2016) - [i30]Nader H. Bshouty:
Derandomizing Chernoff Bound with Union Bound with an Application to k-wise Independent Sets. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j64]Nader H. Bshouty, Hanna Mazzawi:
On Parity Check (0, 1)-Matrix over ℤp. SIAM J. Discret. Math. 29(1): 631-657 (2015) - [c72]Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi:
Non-adaptive Learning of a Hidden Hypergraph. ALT 2015: 89-101 - [c71]Nader H. Bshouty:
Linear Time Constructions of Some d -Restriction Problems. CIAC 2015: 74-88 - [i29]Nader H. Bshouty, Ali Z. Abdi:
Lower Bounds for Cover-Free Families. CTW 2015: 48-51 - [i28]Ali Z. Abdi, Nader H. Bshouty:
Lower Bounds for Cover-Free Families. CoRR abs/1502.03578 (2015) - [i27]Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi:
Non-Adaptive Learning a Hidden Hipergraph. CoRR abs/1502.04137 (2015) - [i26]Nader H. Bshouty, Ariel Gabizon:
Almost Optimal Cover-Free Families. CoRR abs/1507.07368 (2015) - [i25]Nader H. Bshouty:
Dense Testers: Almost Linear Time and Locally Explicit Constructions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j63]Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann:
Guest Editors' foreword. Theor. Comput. Sci. 558: 1-4 (2014) - [c70]Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty:
Learning Boolean Halfspaces with Small Weights from Membership Queries. ALT 2014: 96-110 - [c69]Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi:
On Exact Learning Monotone DNF from Membership Queries. ALT 2014: 111-124 - [c68]Nader H. Bshouty:
Testers and their applications. ITCS 2014: 327-352 - [c67]Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty:
On r-Simple k-Path. MFCS (2) 2014: 1-12 - [i24]Hasan Abasi, Nader H. Bshouty:
A Simple Algorithm for Hamiltonicity. CoRR abs/1404.2827 (2014) - [i23]Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi:
On Exact Learning Monotone DNF from Membership Queries. CoRR abs/1405.0792 (2014) - [i22]Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty:
Learning Boolean Halfspaces with Small Weights from Membership Queries. CoRR abs/1405.1535 (2014) - [i21]Nader H. Bshouty:
Linear time Constructions of some $d$-Restriction Problems. CoRR abs/1406.2108 (2014) - [i20]Nader H. Bshouty:
Dense Testers: Almost Linear Time and Locally Explicit Constructions. CoRR abs/1412.5889 (2014) - [i19]Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty:
On r-Simple k-Path. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c66]Nader H. Bshouty:
Exact Learning from Membership Queries: Some Techniques, Results and New Directions. ALT 2013: 33-52 - [i18]Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty:
On $r$-Simple $k$-Path. CoRR abs/1312.4863 (2013) - [i17]Hasan Abasi, Nader H. Bshouty:
A Simple Algorithm for Undirected Hamiltonicity. Electron. Colloquium Comput. Complex. TR13 (2013) - [i16]Nader H. Bshouty:
Multilinear Complexity is Equivalent to Optimal Tester Size. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j62]Nader H. Bshouty:
Testers. ACM Commun. Comput. Algebra 46(3/4): 78-79 (2012) - [j61]Nader H. Bshouty, Philip M. Long:
Linear classifiers are nearly optimal when hidden variables have diverse effects. Mach. Learn. 86(2): 209-231 (2012) - [j60]Nader H. Bshouty, Hanna Mazzawi:
Toward a deterministic polynomial time algorithm with optimal additive query complexity. Theor. Comput. Sci. 417: 23-35 (2012) - [c65]Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann:
Editors' Introduction. ALT 2012: 1-11 - [c64]Nader H. Bshouty:
On the Coin Weighing Problem with the Presence of Noise. APPROX-RANDOM 2012: 471-482 - [e2]Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann:
Algorithmic Learning Theory - 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings. Lecture Notes in Computer Science 7568, Springer 2012, ISBN 978-3-642-34105-2 [contents] - [i15]Nader H. Bshouty:
Testers and their Applications. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j59]Nader H. Bshouty, Hanna Mazzawi:
Reconstructing weighted graphs with minimal query complexity. Theor. Comput. Sci. 412(19): 1782-1790 (2011) - [c63]Nader H. Bshouty, Hanna Mazzawi:
On Parity Check (0, 1)-Matrix over Zp. SODA 2011: 1383-1394 - [i14]Nader H. Bshouty, Hanna Mazzawi:
Algorithms for the Coin Weighing Problems with the Presence of Noise. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c62]Nader H. Bshouty, Philip M. Long:
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering. ICML 2010: 135-142 - [c61]Nader H. Bshouty, Hanna Mazzawi:
Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity. MFCS 2010: 221-232 - [c60]Nader H. Bshouty, Hanna Mazzawi:
Optimal Query Complexity for Reconstructing Hypergraphs. STACS 2010: 143-154 - [i13]Nader H. Bshouty, Hanna Mazzawi:
Optimal Query Complexity for Reconstructing Hypergraphs. CoRR abs/1001.0405 (2010)
2000 – 2009
- 2009
- [j58]Nader H. Bshouty, Yi Li, Philip M. Long:
Using the doubling dimension to analyze the generalization of learning algorithms. J. Comput. Syst. Sci. 75(6): 323-335 (2009) - [c59]Nader H. Bshouty, Hanna Mazzawi:
Reconstructing Weighted Graphs with Minimal Query Complexity. ALT 2009: 97-109 - [c58]Nader H. Bshouty:
Optimal Algorithms for the Coin Weighing Problem with a Spring Scale. COLT 2009 - [c57]Nader H. Bshouty, Philip M. Long:
Linear Classifiers are Nearly Optimal When Hidden Variables Have Diverse Effect. COLT 2009 - [i12]Hanna Mazzawi, Nader H. Bshouty:
On Parity Check (0, 1)-Matrix over Zp. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j57]Laurence Bisht, Nader H. Bshouty, Lawrance Khoury:
Learning with errors in answers to membership queries. J. Comput. Syst. Sci. 74(1): 2-15 (2008) - [j56]Nader H. Bshouty, Claudio Gentile:
Guest Editors' Introduction: Special issue on Learning Theory (COLT-2007). Mach. Learn. 72(1-2): 1-4 (2008) - [r1]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
Learning Automata. Encyclopedia of Algorithms 2008 - 2007
- [j55]Rotem Bennet, Nader H. Bshouty:
Learning attribute-efficiently with corrupt oracles. Theor. Comput. Sci. 387(1): 32-50 (2007) - [e1]Nader H. Bshouty, Claudio Gentile:
Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings. Lecture Notes in Computer Science 4539, Springer 2007, ISBN 978-3-540-72925-9 [contents] - 2006
- [j54]Nader H. Bshouty, Michael Kaminski:
Polynomial multiplication over finite fields: from quadratic to straight-line complexity. Comput. Complex. 15(3): 252-262 (2006) - [j53]Nader H. Bshouty, Lynn Burroughs:
Maximizing agreements and coagnostic learning. Theor. Comput. Sci. 350(1): 24-39 (2006) - [c56]Nader H. Bshouty, Ehab Wattad:
On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle. ALT 2006: 48-62 - [c55]Nader H. Bshouty, Iddo Bentov:
On Exact Learning from Random Walk. ALT 2006: 184-198 - [c54]Laurence Bisht, Nader H. Bshouty, Hanna Mazzawi:
On Optimal Learning Algorithms for Multiplicity Automata. COLT 2006: 184-198 - [c53]Nader H. Bshouty, Hanna Mazzawi:
Exact Learning Composed Classes with a Small Number of Mistakes. COLT 2006: 199-213 - 2005
- [j52]Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon:
Exploring learnability between exact and PAC. J. Comput. Syst. Sci. 70(4): 471-484 (2005) - [j51]Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio:
Learning DNF from random walks. J. Comput. Syst. Sci. 71(3): 250-265 (2005) - [j50]Nader H. Bshouty, Lynn Burroughs:
Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning. Mach. Learn. 59(1-2): 99-123 (2005) - [c52]Rotem Bennet, Nader H. Bshouty:
Learning Attribute-Efficiently with Corrupt Oracles. ALT 2005: 183-197 - 2004
- [j49]Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon:
More efficient PAC-learning of DNF with membership queries under the uniform distribution. J. Comput. Syst. Sci. 68(1): 205-234 (2004) - [c51]Nader H. Bshouty:
Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability. COLT 2004: 64-76 - [c50]Laurence Bisht, Nader H. Bshouty, Lawrance Khoury:
Learning with Errors in Answers to Membership Queries. FOCS 2004: 611-620 - 2003
- [j48]Nader H. Bshouty:
The monotone theory for the PAC-model. Inf. Comput. 186(1): 20-35 (2003) - [j47]Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon:
Uniform-distribution attribute noise learnability. Inf. Comput. 187(2): 277-290 (2003) - [j46]Nader H. Bshouty, Lynn Burroughs:
On the Proper Learning of Axis-Parallel Concepts. J. Mach. Learn. Res. 4: 157-176 (2003) - [c49]Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio:
Learning DNF from Random Walks. FOCS 2003: 189-198 - 2002
- [j45]Nader H. Bshouty, Vitaly Feldman:
On Using Extended Statistical Queries to Avoid Membership Queries. J. Mach. Learn. Res. 2: 359-395 (2002) - [j44]Nader H. Bshouty, Nadav Eiron:
Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries. J. Mach. Learn. Res. 3: 49-57 (2002) - [j43]Nader H. Bshouty, Dmitry Gavinsky:
On Boosting with Polynomially Bounded Distributions. J. Mach. Learn. Res. 3: 483-506 (2002) - [j42]Nader H. Bshouty, Yishay Mansour:
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. SIAM J. Comput. 31(6): 1909-1925 (2002) - [j41]Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz:
PAC learning with nasty noise. Theor. Comput. Sci. 288(2): 255-275 (2002) - [c48]Nader H. Bshouty, Lynn Burroughs:
Maximizing Agreements and CoAgnostic Learning. ALT 2002: 83-97 - [c47]Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon:
Exploring Learnability between Exact and PAC. COLT 2002: 244-254 - [c46]Nader H. Bshouty, Lynn Burroughs:
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory. COLT 2002: 271-286 - [c45]Nader H. Bshouty, Lynn Burroughs:
On the Proper Learning of Axis Parallel Concepts. COLT 2002: 287-302 - [c44]Nader H. Bshouty, Dmitry Gavinsky:
PAC = PAExact and Other Equivalent Models in Learning. FOCS 2002: 167-176 - [i11]Nader H. Bshouty, Lynn Burroughs:
On the proper learning of axis parallel concepts. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [c43]Nader H. Bshouty, Dmitry Gavinsky:
On Boosting with Optimal Poly-Bounded Distributions. COLT/EuroCOLT 2001: 490-506 - [c42]Nader H. Bshouty, Vitaly Feldman:
On Using Extended Statistical Queries to Avoid Membership Queries. COLT/EuroCOLT 2001: 529-545 - [c41]Nader H. Bshouty, Nadav Eiron:
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries. COLT/EuroCOLT 2001: 546-557 - [c40]Nader H. Bshouty, Avi Owshanko:
Learning Regular Sets with an Incomplete Membership Oracle. COLT/EuroCOLT 2001: 574-588 - 2000
- [j40]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
Learning functions represented as multiplicity automata. J. ACM 47(3): 506-530 (2000)
1990 – 1999
- 1999
- [j39]Nader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca:
Meeting Times of Random Walks on Graphs. Inf. Process. Lett. 69(5): 259-265 (1999) - [j38]Nader H. Bshouty:
Lower Bounds for the Complexity of Functions in a Realistic RAM Model. J. Algorithms 32(1): 1-20 (1999) - [j37]Nader H. Bshouty, Jeffrey C. Jackson:
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle. SIAM J. Comput. 28(3): 1136-1153 (1999) - [c39]Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz:
PAC Learning with Nasty Noise. ALT 1999: 206-218 - [c38]Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon:
Uniform-Distribution Attribute Noise Learnability. COLT 1999: 75-80 - [c37]Nader H. Bshouty, David K. Wilson:
On Learning in the Presence of Unspecified Attribute Values. COLT 1999: 81-87 - [c36]Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon:
More Efficient PAC-Learning of DNF with Membership Queries Under the Uniform Distribution. COLT 1999: 286-295 - [c35]Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar Radwan, Fathi Saleh:
Learning Threshold Functions with Small Weights Using Membership Queries. COLT 1999: 318-322 - 1998
- [j36]Nader H. Bshouty, Christino Tamon, David K. Wilson:
On Learning Decision Trees with Large Output Domains. Algorithmica 20(1): 77-100 (1998) - [j35]Nader H. Bshouty, Christino Tamon, David K. Wilson:
Learning Matrix Functions over Rings. Algorithmica 22(1/2): 91-111 (1998) - [j34]Nader H. Bshouty, Sally A. Goldman, H. David Mathias:
Noise-Tolerant Parallel Learning of Geometric Concepts. Inf. Comput. 147(1): 89-110 (1998) - [j33]Nader H. Bshouty, Christino Tamon, David K. Wilson:
On Learning width Two Branching Programs. Inf. Process. Lett. 65(4): 217-222 (1998) - [j32]Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki:
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. J. ACM 45(5): 863-890 (1998) - [j31]Nader H. Bshouty:
On the Direct Sum Conjecture in the Straight Line Model. J. Complex. 14(1): 49-62 (1998) - [j30]Daoud Bshouty, Nader H. Bshouty:
On Interpolating Arithmetic Read-Once Formulas with Exponentiation. J. Comput. Syst. Sci. 56(1): 112-124 (1998) - [j29]Nader H. Bshouty, Lisa Hellerstein:
Attribute-Efficient Learning in Query and Mistake-Bound Models. J. Comput. Syst. Sci. 56(3): 310-319 (1998) - [j28]Nader H. Bshouty, Richard Cleve:
Interpolating Arithmetic Read-Once Formulas in Parallel. SIAM J. Comput. 27(2): 401-413 (1998) - [j27]Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias:
Exact Learning of Discretized Geometric Concepts. SIAM J. Comput. 28(2): 674-699 (1998) - [c34]Nader H. Bshouty, Lynn Burroughs:
Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem. STACS 1998: 298-308 - [c33]Nader H. Bshouty:
A New Composition Theorem for Learning Algorithms. STOC 1998: 583-589 - [i10]Nader H. Bshouty:
A New Composition Theorem for Learning Algorithms. Electron. Colloquium Comput. Complex. TR98 (1998) - [i9]Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon:
Attribute Efficient PAC Learning of DNF with Membership Queries under the Uniform Distribution. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j26]Nader H. Bshouty:
Simple Learning Algorithms Using Divide and Conquer. Comput. Complex. 6(2): 174-194 (1997) - [j25]Nader H. Bshouty:
On Learning Multivariate Polynomials Under the Uniform Distribution. Inf. Process. Lett. 61(6): 303-309 (1997) - [j24]Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
A Tight Bound for Approximating the Square Root. Inf. Process. Lett. 63(4): 211-213 (1997) - [j23]Nader H. Bshouty:
Exact Learning of Formulas in Parallel. Mach. Learn. 26(1): 25-41 (1997) - [c32]Nader H. Bshouty, Christino Tamon, David K. Wilson:
Learning Matrix Functions over Rings. EuroCOLT 1997: 27-37 - [c31]Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio:
On Learning Programs and Small Depth Circuits. EuroCOLT 1997: 150-161 - [c30]Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz:
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. STOC 1997: 324-333 - 1996
- [j22]Nader H. Bshouty:
A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries. Inf. Process. Lett. 59(1): 37-39 (1996) - [j21]Nader H. Bshouty, Christino Tamon:
On the Fourier Spectrum of Monotone Functions. J. ACM 43(4): 747-770 (1996) - [j20]Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar:
Asking Questions to Minimize Errors. J. Comput. Syst. Sci. 52(2): 268-286 (1996) - [j19]Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon:
Oracles and Queries That Are Sufficient for Exact Learning. J. Comput. Syst. Sci. 52(3): 421-433 (1996) - [c29]Nader H. Bshouty, Christino Tamon, David K. Wilson:
On Learning width Two Branching Programs (Extended Abstract). COLT 1996: 224-227 - [c28]Nader H. Bshouty, Lisa Hellerstein:
Attribute-Efficient Learning in Query and Mistake-Bound Models. COLT 1996: 235-243 - [c27]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio:
On the Applications of Multiplicity Automata in Learning. FOCS 1996: 349-358 - [c26]Nader H. Bshouty:
Towards the Learnability of DNF Formulae. STOC 1996: 131-140 - [c25]Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki:
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. STOC 1996: 151-160 - [i8]Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio:
Learning Multivariate Polynomials from Substitution and Equivalence Queries. Electron. Colloquium Comput. Complex. TR96 (1996) - [i7]Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio:
On Learning Branching Programs and Small Depth Circuits. Electron. Colloquium Comput. Complex. TR96 (1996) - [i6]Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz:
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j18]Nader H. Bshouty:
Exact Learning Boolean Function via the Monotone Theory. Inf. Comput. 123(1): 146-153 (1995) - [j17]Nader H. Bshouty:
On the Additive Complexity of 2 x 2 Matrix Multiplication. Inf. Process. Lett. 56(6): 329-335 (1995) - [j16]Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein:
Learning Boolean Read-Once Formulas over Generalized Bases. J. Comput. Syst. Sci. 50(3): 521-542 (1995) - [j15]Nader H. Bshouty, Richard Cleve, Wayne Eberly:
Size-Depth Tradeoffs for Algebraic Formulas. SIAM J. Comput. 24(4): 682-705 (1995) - [j14]Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein:
Learning Arithmetic Read-Once Formulas. SIAM J. Comput. 24(4): 706-735 (1995) - [c24]Nader H. Bshouty:
A Note on Learning Multivariate Polynomials Under the Uniform Distribution (Extended Abstract). COLT 1995: 79-82 - [c23]Nader H. Bshouty, Jeffrey C. Jackson:
Learning DNF over the Uniform Distribution using a Quantum Example Oracle. COLT 1995: 118-127 - [c22]Nader H. Bshouty, Christino Tamon, David K. Wilson:
On Learning Decision Trees with Large Output Domains (Extended Abstract). COLT 1995: 190-197 - [c21]Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer:
On the Learnability of Zn-DNF Formulas (Extended Abstract). COLT 1995: 198-205 - [c20]Nader H. Bshouty, Sally A. Goldman, H. David Mathias:
Noise-Tolerant Parallel Learning of Geometric Concepts. COLT 1995: 345-352 - [c19]Nader H. Bshouty:
Simple Learning Algorithms Using Divide and Conquer. COLT 1995: 447-453 - [c18]Nader H. Bshouty, Yishay Mansour:
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. FOCS 1995: 304-311 - [c17]Nader H. Bshouty, Christino Tamon:
On the Fourier spectrum of monotone functions (Extended Abstract). STOC 1995: 219-228 - [i5]Nader H. Bshouty:
Exact Learning Boolean Functions via the Monotone Theory. Electron. Colloquium Comput. Complex. TR95 (1995) - [i4]Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon:
Oracles and Queries That Are Sufficient for Exact Learning. Electron. Colloquium Comput. Complex. TR95 (1995) - [i3]Nader H. Bshouty, Christino Tamon:
On the Fourier spectrum of Monotone Functions. Electron. Colloquium Comput. Complex. TR95 (1995) - [i2]Nader H. Bshouty:
The Monotone Theory for the PAC-Model. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Nader H. Bshouty:
A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j13]Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski:
An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models. Comput. Complex. 4: 37-61 (1994) - [j12]Nader H. Bshouty:
On the Complexity of Bilinear Forms over Associative Algebras. SIAM J. Comput. 23(4): 815-833 (1994) - [c16]Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon:
Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). COLT 1994: 130-139 - [c15]Daoud Bshouty, Nader H. Bshouty:
On Learning Arithmetic Read-Once Formulas with Exponentiation (Extended Abstract). COLT 1994: 311-317 - [c14]Nader H. Bshouty, Zhixiang Chen, Steven Homer:
On Learning Discretized Geometric Concepts (Extended Abstract). FOCS 1994: 54-63 - 1993
- [j11]Nader H. Bshouty:
On the Complexity of Functions for Random Access Machines. J. ACM 40(2): 211-223 (1993) - [c13]Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar:
Asking Questions to Minimize Errors. COLT 1993: 41-50 - [c12]Nader H. Bshouty:
On the Direct Sum Conjecture in the Straight Line Model. ESA 1993: 85-96 - [c11]Nader H. Bshouty:
Exact Learning via the Monotone Theory (Extended Abstract). FOCS 1993: 302-311 - 1992
- [j10]Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
Fast Exponentiation Using the Truncation Operation. Comput. Complex. 2: 244-255 (1992) - [j9]Nader H. Bshouty:
A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial. Inf. Process. Lett. 41(6): 321-326 (1992) - [j8]Amir Averbuch, Nader H. Bshouty, Michael Kaminski:
A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields. J. Algorithms 13(4): 577-588 (1992) - [c10]Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein:
Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. COLT 1992: 1-15 - [c9]Nader H. Bshouty, Richard Cleve:
On the Exact Learning of Formulas in Parallel (Extended Abstract). FOCS 1992: 513-522 - [c8]Nader H. Bshouty, Geoffrey T. Falk:
Compression of Dictionaries via Extensions to Front Coding. ICCI 1992: 361-364 - [c7]Nader H. Bshouty:
Lower Bounds for the Complexity of Functions in a Realistic RAM Model. ISTCS 1992: 12-23 - [c6]Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein:
Learning Arithmetic Read-Once Formulas. STOC 1992: 370-381 - 1991
- [c5]Nader H. Bshouty, Richard Cleve, Wayne Eberly:
Size-Depth Tradeoffs for Algebraic Formulae. FOCS 1991: 334-341 - [c4]Nader H. Bshouty:
Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains. ICCI 1991: 55-65 - 1990
- [j7]Nader H. Bshouty, Michael Kaminski:
Multiplication of Polynomials over Finite Fields. SIAM J. Comput. 19(3): 452-456 (1990) - [j6]Nader H. Bshouty:
Maximal Rank of m x n x (mn - k) Tensors. SIAM J. Comput. 19(3): 467-471 (1990) - [j5]Nader H. Bshouty, Gadiel Seroussi:
Generalizations of the Normal Basis Theorem of Finite Fields. SIAM J. Discret. Math. 3(3): 330-337 (1990)
1980 – 1989
- 1989
- [j4]Michael Kaminski, Nader H. Bshouty:
Multiplicative complexity of polynomial multiplication over finite fields. J. ACM 36(1): 150-170 (1989) - [j3]Nader H. Bshouty:
A Lower Bound for Matrix Multiplication. SIAM J. Comput. 18(4): 759-765 (1989) - [c3]Nader H. Bshouty:
On the Extended Direct Sum Conjecture. STOC 1989: 177-185 - 1988
- [j2]Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty:
Addition Requirements for Matrix and Transposed Matrix Products. J. Algorithms 9(3): 354-364 (1988) - [j1]Gadiel Seroussi, Nader H. Bshouty:
Vector sets for exhaustive testing of logic circuits. IEEE Trans. Inf. Theory 34(3): 513-522 (1988) - [c2]Nader H. Bshouty:
A Lower Bound for Matrix Multiplication. FOCS 1988: 64-67 - 1987
- [c1]Michael Kaminski, Nader H. Bshouty:
Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract). FOCS 1987: 138-140
Coauthor Index
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-10-07 21:20 CEST 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:
