N. Bshouty

发表

A Tight Bound for Approximating the Square Root

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

Simple Learning Algorithms for Decision Trees and Multivariate Polynomials

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

Learning monotone dnf from a teacher that almost does not answer membership queries

N. Bshouty, Nadav Eiron, 2003 .

Proceedings of the 20th annual conference on Learning theory

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

Exact learning via the Monotone theory

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

Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering

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

COLT Models

N. Bshouty, 2004 .

On properties that are non-trivial to test

N. Bshouty, Oded Goldreich, 2022, Electron. Colloquium Comput. Complex..

A Booster for the PAExact model

N. Bshouty, 2003 .

10-11-2003 Learning DNF From Random Walks

Elchanan Mossel, N. Bshouty, 2017 .

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..

Simple Learning Algorithms Using Divide and Conquer

N. Bshouty, 1995, COLT.

J an 2 01 9 Almost Optimal Distribution-free Junta Testing

N. Bshouty, 2019 .

INTERPOLATING ARITHMETIC READ-ONCE FORMULAS

R. Cleve, N. Bshouty, 1998 .

PAC learning with nasty noise

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

Classification of some minimal quadratic algorithms for computing the coefficients of the product of two polynomials over finite field

A. Averbuch, N. Bshouty, M. Kaminski, 2007 .

Non-Adaptive Proper Learning Polynomials

N. Bshouty, 2022, Electron. Colloquium Comput. Complex..

Read-Once Threshold Formulas , JustifyingAssignments , and Generic Transformations ( Revised Version )

M. Karpinski, N. Bshouty, Sheridan RoadEvanston, 2007 .

A Space-bounded Learning of Classes with Vc-dim = 1 Proof: Combine Theorem 3 with Corollary 2. 5 Extensions

S. Goldman, S. Suri, N. Bshouty, 1997 .

On One-Sided Testing Affine Subspaces

N. Bshouty, 2022, Electron. Colloquium Comput. Complex..

On Learning Branching Programs and Small Depth Circuits

Christino Tamon, Nader H. Bshouty, Francesco Bergadano, 1996, Electron. Colloquium Comput. Complex..

Multiplicative complexity of direct sums of quadratic systems

N. Bshouty, 1995 .

On the Fourier spectrum of monotone functions

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

Uniform-distribution attribute noise learnability

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

Learning Boolean Read-Once Formulas over Generalized Bases

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

Asking questions to minimize errors

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

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

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

Learning functions represented as multiplicity automata

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

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

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

A new composition theorem for learning algorithms

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

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 an Honest Teacher That Answers Membership Queries pdf

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

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

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

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 Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries

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

Learning Regular Sets with an Incomplete Membership Oracle

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

Exact Learning Composed Classes with a Small Number of Mistakes

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

On Using Extended Statistical Queries to Avoid Membership Queries

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

Learning DNF over the uniform distribution using a quantum example oracle

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

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

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

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.

PAC learning with nasty noise

Eyal Kushilevitz, Nader H. Bshouty, Nadav Eiron, 1999, 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.

Simple learning algorithms using divide and conquer

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

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

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

Noise-tolerant distribution-free learning of general geometric concepts

S. Goldman, H. Tamaki, S. Suri, 1998, JACM.

Noise-tolerant distribution-free learning of general geometric concepts

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

Noise-tolerant parallel learning of geometric concepts

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

On Learning Graphs with Edge-Detecting Queries

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

On the Additive Complexity of 2 x 2 Matrix Multiplication

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

Dense Testers: Almost Linear Time and Locally Explicit Constructions pdf

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

Testers and their applications

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

Using the doubling dimension to analyze the generalization of learning algorithms

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

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

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

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

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

Multiplication of Polynomials over Finite Fields

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

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).

Linear classifiers are nearly optimal when hidden variables have diverse effects

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

Algorithms for the Coin Weighing Problems with the Presence of Noise

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

Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives

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

On Learning and Testing Decision Tree pdf

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

Learning arithmetic read-once formulas

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

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

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

Learning Disjunctions of Predicates pdf

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

Superpolynomial Lower Bounds for Learning Monotone Classes

N. Bshouty, 2023, Electron. Colloquium Comput. Complex..

On the Proper Learning of Axis-Parallel Concepts

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

On the extended direct sum conjecture

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

On Exact Learning Monotone DNF from Membership Queries

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

On Learning width Two Branching Programs

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

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

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

On Learning Decision Trees with Large Output Domains

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

On the complexity of functions for random access machines

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

Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains

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

LOWER BOUNDS FOR THE COMPLEXITY OF FUNCTIONS IN RANDOM ACCESS MACHINES

N. Bshouty, 2014 .

Enumerating all the Irreducible Polynomials over Finite Field pdf

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

Exact Learning of Juntas from Membership Queries pdf

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

Vector sets for exhaustive testing of logic circuits

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

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

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

On Interpolating Arithmetic Read-Once Formulas with Exponentiation

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

Optimal Algorithms for the Coin Weighing Problem with a Spring Scale

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

Addition Requirements for Matrix and Transposed Matrix Products

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

Almost Optimal Cover-Free Families pdf

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

Linear Time Constructions of Some d -Restriction Problems pdf

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

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

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

Exact Learning via the Monotone Theory (Extended Abstract)

Nader H. Bshouty, N. Bshouty, 1993, FOCS.