Nader H. Bshouty

发表

Simple learning algorithms using divide and conquer

Nader H. Bshouty, N. Bshouty, 1995, COLT '95.

Maximizing Agreements and CoAgnostic Learning

Nader H. Bshouty, Lynn Burroughs, 2002, ALT.

Elementary Proofs of Some Stirling Bounds pdf

Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad, 2018, ArXiv.

Learning DNF over the uniform distribution using a quantum example oracle

Nader H. Bshouty, Jeffrey C. Jackson, J. C. Jackson, 1995, COLT '95.

Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity

Nader H. Bshouty, Hanna Mazzawi, 2010, MFCS.

Simple learning algorithms using divide and conquer

Nader H. Bshouty, 1995, COLT '95.

Towards the learnability of DNF formulae

Nader H. Bshouty, 1996, STOC '96.

An algorithm to learn read-once threshold formulas, and transformations between learning models

Marek Karpinski, Lisa Hellerstein, Nader H. Bshouty, 2005, computational complexity.

Learning attribute-efficiently with corrupt oracles

Nader H. Bshouty, Rotem Bennet, 2007, Theor. Comput. Sci..

Exact Learning Composed Classes with a Small Number of Mistakes

Nader H. Bshouty, Hanna Mazzawi, N. Bshouty, 2006, COLT.

EUCLIDEAN GCD ALGORITHM IS NOT OPTIMAL

Nader H. Bshouty, 1989 .

A classification of quadratic algorithms for multiplying polynomials of small degree over finite fields

Amir Averbuch, Nader H. Bshouty, Michael Kaminski, 1992 .

On Using Extended Statistical Queries to Avoid Membership Queries

Vitaly Feldman, Nader H. Bshouty, V. Feldman, 2001, J. Mach. Learn. Res..

Exploring Learnability between Exact and PAC

Nader H. Bshouty, Christino Tamon, Jeffrey C. Jackson, 2002, COLT.

On Learning width Two Branching Programs

Nader H. Bshouty, Christino Tamon, David K. Wilson, 1998, Inf. Process. Lett..

Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings

Claudio Gentile, Nader H. Bshouty, 2007, COLT.

A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries

Nader H. Bshouty, 1996, Inf. Process. Lett..

Uniform-distribution attribute noise learnability

Nader H. Bshouty, Christino Tamon, Jeffrey C. Jackson, 2003, Inf. Comput..

Asking questions to minimize errors

Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, 1993, COLT '93.

Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability

Nader H. Bshouty, 2004, COLT.

Exact Learning of Juntas from Membership Queries pdf

Nader H. Bshouty, Areej Costa, N. Bshouty, 2017, ALT.

Polynomial multiplication over finite fields: from quadratic to straight-line complexity

Nader H. Bshouty, Michael Kaminski, 2006, computational complexity.

Exact learning via the Monotone theory

Nader H. Bshouty, N. Bshouty, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract)

Nader H. Bshouty, Michael Kaminski, 1987, FOCS.

Testers

Nader H. Bshouty, 2012, ACCA.

A Tight Bound for Approximating the Square Root

Baruch Schieber, Yishay Mansour, Nader H. Bshouty, 1997, Inf. Process. Lett..

A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields

Amir Averbuch, Nader H. Bshouty, Michael Kaminski, 1992, J. Algorithms.

On Optimal Learning Algorithms for Multiplicity Automata

Nader H. Bshouty, Hanna Mazzawi, Laurence Bisht, 2006, COLT.

Enumerating all the Irreducible Polynomials over Finite Field pdf

Nader H. Bshouty, Nuha Diab, Shada R. Kawar, 2016, ArXiv.

Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing pdf

Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon, 2020, SOFSEM.

More efficient PAC-learning of DNF with membership queries under the uniform distribution

Nader H. Bshouty, Christino Tamon, Jeffrey C. Jackson, 2004, J. Comput. Syst. Sci..

Bounds for the Minimum Disagreement Problem with Applications to Learning Theory

Nader H. Bshouty, Lynn Burroughs, 2002, COLT.

Non-Adaptive Learning a Hidden Hipergraph pdf

