Nader H. Bshouty

245 papers A* 46A 9B 26C 7Journal 141Unranked 14
YearRankTypeTitle / Venue / Authors
2026 B conf
Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction.
SOFSEM
Nader H. Bshouty
2025 J jnl
A tight lower bound on non-adaptive group testing estimation.
Discret. Appl. Math.
Nader H. Bshouty, Tsun-Ming Cheung, Gergely Harcos, Hamed Hatami, Anthony Ostuni
2025 J jnl
Improved lower bound for estimating the number of defective items.
J. Comb. Optim.
Nader H. Bshouty
2025 J jnl
On Exact Learning of
CoRR
Nader H. Bshouty
2025 — conf
On Exact Learning of d-Monotone Functions.
CIAC (1)
Nader H. Bshouty
2025 — ch.
On Properties that are Non-trivial to Test.
Computational Complexity and Local Algorithms
Nader H. Bshouty, Oded Goldreich
2025 J jnl
Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction.
CoRR
Nader H. Bshouty
2024 A conf
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning.
APPROX/RANDOM
Nader H. Bshouty, George Haddad
2024 J jnl
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning.
CoRR
Nader H. Bshouty, George Haddad
2024 J jnl
Approximating the Number of Relevant Variables in a Parity Implies Proper Learning.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2024 J jnl
On one-sided testing affine subspaces.
Theor. Comput. Sci.
Nader H. Bshouty
2023 J jnl
A Note on Property Testing of the Binary Rank.
CoRR
Nader H. Bshouty
2023 J jnl
A Tight Lower Bound of Ω(log n) for the Estimation of the Number of Defective Items.
CoRR
Nader H. Bshouty, Gergely Harcos
2023 J jnl
A Tight Lower Bound of Ω(log n) for the Estimation of the Number of Defective Items.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty, Gergely Harcos
2023 J jnl
An optimal tester for
Theor. Comput. Sci.
Nader H. Bshouty
2023 — conf
Improved Lower Bound for Estimating the Number of Defective Items.
COCOA (1)
Nader H. Bshouty
2023 J jnl
Improved Lower Bound for Estimating the Number of Defective Items.
CoRR
Nader H. Bshouty
2023 A conf
Non-Adaptive Proper Learning Polynomials.
STACS
Nader H. Bshouty
2023 — conf
On Detecting Some Defective Items in Group Testing.
COCOON (1)
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2023 J jnl
On Detecting Some Defective Items in Group Testing.
CoRR
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2023 C conf
On One-Sided Testing Affine Subspaces.
CIAC
Nader H. Bshouty
2023 B conf
On Property Testing of the Binary Rank.
MFCS
Nader H. Bshouty
2023 A conf
Superpolynomial Lower Bounds for Learning Monotone Classes.
APPROX/RANDOM
Nader H. Bshouty
2023 J jnl
Superpolynomial Lower Bounds for Learning Monotone Classes.
CoRR
Nader H. Bshouty
2023 J jnl
Superpolynomial Lower Bounds for Learning Monotone Classes.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2022 B conf
Almost Optimal Proper Learning and Testing Polynomials.
LATIN
Nader H. Bshouty
2022 J jnl
Almost Optimal Proper Learning and Testing Polynomials.
CoRR
Nader H. Bshouty
2022 B conf
An Optimal Tester for k-Linear.
WALCOM
Nader H. Bshouty
2022 J jnl
Non-Adaptive Proper Learning Polynomials.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2022 J jnl
On One-Sided Testing Affine Subspaces.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2022 A conf
On Testing Decision Tree.
STACS
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2022 J jnl
On properties that are non-trivial to test.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty, Oded Goldreich
2021 J jnl
On Learning and Testing Decision Tree.
CoRR
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2021 J jnl
Optimal deterministic group testing algorithms to estimate the number of defectives.
Theor. Comput. Sci.
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2020 — conf
Almost Optimal Testers for Concise Representations.
APPROX-RANDOM
Nader H. Bshouty
2020 J jnl
An Optimal Tester for $k$-Linear.
CoRR
Nader H. Bshouty
2020 J jnl
An Optimal Tester for k-Linear.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2020 B conf
Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing.
SOFSEM
Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon
2020 J jnl
Lecture Note on LCSSX's Lower Bounds for Non-Adaptive Distribution-free Property Testing.
CoRR
Nader H. Bshouty
2020 C conf
Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives.
COCOA
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2020 J jnl
Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives.
CoRR
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2020 — conf
Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives.
SWAT
Nader H. Bshouty, Catherine A. Haddad-Zaknoon, Raghd Boulos, Foad Moalem, Jalal Nada, Elias Noufi, Yara Zaknoon
2020 J jnl
Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives.
CoRR
Nader H. Bshouty, Catherine A. Haddad-Zaknoon, Raghd Boulos, Foad Moalem, Jalal Nada, Elias Noufi, Yara Zaknoon
2019 B conf
Adaptive Exact Learning of Decision Trees from Membership Queries.
ALT
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2019 J jnl
Adaptive Exact Learning of Decision Trees from Membership Queries.
CoRR
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2019 A conf
Almost Optimal Distribution-Free Junta Testing.
CCC
Nader H. Bshouty
2019 J jnl
Almost Optimal Distribution-free Junta Testing.
CoRR
Nader H. Bshouty
2019 J jnl
Almost Optimal Testers for Concise Representations.
CoRR
Nader H. Bshouty
2019 J jnl
Almost Optimal Testers for Concise Representations.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2019 J jnl
Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing.
CoRR
Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon
2019 B conf
Lower Bound for Non-Adaptive Estimation of the Number of Defective Items.
ISAAC
Nader H. Bshouty
2019 B conf
On Learning Graphs with Edge-Detecting Queries.
ALT
Hasan Abasi, Nader H. Bshouty
2018 B conf
Adaptive Group Testing Algorithms to Estimate the Number of Defectives.
ALT
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad, Thomas Hashem, Fadi Khoury, Omar Sharafy
2018 J jnl
Elementary Proofs of Some Stirling Bounds.
CoRR
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad, Thomas Hashem, Fadi Khoury, Omar Sharafy
2018 J jnl
Exact learning from an honest teacher that answers membership queries.
Theor. Comput. Sci.
Nader H. Bshouty
2018 J jnl
Exact learning of juntas from membership queries.
Theor. Comput. Sci.
Nader H. Bshouty, Areej Costa
2018 J jnl
Lower Bound for Non-Adaptive Estimate the Number of Defective Items.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2018 J jnl
Non-adaptive learning of a hidden hypergraph.
Theor. Comput. Sci.
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
2018 J jnl
On Learning Graphs with Edge-Detecting Queries.
CoRR
Hasan Abasi, Nader H. Bshouty
2018 B conf
On Polynomial Time Constructions of Minimum Height Decision Tree.
ISAAC
Nader H. Bshouty, Waseem Makhoul
2018 J jnl
On Polynomial time Constructions of Minimum Height Decision Tree.
CoRR
Nader H. Bshouty, Waseem Makhoul
2017 J jnl
Adaptive Group Testing Algorithms to Estimate the Number of Defectives.
CoRR
Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad, Thomas Hashem, Fadi Khoury, Omar Sharafy
2017 C conf
Almost Optimal Cover-Free Families.
CIAC
Nader H. Bshouty, Ariel Gabizon
2017 J jnl
Exact Learning from an Honest Teacher That Answers Membership Queries.
CoRR
Nader H. Bshouty
2017 J jnl
Exact Learning of Juntas from Membership Queries.
CoRR
Nader H. Bshouty, Areej Costa
2017 A* conf
Learning Disjunctions of Predicates.
COLT
Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav
2017 J jnl
Learning Disjunctions of Predicates.
CoRR
Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav
2017 B conf
Non-Adaptive Randomized Algorithm for Group Testing.
ALT
Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla
2017 J jnl
Non-Adaptive Randomized Algorithm for Group Testing.
CoRR
Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla
2017 J jnl
The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers.
CoRR
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2016 J jnl
Derandomizing Chernoff Bound with Union Bound with an Application to
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2016 J jnl
Derandomizing Chernoff Bound with Union Bound with an Application to $k$-wise Independent Sets.
CoRR
Nader H. Bshouty
2016 J jnl
Enumerating all the Irreducible Polynomials over Finite Field.
CoRR
Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla
2016 B conf
Exact Learning of Juntas from Membership Queries.
ALT
Nader H. Bshouty, Areej Costa
2016 J jnl
Learning boolean halfspaces with small weights from membership queries.
Theor. Comput. Sci.
Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty
2016 J jnl
Lower Bounds for Cover-Free Families.
Electron. J. Comb.
Ali Z. Abdi, Nader H. Bshouty
2016 B conf
The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers.
ALT
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
2015 J jnl
Almost Optimal Cover-Free Families.
CoRR
Nader H. Bshouty, Ariel Gabizon
2015 J jnl
Dense Testers: Almost Linear Time and Locally Explicit Constructions.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2015 C conf
Linear Time Constructions of Some d -Restriction Problems.
CIAC
Nader H. Bshouty
2015 C conf
Lower Bounds for Cover-Free Families.
CTW
Nader H. Bshouty, Ali Z. Abdi
2015 J jnl
Lower Bounds for Cover-Free Families.
CoRR
Ali Z. Abdi, Nader H. Bshouty
2015 J jnl
Non-Adaptive Learning a Hidden Hipergraph.
CoRR
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
2015 B conf
Non-adaptive Learning of a Hidden Hypergraph.
ALT
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
2015 J jnl
On Parity Check (0, 1)-Matrix over ℤ
SIAM J. Discret. Math.
Nader H. Bshouty, Hanna Mazzawi
2014 J jnl
A Simple Algorithm for Hamiltonicity.
CoRR
Hasan Abasi, Nader H. Bshouty
2014 J jnl
Dense Testers: Almost Linear Time and Locally Explicit Constructions.
CoRR
Nader H. Bshouty
2014 J jnl
Guest Editors' foreword.
Theor. Comput. Sci.
Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann
2014 B conf
Learning Boolean Halfspaces with Small Weights from Membership Queries.
ALT
Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty
2014 J jnl
Learning Boolean Halfspaces with Small Weights from Membership Queries.
CoRR
Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty
2014 J jnl
Linear time Constructions of some $d$-Restriction Problems.
CoRR
Nader H. Bshouty
2014 J jnl
On
Electron. Colloquium Comput. Complex.
Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty
2014 B conf
On Exact Learning Monotone DNF from Membership Queries.
ALT
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
2014 J jnl
On Exact Learning Monotone DNF from Membership Queries.
CoRR
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
2014 — conf
On r-Simple k-Path.
MFCS (2)
Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty
2014 A conf
Testers and their applications.
ITCS
Nader H. Bshouty
2013 J jnl
A Simple Algorithm for Undirected Hamiltonicity.
Electron. Colloquium Comput. Complex.
Hasan Abasi, Nader H. Bshouty
2013 B conf
Exact Learning from Membership Queries: Some Techniques, Results and New Directions.
ALT
Nader H. Bshouty
2013 J jnl
Multilinear Complexity is Equivalent to Optimal Tester Size.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2013 J jnl
On $r$-Simple $k$-Path.
CoRR
Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty
2012 B ed.
Algorithmic Learning Theory - 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings
ALT
Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann
2012 B conf
Editors' Introduction.
ALT
Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann
2012 J jnl
Linear classifiers are nearly optimal when hidden variables have diverse effects.
Mach. Learn.
Nader H. Bshouty, Philip M. Long
2012 — conf
On the Coin Weighing Problem with the Presence of Noise.
APPROX-RANDOM
Nader H. Bshouty
2012 J jnl
Testers and their Applications.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
2012 J jnl
Testers.
ACM Commun. Comput. Algebra
Nader H. Bshouty
2012 J jnl
Toward a deterministic polynomial time algorithm with optimal additive query complexity.
Theor. Comput. Sci.
Nader H. Bshouty, Hanna Mazzawi
2011 J jnl
Algorithms for the Coin Weighing Problems with the Presence of Noise.
Electron. Colloquium Comput. Complex.
Nader H. Bshouty, Hanna Mazzawi
2011 A* conf
On Parity Check (0, 1)-Matrix over Z
SODA
Nader H. Bshouty, Hanna Mazzawi
2011 J jnl
Reconstructing weighted graphs with minimal query complexity.
Theor. Comput. Sci.
Nader H. Bshouty, Hanna Mazzawi
2010 A* conf
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering.
ICML
Nader H. Bshouty, Philip M. Long
2010 J jnl
Optimal Query Complexity for Reconstructing Hypergraphs
CoRR
Nader H. Bshouty, Hanna Mazzawi
2010 A conf
Optimal Query Complexity for Reconstructing Hypergraphs.
STACS
Nader H. Bshouty, Hanna Mazzawi
2010 B conf
Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity.
MFCS
Nader H. Bshouty, Hanna Mazzawi
2009 A* conf
Linear Classifiers are Nearly Optimal When Hidden Variables Have Diverse Effect.
COLT
Nader H. Bshouty, Philip M. Long
2009 J jnl
On Parity Check (0, 1)-Matrix over Z
Electron. Colloquium Comput. Complex.
Hanna Mazzawi, Nader H. Bshouty
2009 A* conf
Optimal Algorithms for the Coin Weighing Problem with a Spring Scale.
COLT
Nader H. Bshouty
2009 B conf
Reconstructing Weighted Graphs with Minimal Query Complexity.
ALT
Nader H. Bshouty, Hanna Mazzawi
2009 J jnl
Using the doubling dimension to analyze the generalization of learning algorithms.
J. Comput. Syst. Sci.
Nader H. Bshouty, Yi Li, Philip M. Long
2008 J jnl
Guest Editors' Introduction: Special issue on Learning Theory (COLT-2007).
Mach. Learn.
Nader H. Bshouty, Claudio Gentile
2008 — ch.
Learning Automata.
Encyclopedia of Algorithms
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
2008 J jnl
Learning with errors in answers to membership queries.
J. Comput. Syst. Sci.
Laurence Bisht, Nader H. Bshouty, Lawrance Khoury
2007 A* ed.
Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings
COLT
Nader H. Bshouty, Claudio Gentile
2007 J jnl
Learning attribute-efficiently with corrupt oracles.
Theor. Comput. Sci.
Rotem Bennet, Nader H. Bshouty
2006 A* conf
Exact Learning Composed Classes with a Small Number of Mistakes.
COLT
Nader H. Bshouty, Hanna Mazzawi
2006 J jnl
Maximizing agreements and coagnostic learning.
Theor. Comput. Sci.
Nader H. Bshouty, Lynn Burroughs
2006 B conf
On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle.
ALT
Nader H. Bshouty, Ehab Wattad
2006 B conf
On Exact Learning from Random Walk.
ALT
Nader H. Bshouty, Iddo Bentov
2006 A* conf
On Optimal Learning Algorithms for Multiplicity Automata.
COLT
Laurence Bisht, Nader H. Bshouty, Hanna Mazzawi
2006 J jnl
Polynomial multiplication over finite fields: from quadratic to straight-line complexity.
Comput. Complex.
Nader H. Bshouty, Michael Kaminski
2005 J jnl
Exploring learnability between exact and PAC.
J. Comput. Syst. Sci.
Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
2005 B conf
Learning Attribute-Efficiently with Corrupt Oracles.
ALT
Rotem Bennet, Nader H. Bshouty
2005 J jnl
Learning DNF from random walks.
J. Comput. Syst. Sci.
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
2005 J jnl
Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning.
Mach. Learn.
Nader H. Bshouty, Lynn Burroughs
2004 A* conf
Learning with Errors in Answers to Membership Queries.
FOCS
Laurence Bisht, Nader H. Bshouty, Lawrance Khoury
2004 J jnl
More efficient PAC-learning of DNF with membership queries under the uniform distribution.
J. Comput. Syst. Sci.
Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
2004 A* conf
Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability.
COLT
Nader H. Bshouty
2003 A* conf
Learning DNF from Random Walks.
FOCS
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
2003 J jnl
On the Proper Learning of Axis-Parallel Concepts.
J. Mach. Learn. Res.
Nader H. Bshouty, Lynn Burroughs
2003 J jnl
The monotone theory for the PAC-model.
Inf. Comput.
Nader H. Bshouty
2003 J jnl
Uniform-distribution attribute noise learnability.
Inf. Comput.
Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
2002 A* conf
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory.
COLT
Nader H. Bshouty, Lynn Burroughs
2002 A* conf
Exploring Learnability between Exact and PAC.
COLT
Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
2002 J jnl
Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries.
J. Mach. Learn. Res.
Nader H. Bshouty, Nadav Eiron
2002 B conf
Maximizing Agreements and CoAgnostic Learning.
ALT
Nader H. Bshouty, Lynn Burroughs
2002 J jnl
On Boosting with Polynomially Bounded Distributions.
J. Mach. Learn. Res.
Nader H. Bshouty, Dmitry Gavinsky
2002 J jnl
On Using Extended Statistical Queries to Avoid Membership Queries.
J. Mach. Learn. Res.
Nader H. Bshouty, Vitaly Feldman
2002 A* conf
On the Proper Learning of Axis Parallel Concepts.
COLT
Nader H. Bshouty, Lynn Burroughs
2002 J jnl
On the proper learning of axis parallel concepts
Electron. Colloquium Comput. Complex.
Nader H. Bshouty, Lynn Burroughs
2002 A* conf
PAC = PAExact and Other Equivalent Models in Learning.
FOCS
Nader H. Bshouty, Dmitry Gavinsky
2002 J jnl
PAC learning with nasty noise.
Theor. Comput. Sci.
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
2002 J jnl
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials.
SIAM J. Comput.
Nader H. Bshouty, Yishay Mansour
2001 — conf
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries.
COLT/EuroCOLT
Nader H. Bshouty, Nadav Eiron
2001 — conf
Learning Regular Sets with an Incomplete Membership Oracle.
COLT/EuroCOLT
Nader H. Bshouty, Avi Owshanko
2001 — conf
On Boosting with Optimal Poly-Bounded Distributions.
COLT/EuroCOLT
Nader H. Bshouty, Dmitry Gavinsky
2001 — conf
On Using Extended Statistical Queries to Avoid Membership Queries.
COLT/EuroCOLT
Nader H. Bshouty, Vitaly Feldman
2000 J jnl
Learning functions represented as multiplicity automata.
J. ACM
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
1999 J jnl
Learning DNF over the Uniform Distribution Using a Quantum Example Oracle.
SIAM J. Comput.
Nader H. Bshouty, Jeffrey C. Jackson
1999 A* conf
Learning Threshold Functions with Small Weights Using Membership Queries.
COLT
Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar Radwan, Fathi Saleh
1999 J jnl
Lower Bounds for the Complexity of Functions in a Realistic RAM Model.
J. Algorithms
Nader H. Bshouty
1999 J jnl
Meeting Times of Random Walks on Graphs.
Inf. Process. Lett.
Nader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca
1999 A* conf
More Efficient PAC-Learning of DNF with Membership Queries Under the Uniform Distribution.
COLT
Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
1999 A* conf
On Learning in the Presence of Unspecified Attribute Values.
COLT
Nader H. Bshouty, David K. Wilson
1999 B conf
PAC Learning with Nasty Noise.
ALT
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
1999 A* conf
Uniform-Distribution Attribute Noise Learnability.
COLT
Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
1998 J jnl
A New Composition Theorem for Learning Algorithms
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
1998 A* conf
A New Composition Theorem for Learning Algorithms.
STOC
Nader H. Bshouty
1998 J jnl
Attribute Efficient PAC Learning of DNF with Membership Queries under the Uniform Distribution
Electron. Colloquium Comput. Complex.
Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
1998 J jnl
Attribute-Efficient Learning in Query and Mistake-Bound Models.
J. Comput. Syst. Sci.
Nader H. Bshouty, Lisa Hellerstein
1998 J jnl
Exact Learning of Discretized Geometric Concepts.
SIAM J. Comput.
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
1998 J jnl
Interpolating Arithmetic Read-Once Formulas in Parallel.
SIAM J. Comput.
Nader H. Bshouty, Richard Cleve
1998 J jnl
Learning Matrix Functions over Rings.
Algorithmica
Nader H. Bshouty, Christino Tamon, David K. Wilson
1998 A conf
Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem.
STACS
Nader H. Bshouty, Lynn Burroughs
1998 J jnl
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts.
J. ACM
Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
1998 J jnl
Noise-Tolerant Parallel Learning of Geometric Concepts.
Inf. Comput.
Nader H. Bshouty, Sally A. Goldman, H. David Mathias
1998 J jnl
On Interpolating Arithmetic Read-Once Formulas with Exponentiation.
J. Comput. Syst. Sci.
Daoud Bshouty, Nader H. Bshouty
1998 J jnl
On Learning Decision Trees with Large Output Domains.
Algorithmica
Nader H. Bshouty, Christino Tamon, David K. Wilson
1998 J jnl
On Learning width Two Branching Programs.
Inf. Process. Lett.
Nader H. Bshouty, Christino Tamon, David K. Wilson
1998 J jnl
On the Direct Sum Conjecture in the Straight Line Model.
J. Complex.
Nader H. Bshouty
1997 A* conf
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes.
STOC
Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz
1997 J jnl
A Tight Bound for Approximating the Square Root.
Inf. Process. Lett.
Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
1997 J jnl
Exact Learning of Formulas in Parallel.
Mach. Learn.
Nader H. Bshouty
1997 — conf
Learning Matrix Functions over Rings.
EuroCOLT
Nader H. Bshouty, Christino Tamon, David K. Wilson
1997 J jnl
On Learning Multivariate Polynomials Under the Uniform Distribution.
Inf. Process. Lett.
Nader H. Bshouty
1997 — conf
On Learning Programs and Small Depth Circuits.
EuroCOLT
Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
1997 J jnl
Simple Learning Algorithms Using Divide and Conquer.
Comput. Complex.
Nader H. Bshouty
1996 J jnl
A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes
Electron. Colloquium Comput. Complex.
Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz
1996 J jnl
A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries.
Inf. Process. Lett.
Nader H. Bshouty
1996 J jnl
Asking Questions to Minimize Errors.
J. Comput. Syst. Sci.
Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar
1996 A* conf
Attribute-Efficient Learning in Query and Mistake-Bound Models.
COLT
Nader H. Bshouty, Lisa Hellerstein
1996 J jnl
Learning Multivariate Polynomials from Substitution and Equivalence Queries
Electron. Colloquium Comput. Complex.
Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio
1996 A* conf
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts.
STOC
Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki
1996 J jnl
On Learning Branching Programs and Small Depth Circuits
Electron. Colloquium Comput. Complex.
Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio
1996 A* conf
On Learning width Two Branching Programs (Extended Abstract).
COLT
Nader H. Bshouty, Christino Tamon, David K. Wilson
1996 A* conf
On the Applications of Multiplicity Automata in Learning.
FOCS
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
1996 J jnl
On the Fourier Spectrum of Monotone Functions.
J. ACM
Nader H. Bshouty, Christino Tamon
1996 J jnl
Oracles and Queries That Are Sufficient for Exact Learning.
J. Comput. Syst. Sci.
Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
1996 A* conf
Towards the Learnability of DNF Formulae.
STOC
Nader H. Bshouty
1995 A* conf
A Note on Learning Multivariate Polynomials Under the Uniform Distribution (Extended Abstract).
COLT
Nader H. Bshouty
1995 J jnl
A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
1995 J jnl
Exact Learning Boolean Function via the Monotone Theory.
Inf. Comput.
Nader H. Bshouty
1995 J jnl
Exact Learning Boolean Functions via the Monotone Theory
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
1995 J jnl
Learning Arithmetic Read-Once Formulas.
SIAM J. Comput.
Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
1995 J jnl
Learning Boolean Read-Once Formulas over Generalized Bases.
J. Comput. Syst. Sci.
Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
1995 A* conf
Learning DNF over the Uniform Distribution using a Quantum Example Oracle.
COLT
Nader H. Bshouty, Jeffrey C. Jackson
1995 A* conf
Noise-Tolerant Parallel Learning of Geometric Concepts.
COLT
Nader H. Bshouty, Sally A. Goldman, H. David Mathias
1995 A* conf
On Learning Decision Trees with Large Output Domains (Extended Abstract).
COLT
Nader H. Bshouty, Christino Tamon, David K. Wilson
1995 J jnl
On the Additive Complexity of 2 x 2 Matrix Multiplication.
Inf. Process. Lett.
Nader H. Bshouty
1995 J jnl
On the Fourier spectrum of Monotone Functions
Electron. Colloquium Comput. Complex.
Nader H. Bshouty, Christino Tamon
1995 A* conf
On the Fourier spectrum of monotone functions (Extended Abstract).
STOC
Nader H. Bshouty, Christino Tamon
1995 A* conf
On the Learnability of
COLT
Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer
1995 J jnl
Oracles and Queries That Are Sufficient for Exact Learning
Electron. Colloquium Comput. Complex.
Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
1995 A* conf
Simple Learning Algorithms Using Divide and Conquer.
COLT
Nader H. Bshouty
1995 A* conf
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials.
FOCS
Nader H. Bshouty, Yishay Mansour
1995 J jnl
Size-Depth Tradeoffs for Algebraic Formulas.
SIAM J. Comput.
Nader H. Bshouty, Richard Cleve, Wayne Eberly
1995 J jnl
The Monotone Theory for the PAC-Model
Electron. Colloquium Comput. Complex.
Nader H. Bshouty
1994 J jnl
An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models.
Comput. Complex.
Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski
1994 A* conf
On Learning Arithmetic Read-Once Formulas with Exponentiation (Extended Abstract).
COLT
Daoud Bshouty, Nader H. Bshouty
1994 A* conf
On Learning Discretized Geometric Concepts (Extended Abstract)
FOCS
Nader H. Bshouty, Zhixiang Chen, Steven Homer
1994 J jnl
On the Complexity of Bilinear Forms over Associative Algebras.
SIAM J. Comput.
Nader H. Bshouty
1994 A* conf
Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract).
COLT
Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon
1993 A* conf
Asking Questions to Minimize Errors.
COLT
Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar
1993 A* conf
Exact Learning via the Monotone Theory (Extended Abstract)
FOCS
Nader H. Bshouty
1993 J jnl
On the Complexity of Functions for Random Access Machines.
J. ACM
Nader H. Bshouty
1993 A conf
On the Direct Sum Conjecture in the Straight Line Model.
ESA
Nader H. Bshouty
1992 J jnl
A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields.
J. Algorithms
Amir Averbuch, Nader H. Bshouty, Michael Kaminski
1992 J jnl
A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial.
Inf. Process. Lett.
Nader H. Bshouty
1992 C conf
Compression of Dictionaries via Extensions to Front Coding.
ICCI
Nader H. Bshouty, Geoffrey T. Falk
1992 J jnl
Fast Exponentiation Using the Truncation Operation.
Comput. Complex.
Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari
1992 A* conf
Learning Arithmetic Read-Once Formulas
STOC
Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
1992 A* conf
Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates.
COLT
Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
1992 — conf
Lower Bounds for the Complexity of Functions in a Realistic RAM Model.
ISTCS
Nader H. Bshouty
1992 A* conf
On the Exact Learning of Formulas in Parallel (Extended Abstract)
FOCS
Nader H. Bshouty, Richard Cleve
1991 C conf
Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains.
ICCI
Nader H. Bshouty
1991 A* conf
Size-Depth Tradeoffs for Algebraic Formulae
FOCS
Nader H. Bshouty, Richard Cleve, Wayne Eberly
1990 J jnl
Generalizations of the Normal Basis Theorem of Finite Fields.
SIAM J. Discret. Math.
Nader H. Bshouty, Gadiel Seroussi
1990 J jnl
Maximal Rank of m x n x (mn - k) Tensors.
SIAM J. Comput.
Nader H. Bshouty
1990 J jnl
Multiplication of Polynomials over Finite Fields.
SIAM J. Comput.
Nader H. Bshouty, Michael Kaminski
1989 J jnl
A Lower Bound for Matrix Multiplication.
SIAM J. Comput.
Nader H. Bshouty
1989 J jnl
Multiplicative complexity of polynomial multiplication over finite fields.
J. ACM
Michael Kaminski, Nader H. Bshouty
1989 A* conf
On the Extended Direct Sum Conjecture
STOC
Nader H. Bshouty
1988 A* conf
A Lower Bound for Matrix Multiplication
FOCS
Nader H. Bshouty
1988 J jnl
Addition Requirements for Matrix and Transposed Matrix Products.
J. Algorithms
Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty
1988 J jnl
Vector sets for exhaustive testing of logic circuits.
IEEE Trans. Inf. Theory
Gadiel Seroussi, Nader H. Bshouty
1987 A* conf
Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract)
FOCS
Michael Kaminski, Nader H. Bshouty