| 2026 | MFCS | Sublinear Time Algorithms for Abelian Group Property Testing. | Nader H. Bshouty |
| 2026 | SOFSEM | Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction. | Nader H. Bshouty |
| 2025 | CIAC | On Exact Learning of d-Monotone Functions. | Nader H. Bshouty |
| 2023 | CIAC | On One-Sided Testing Affine Subspaces. | Nader H. Bshouty |
| 2023 | COCOA | Improved Lower Bound for Estimating the Number of Defective Items. | Nader H. Bshouty |
| 2023 | COCOON | On Detecting Some Defective Items in Group Testing. | Nader H. Bshouty, Catherine A. Haddad-Zaknoon |
| 2023 | MFCS | On Property Testing of the Binary Rank. | Nader H. Bshouty |
| 2023 | STACS | Non-Adaptive Proper Learning Polynomials. | Nader H. Bshouty |
| 2022 | LATIN | Almost Optimal Proper Learning and Testing Polynomials. | Nader H. Bshouty |
| 2022 | STACS | On Testing Decision Tree. | Nader H. Bshouty, Catherine A. Haddad-Zaknoon |
| 2022 | WALCOM | An Optimal Tester for k-Linear. | Nader H. Bshouty |
| 2020 | COCOA | Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives. | Nader H. Bshouty, Catherine A. Haddad-Zaknoon |
| 2020 | SOFSEM | Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing. | Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon |
| 2019 | ALT | On Learning Graphs with Edge-Detecting Queries. | Hasan Abasi, Nader H. Bshouty |
| 2019 | ALT | Adaptive Exact Learning of Decision Trees from Membership Queries. | Nader H. Bshouty, Catherine A. Haddad-Zaknoon |
| 2019 | ISAAC | Lower Bound for Non-Adaptive Estimation of the Number of Defective Items. | Nader H. Bshouty |
| 2018 | ALT | Adaptive Group Testing Algorithms to Estimate the Number of Defectives. | Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad, Thomas Hashem, Fadi Khoury, Omar Sharafy |
| 2018 | ISAAC | On Polynomial Time Constructions of Minimum Height Decision Tree. | Nader H. Bshouty, Waseem Makhoul |
| 2017 | ALT | Non-Adaptive Randomized Algorithm for Group Testing. | Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla |
| 2017 | CIAC | Almost Optimal Cover-Free Families. | Nader H. Bshouty, Ariel Gabizon |
| 2017 | COLT | Learning Disjunctions of Predicates. | Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav |
| 2016 | ALT | Exact Learning of Juntas from Membership Queries. | Nader H. Bshouty, Areej Costa |
| 2016 | ALT | The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers. | Nader H. Bshouty, Catherine A. Haddad-Zaknoon |
| 2015 | ALT | Non-adaptive Learning of a Hidden Hypergraph. | Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi |
| 2015 | CIAC | Linear Time Constructions of Some d -Restriction Problems. | Nader H. Bshouty |
| 2014 | ALT | Learning Boolean Halfspaces with Small Weights from Membership Queries. | Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty |
| 2014 | ALT | On Exact Learning Monotone DNF from Membership Queries. | Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi |
| 2014 | MFCS | On r-Simple k-Path. | Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty |
| 2013 | ALT | Exact Learning from Membership Queries: Some Techniques, Results and New Directions. | Nader H. Bshouty |
| 2012 | ALT | Editors' Introduction. | Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann |
| 2011 | SODA | On Parity Check (0, 1)-Matrix over Z | Nader H. Bshouty, Hanna Mazzawi |
| 2010 | ICML | Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering. | Nader H. Bshouty, Philip M. Long |
| 2010 | MFCS | Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity. | Nader H. Bshouty, Hanna Mazzawi |
| 2010 | STACS | Optimal Query Complexity for Reconstructing Hypergraphs. | Nader H. Bshouty, Hanna Mazzawi |
| 2009 | ALT | Reconstructing Weighted Graphs with Minimal Query Complexity. | Nader H. Bshouty, Hanna Mazzawi |
| 2009 | COLT | Optimal Algorithms for the Coin Weighing Problem with a Spring Scale. | Nader H. Bshouty |
| 2009 | COLT | Linear Classifiers are Nearly Optimal When Hidden Variables Have Diverse Effect. | Nader H. Bshouty, Philip M. Long |
| 2006 | ALT | On Exact Learning from Random Walk. | Nader H. Bshouty, Iddo Bentov |
| 2006 | ALT | On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle. | Nader H. Bshouty, Ehab Wattad |
| 2006 | COLT | On Optimal Learning Algorithms for Multiplicity Automata. | Laurence Bisht, Nader H. Bshouty, Hanna Mazzawi |
| 2006 | COLT | Exact Learning Composed Classes with a Small Number of Mistakes. | Nader H. Bshouty, Hanna Mazzawi |
| 2005 | ALT | Learning Attribute-Efficiently with Corrupt Oracles. | Rotem Bennet, Nader H. Bshouty |
| 2004 | COLT | Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability. | Nader H. Bshouty |
| 2004 | FOCS | Learning with Errors in Answers to Membership Queries. | Laurence Bisht, Nader H. Bshouty, Lawrance Khoury |
| 2003 | FOCS | Learning DNF from Random Walks. | Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio |
| 2002 | ALT | Maximizing Agreements and CoAgnostic Learning. | Nader H. Bshouty, Lynn Burroughs |
| 2002 | COLT | Bounds for the Minimum Disagreement Problem with Applications to Learning Theory. | Nader H. Bshouty, Lynn Burroughs |
| 2002 | COLT | On the Proper Learning of Axis Parallel Concepts. | Nader H. Bshouty, Lynn Burroughs |
| 2002 | COLT | Exploring Learnability between Exact and PAC. | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
| 2002 | FOCS | PAC = PAExact and Other Equivalent Models in Learning. | Nader H. Bshouty, Dmitry Gavinsky |
| 2001 | COLT | Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries. | Nader H. Bshouty, Nadav Eiron |
| 2001 | COLT | On Using Extended Statistical Queries to Avoid Membership Queries. | Nader H. Bshouty, Vitaly Feldman |
| 2001 | COLT | On Boosting with Optimal Poly-Bounded Distributions. | Nader H. Bshouty, Dmitry Gavinsky |
| 2001 | COLT | Learning Regular Sets with an Incomplete Membership Oracle. | Nader H. Bshouty, Avi Owshanko |
| 1999 | ALT | PAC Learning with Nasty Noise. | Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz |
| 1999 | COLT | Learning Threshold Functions with Small Weights Using Membership Queries. | Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar Radwan, Fathi Saleh |
| 1999 | COLT | Uniform-Distribution Attribute Noise Learnability. | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
| 1999 | COLT | More Efficient PAC-Learning of DNF with Membership Queries Under the Uniform Distribution. | Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon |
| 1999 | COLT | On Learning in the Presence of Unspecified Attribute Values. | Nader H. Bshouty, David K. Wilson |
| 1998 | STOC | A New Composition Theorem for Learning Algorithms. | Nader H. Bshouty |
| 1998 | STACS | Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem. | Nader H. Bshouty, Lynn Burroughs |
| 1997 | STOC | A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. | Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz |
| 1996 | COLT | Attribute-Efficient Learning in Query and Mistake-Bound Models. | Nader H. Bshouty, Lisa Hellerstein |
| 1996 | COLT | On Learning width Two Branching Programs (Extended Abstract). | Nader H. Bshouty, Christino Tamon, David K. Wilson |
| 1996 | FOCS | On the Applications of Multiplicity Automata in Learning. | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
| 1996 | STOC | Towards the Learnability of DNF Formulae. | Nader H. Bshouty |
| 1996 | STOC | Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. | Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki |
| 1995 | COLT | A Note on Learning Multivariate Polynomials Under the Uniform Distribution (Extended Abstract). | Nader H. Bshouty |
| 1995 | COLT | Simple Learning Algorithms Using Divide and Conquer. | Nader H. Bshouty |
| 1995 | COLT | On the Learnability of | Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer |
| 1995 | COLT | Noise-Tolerant Parallel Learning of Geometric Concepts. | Nader H. Bshouty, Sally A. Goldman, H. David Mathias |
| 1995 | COLT | Learning DNF over the Uniform Distribution using a Quantum Example Oracle. | Nader H. Bshouty, Jeffrey C. Jackson |
| 1995 | COLT | On Learning Decision Trees with Large Output Domains (Extended Abstract). | Nader H. Bshouty, Christino Tamon, David K. Wilson |
| 1995 | FOCS | Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. | Nader H. Bshouty, Yishay Mansour |
| 1995 | STOC | On the Fourier spectrum of monotone functions (Extended Abstract). | Nader H. Bshouty, Christino Tamon |
| 1994 | COLT | On Learning Arithmetic Read-Once Formulas with Exponentiation (Extended Abstract). | Daoud Bshouty, Nader H. Bshouty |
| 1994 | COLT | Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). | Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon |
| 1994 | FOCS | On Learning Discretized Geometric Concepts (Extended Abstract) | Nader H. Bshouty, Zhixiang Chen, Steven Homer |
| 1993 | COLT | Asking Questions to Minimize Errors. | Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar |
| 1993 | ESA | On the Direct Sum Conjecture in the Straight Line Model. | Nader H. Bshouty |
| 1993 | FOCS | Exact Learning via the Monotone Theory (Extended Abstract) | Nader H. Bshouty |
| 1992 | COLT | Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein |
| 1992 | FOCS | On the Exact Learning of Formulas in Parallel (Extended Abstract) | Nader H. Bshouty, Richard Cleve |
| 1992 | ICCI | Compression of Dictionaries via Extensions to Front Coding. | Nader H. Bshouty, Geoffrey T. Falk |
| 1992 | STOC | Learning Arithmetic Read-Once Formulas | Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein |
| 1991 | FOCS | Size-Depth Tradeoffs for Algebraic Formulae | Nader H. Bshouty, Richard Cleve, Wayne Eberly |
| 1991 | ICCI | Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains. | Nader H. Bshouty |
| 1989 | STOC | On the Extended Direct Sum Conjecture | Nader H. Bshouty |
| 1988 | FOCS | A Lower Bound for Matrix Multiplication | Nader H. Bshouty |
| 1987 | FOCS | Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) | Michael Kaminski, Nader H. Bshouty |