Nader H. Bshouty, Hanna Mazzawi, Hasan Abasi, 2015, ArXiv.

Simple Learning Algorithms for Decision Trees and Multivariate Polynomials

Yishay Mansour, Nader H. Bshouty, Y. Mansour, 2002, SIAM J. Comput..

Generalizations of the Normal Basis Theorem of Finite Fields

Gadiel Seroussi, Nader H. Bshouty, 1990, SIAM J. Discret. Math..

On Boosting with Optimal Poly-Bounded Distributions

Dmitry Gavinsky, Nader H. Bshouty, 2001, COLT/EuroCOLT.

A Simple Algorithm for Hamiltonicity pdf

Nader H. Bshouty, Hasan Abasi, 2014, ArXiv.

Almost optimal distribution-free junta testing

Nader H. Bshouty, 2019, Computational Complexity Conference.

Uniform-distribution attribute noise learnability

Nader H. Bshouty, Christino Tamon, Jeffrey C. Jackson, 1999, COLT '99.

Using the doubling dimension to analyze the generalization of learning algorithms

Yi Li, Philip M. Long, Nader H. Bshouty, 2009, J. Comput. Syst. Sci..

Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning

Nader H. Bshouty, Lynn Burroughs, 2005, Machine Learning.

Addition Requirements for Matrix and Transposed Matrix Products

David G. Kirkpatrick, Nader H. Bshouty, Michael Kaminski, 1988, J. Algorithms.

Adaptive Exact Learning of Decision Trees from Membership Queries

Nader H. Bshouty, Catherine A. Haddad-Zaknoon, 2019, ALT.

On the Direct Sum Conjecture in the Straight Line Model

Nader H. Bshouty, 1993, ESA.

Dense Testers: Almost Linear Time and Locally Explicit Constructions pdf

Nader H. Bshouty, N. Bshouty, 2014, Electron. Colloquium Comput. Complex..

On Learning Graphs with Edge-Detecting Queries

Nader H. Bshouty, Hasan Abasi, N. Bshouty, 2018, ALT.

Interpolating Arithmetic Read-Once Formulas in Parallel

Nader H. Bshouty, Richard Cleve, 1998, SIAM J. Comput..

Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains

Nader H. Bshouty, N. Bshouty, 1991, ICCI.

Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries

Nader H. Bshouty, Nadav Eiron, N. Bshouty, 2001, J. Mach. Learn. Res..

On the complexity of functions for random access machines

Nader H. Bshouty, N. Bshouty, 1993, JACM.

Multiplicative complexity of polynomial multiplication over finite fields

Nader H. Bshouty, Michael Kaminski, N. Bshouty, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

On learning decision trees with large output domains (extended abstract)

Nader H. Bshouty, Christino Tamon, David K. Wilson, 1995, COLT '95.

More efficient PAC-learning of DNF with membership queries under the uniform distribution

Nader H. Bshouty, Christino Tamon, Jeffrey C. Jackson, 1999, COLT '99.

Maximizing agreements and coagnostic learning

Nader H. Bshouty, Lynn Burroughs, 2006, Theor. Comput. Sci..

Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem

Nader H. Bshouty, Lynn Burroughs, N. Bshouty, 1998, STACS.

On the Fourier spectrum of monotone functions

Nader H. Bshouty, Christino Tamon, N. Bshouty, 1996, JACM.

Learning Matrix Functions over Rings

Nader H. Bshouty, Christino Tamon, David K. Wilson, 1997, EuroCOLT.

PAC learning with nasty noise

Eyal Kushilevitz, Nader H. Bshouty, Nadav Eiron, 1999, Theor. Comput. Sci..

Learning DNF over the Uniform Distribution Using a Quantum Example Oracle

Nader H. Bshouty, Jeffrey C. Jackson, 1999, SIAM J. Comput..

Lower Bound for Non-Adaptive Estimation of the Number of Defective Items

Nader H. Bshouty, 2019, ISAAC.

A composition theorem for learning algorithms with applications to geometric concept classes

Shai Ben-David, Eyal Kushilevitz, Nader H. Bshouty, 1997, STOC '97.

Exact Learning from Membership Queries: Some Techniques, Results and New Directions

Nader H. Bshouty, N. Bshouty, 2013, ALT.

Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives pdf

Nader H. Bshouty, Catherine A. Haddad-Zaknoon, Raghd Boulos, 2020, SWAT.

Noise-tolerant distribution-free learning of general geometric concepts

Subhash Suri, Hisao Tamaki, Nader H. Bshouty, 1996, STOC '96.

Learning Regular Sets with an Incomplete Membership Oracle

Nader H. Bshouty, Avi Owshanko, N. Bshouty, 2001, COLT/EuroCOLT.

Derandomizing Chernoff Bound with Union Bound with an Application to k-wise Independent Sets

Nader H. Bshouty, 2016, Electron. Colloquium Comput. Complex..

Toward a deterministic polynomial time algorithm with optimal additive query complexity

Nader H. Bshouty, Hanna Mazzawi, 2012, Theor. Comput. Sci..

Attribute-Efficient Learning in Query and Mistake-Bound Models

Lisa Hellerstein, Nader H. Bshouty, 1998, J. Comput. Syst. Sci..

Proceedings of the 20th annual conference on Learning theory

Claudio Gentile, Nader H. Bshouty, C. Gentile, 2007 .

Lower Bounds for Cover-Free Families pdf

Nader H. Bshouty, Ali Z. Abdi, 2016, Electron. J. Comb..

Learning Boolean Read-Once Formulas over Generalized Bases

Lisa Hellerstein, Nader H. Bshouty, Thomas R. Hancock, 1995, J. Comput. Syst. Sci..

On parity check (0, 1)-matrix over Zp

Nader H. Bshouty, Hanna Mazzawi, N. Bshouty, 2011, SODA '11.

Exact Learning from an Honest Teacher That Answers Membership Queries pdf

Nader H. Bshouty, N. Bshouty, 2017, Theor. Comput. Sci..

On r-Simple k-Path

Nader H. Bshouty, Ariel Gabizon, Elad Haramaty, 2014, MFCS.

An Optimal Tester for $k$-Linear

Nader H. Bshouty, 2020, Electron. Colloquium Comput. Complex..

Linear classifiers are nearly optimal when hidden variables have diverse effects

Philip M. Long, Nader H. Bshouty, N. Bshouty, 2012, Machine Learning.

Learning Automata

Eyal Kushilevitz, Amos Beimel, Nader H. Bshouty, 2008, Encyclopedia of Algorithms.

Non-adaptive learning of a hidden hypergraph

Nader H. Bshouty, Hanna Mazzawi, Hasan Abasi, 2018, Theor. Comput. Sci..

Asking Questions to Minimize Errors

Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, 1996, J. Comput. Syst. Sci..

Compression of dictionaries via extensions to front coding

Nader H. Bshouty, Geoffrey T. Falk, 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.

Meeting Times of Random Walks on Graphs

Lisa Higham, Nader H. Bshouty, Jolanta Warpechowska-Gruca, 1999, Inf. Process. Lett..

Learning with errors in answers to membership queries

Nader H. Bshouty, Laurence Bisht, Lawrance Khoury, 2008, J. Comput. Syst. Sci..

Lower Bounds for the Complexity of Functions in a Realistic RAM Model

Nader H. Bshouty, 1999, J. Algorithms.

Learning Matrix Functions over Rings

Nader H. Bshouty, Christino Tamon, David K. Wilson, 1998, Algorithmica.

A Lower Bound for Matrix Multiplication

Nader H. Bshouty, 1989, SIAM J. Comput..

Learning Arithmetic Read-Once Formulas

Lisa Hellerstein, Nader H. Bshouty, Thomas R. Hancock, 1995, SIAM J. Comput..

Size-depth tradeoffs for algebraic formulae

Nader H. Bshouty, Richard Cleve, Wayne Eberly, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Learning Disjunctions of Predicates pdf

Eran Yahav, Nader H. Bshouty, Dana Drachsler-Cohen, 2017, COLT.

On Polynomial time Constructions of Minimum Height Decision Tree

Nader H. Bshouty, Waseem Makhoul, 2018, ISAAC.

On the Additive Complexity of 2 x 2 Matrix Multiplication

Nader H. Bshouty, N. Bshouty, 1995, Inf. Process. Lett..

On the extended direct sum conjecture

Nader H. Bshouty, N. Bshouty, 1989, STOC '89.

Reconstructing Weighted Graphs with Minimal Query Complexity

Nader H. Bshouty, Hanna Mazzawi, 2009, ALT.

Lower Bound for Non-Adaptive Estimate the Number of Defective Items

Nader H. Bshouty, 2018, Electron. Colloquium Comput. Complex..

Algorithms for the Coin Weighing Problems with the Presence of Noise

Nader H. Bshouty, Hanna Mazzawi, N. Bshouty, 2011, Electron. Colloquium Comput. Complex..

A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial

Nader H. Bshouty, 1992, Inf. Process. Lett..

Linear Time Constructions of Some d -Restriction Problems pdf

Nader H. Bshouty, N. Bshouty, 2014, CIAC.

On using extended statistical queries to avoid membership queries

Vitaly Feldman, Nader H. Bshouty, 2002 .

PAC learning with nasty noise

Eyal Kushilevitz, Nader H. Bshouty, Nadav Eiron, 1999, Theoretical Computer Science.

Multilinear Complexity is Equivalent to Optimal Tester Size

Nader H. Bshouty, 2013, Electron. Colloquium Comput. Complex..

On Learning Decision Trees with Large Output Domains

Nader H. Bshouty, Christino Tamon, David K. Wilson, 1998, Algorithmica.

A note on learning multivariate polynomials under the uniform distribution (extended abstract)

Nader H. Bshouty, 1995, COLT '95.

Guest Editors' foreword

Thomas Zeugmann, Nader H. Bshouty, Gilles Stoltz, 2014, Theor. Comput. Sci..

EUCLID'S GCD ALGORITHM IS NOT OPTIMAL PART I. UPPER BOUND

Nader H. Bshouty, 1991 .

Fast exponentiation using the truncation operation

Baruch Schieber, Yishay Mansour, Nader H. Bshouty, 2005, computational complexity.

On the Coin Weighing Problem with the Presence of Noise

Nader H. Bshouty, 2012, APPROX-RANDOM.

Exploring learnability between exact and PAC

Nader H. Bshouty, Christino Tamon, Jeffrey C. Jackson, 2005, J. Comput. Syst. Sci..

PAC=PAExact and other equivalent models in learning

Dmitry Gavinsky, Nader H. Bshouty, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

Exact learning of juntas from membership queries

Nader H. Bshouty, Areej Costa, 2018, Theor. Comput. Sci..

Attribute Efficient PAC Learning of DNF with Membership Queries under the Uniform Distribution

Nader H. Bshouty, Christino Tamon, Jeffrey C. Jackson, 1998, Electron. Colloquium Comput. Complex..

A new composition theorem for learning algorithms

Nader H. Bshouty, N. Bshouty, 1998, STOC '98.

On the Fourier spectrum of monotone functions

Nader H. Bshouty, Christino Tamon, 1995, STOC '95.

On learning arithmetic read-once formulas with exponentiation (extended abstract)

Nader H. Bshouty, Daoud Bshouty, 1994, COLT '94.

Learning threshold functions with small weights using membership queries

Nader H. Bshouty, Fathi Saleh, Elias Abboud, 1999, COLT '99.

Noise-tolerant parallel learning of geometric concepts

Nader H. Bshouty, Sally A. Goldman, H. David Mathias, 1995, COLT '95.

Learning with errors in answers to membership queries

Nader H. Bshouty, Laurence Bisht, Lawrance Khoury, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Learning arithmetic read-once formulas

Lisa Hellerstein, Nader H. Bshouty, Thomas R. Hancock, 1992, STOC '92.

On learning in the presence of unspecified attribute values

Nader H. Bshouty, David K. Wilson, 1999, COLT '99.

On Exact Learning from Random Walk

Nader H. Bshouty, Iddo Bentov, 2006, ALT.

Lecture Note on LCSSX's Lower Bounds for Non-Adaptive Distribution-free Property Testing pdf

Nader H. Bshouty, 2020, ArXiv.

The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers pdf

Nader H. Bshouty, Catherine A. Haddad-Zaknoon, 2016, ALT.

Oracles and Queries That Are Sufficient for Exact Learning

Sampath Kannan, Ricard Gavaldà, Nader H. Bshouty, 1996, J. Comput. Syst. Sci..

On the Direct Sum Conjecture in the Straight Line Model

Nader H. Bshouty, 1998, J. Complex..

A Simple Algorithm for Undirected Hamiltonicity

Nader H. Bshouty, Hasan Abasi, 2013, Electron. Colloquium Comput. Complex..

On Learning Multivariate Polynomials Under the Uniform Distribution

Nader H. Bshouty, 1997, Inf. Process. Lett..

Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering

Philip M. Long, Nader H. Bshouty, N. Bshouty, 2010, ICML.

Multiplication of Polynomials over Finite Fields

Nader H. Bshouty, Michael Kaminski, N. Bshouty, 1990, SIAM J. Comput..

Size-Depth Tradeoffs for Algebraic Formulas

Nader H. Bshouty, Richard Cleve, Wayne Eberly, 1995, SIAM J. Comput..

Exact Learning of Formulas in Parallel

Nader H. Bshouty, 2004, Machine Learning.

Maximal Rank of m x n x (mn - k) Tensors

Nader H. Bshouty, N. Bshouty, 1990, SIAM J. Comput..

Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives

Nader H. Bshouty, Catherine A. Haddad-Zaknoon, N. Bshouty, 2020, COCOA.

Exact Learning via the Monotone Theory (Extended Abstract)

Nader H. Bshouty, 1993, FOCS 1993.

Almost Optimal Cover-Free Families pdf

Nader H. Bshouty, Ariel Gabizon, N. Bshouty, 2015, CIAC.

Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates

Lisa Hellerstein, Nader H. Bshouty, Thomas R. Hancock, 1992, COLT '92.

Simple learning algorithms for decision trees and multivariate polynomials

Yishay Mansour, Nader H. Bshouty, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle

Nader H. Bshouty, Ehab Wattad, 2006, ALT.

Optimal Algorithms for the Coin Weighing Problem with a Spring Scale

Nader H. Bshouty, N. Bshouty, 2009, COLT.

Learning Attribute-Efficiently with Corrupt Oracles

Nader H. Bshouty, Rotem Bennet, 2005, ALT.

Algorithmic learning theory : 23rd international conference, ALT 2012, Lyon, France, October 29-31, 2012 : proceedings

Nader H. Bshouty, 2012 .

Oracles and queries that are sufficient for exact learning (extended abstract)

Sampath Kannan, Nader H. Bshouty, Christino Tamon, 1994, COLT '94.

Vector sets for exhaustive testing of logic circuits

Gadiel Seroussi, Nader H. Bshouty, G. Seroussi, 1988, IEEE Trans. Inf. Theory.

On the Proper Learning of Axis-Parallel Concepts

Nader H. Bshouty, Lynn Burroughs, N. Bshouty, 2002, J. Mach. Learn. Res..

On the Complexity of Bilinear Forms over Associative Algebras

Nader H. Bshouty, 1994, SIAM J. Comput..

Attribute-efficient learning in query and mistake-bound models

Lisa Hellerstein, Nader H. Bshouty, 1996, COLT '96.

Exact Learning Boolean Function via the Monotone Theory

Nader H. Bshouty, 1995, Inf. Comput..

Reconstructing weighted graphs with minimal query complexity

Nader H. Bshouty, Hanna Mazzawi, 2011, Theor. Comput. Sci..

Non-Adaptive Randomized Algorithm for Group Testing

Nader H. Bshouty, Nuha Diab, Shada R. Kawar, 2017, ALT.

On Boosting with Polynomially Bounded Distributions

Dmitry Gavinsky, Nader H. Bshouty, 2002, J. Mach. Learn. Res..

Testers and their applications

Nader H. Bshouty, N. Bshouty, 2014, ITCS.

The monotone theory for the PAC-model

Nader H. Bshouty, 2003, Inf. Comput..

On the applications of multiplicity automata in learning

Eyal Kushilevitz, Amos Beimel, Nader H. Bshouty, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

Exact Learning of Discretized Geometric Concepts

Paul W. Goldberg, Nader H. Bshouty, Sally A. Goldman, 1998, SIAM J. Comput..

Learning functions represented as multiplicity automata

Eyal Kushilevitz, Amos Beimel, Nader H. Bshouty, 2000, JACM.

Optimal Query Complexity for Reconstructing Hypergraphs pdf

Nader H. Bshouty, Hanna Mazzawi, 2010, STACS.

Guest Editors’ Introduction: Special issue on Learning Theory (COLT-2007)

Claudio Gentile, Nader H. Bshouty, 2008, Machine Learning.

Learning boolean halfspaces with small weights from membership queries pdf

Nader H. Bshouty, Hasan Abasi, Ali Z. Abdi, 2016, Theor. Comput. Sci..

Learning Boolean Halfspaces with Small Weights from Membership Queries

Nader H. Bshouty, Hasan Abasi, Ali Z. Abdi, 2014, ALT.

Editors' Introduction

Thomas Zeugmann, Nader H. Bshouty, Gilles Stoltz, 2012, ALT.

Learning DNF from random walks

Ryan O'Donnell, Rocco A. Servedio, Elchanan Mossel, 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

Adaptive Group Testing Algorithms to Estimate the Number of Defectives

Nader H. Bshouty, Vivian E. Bshouty-Hurani, Thomas Hashem, 2018, ALT.

Learning Multivariate Polynomials from Substitution and Equivalence Queries

Nader H. Bshouty, Francesco Bergadano, Stefano Varricchio, 1996, Electron. Colloquium Comput. Complex..

A lower bound for matrix multiplication

Nader H. Bshouty, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

On Learning Programs and Small Depth Circuits

Nader H. Bshouty, Christino Tamon, Francesco Bergadano, 1997, EuroCOLT.

On learning width two branching programs (extended abstract)

Nader H. Bshouty, Christino Tamon, David K. Wilson, 1996, COLT '96.

On Interpolating Arithmetic Read-Once Formulas with Exponentiation

Nader H. Bshouty, Daoud Bshouty, N. Bshouty, 1998, J. Comput. Syst. Sci..

On Exact Learning Monotone DNF from Membership Queries

Nader H. Bshouty, Hanna Mazzawi, Hasan Abasi, 2014, ALT.

On the learnability of Zn-DNF formulas (extended abstract)

Zhixiang Chen, Nader H. Bshouty, Steven Homer, 1995, COLT '95.

Non-adaptive Learning of a Hidden Hypergraph

Nader H. Bshouty, Hanna Mazzawi, Hasan Abasi, 2015, ALT.

Almost Optimal Testers for Concise Representations pdf

Nader H. Bshouty, 2019, Electron. Colloquium Comput. Complex..

Lower Bounds for the Complexity of Functions in a Realistic RAM Model

Nader H. Bshouty, 1992, ISTCS.

Optimal deterministic group testing algorithms to estimate the number of defectives

Nader H. Bshouty, Catherine A. Haddad-Zaknoon, 2021, Theor. Comput. Sci..

On Learning and Testing Decision Tree pdf

Nader H. Bshouty, Catherine A. Haddad-Zaknoon, N. Bshouty, 2021, ArXiv.

On the proper learning of axis-parallel concepts

Nader H. Bshouty, Lynn Burroughs, 2003 .

Read-Once Threshold Formulas, Justifying Assignments, and Generic Transformations

Marek Karpinski, Lisa Hellerstein, Nader H. Bshouty, 1991 .

An Algorithm to Learn Read-Once Threshold Formulas, and some Generic Transformations between Learning Models

Marek Karpinski, Lisa Hellerstein, Nader H. Bshouty, 1993 .

On Learning in the Presence of Unspeci ed Attribute Values

Nader H. Bshouty, K. David, WilsonDepartment, 1999 .