Nader H. Bshouty

According to our database, Nader H. Bshouty authored at least 160 papers between 1987 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

An optimal tester for <i>k</i>-linear.

Nader H. Bshouty

Theor. Comput. Sci., March, 2023

A Tight Lower Bound of Ω(log n) for the Estimation of the Number of Defective Items.

Nader H. Bshouty, Gergely Harcos

Electron. Colloquium Comput. Complex., 2023

Superpolynomial Lower Bounds for Learning Monotone Classes.

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2023

A Note on Property Testing of the Binary Rank.

Nader H. Bshouty

CoRR, 2023

On Property Testing of the Binary Rank.

Nader H. Bshouty

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

On Detecting Some Defective Items in Group Testing.

Nader H. Bshouty, Catherine A. Haddad-Zaknoon

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Improved Lower Bound for Estimating the Number of Defective Items.

Nader H. Bshouty

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

On One-Sided Testing Affine Subspaces.

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2022

Non-Adaptive Proper Learning Polynomials.

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2022

On properties that are non-trivial to test.

Nader H. Bshouty, Oded Goldreich

Electron. Colloquium Comput. Complex., 2022

On Testing Decision Tree.

Nader H. Bshouty, Catherine A. Haddad-Zaknoon

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Almost Optimal Proper Learning and Testing Polynomials.

Nader H. Bshouty

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Optimal deterministic group testing algorithms to estimate the number of defectives.

Nader H. Bshouty, Catherine A. Haddad-Zaknoon

Theor. Comput. Sci., 2021

On Learning and Testing Decision Tree.

Nader H. Bshouty, Catherine A. Haddad-Zaknoon

CoRR, 2021

2020

An Optimal Tester for k-Linear.

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2020

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

Nader H. Bshouty

CoRR, 2020

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

Nader H. Bshouty, Catherine A. Haddad-Zaknoon, Raghd Boulos, Foad Moalem, Jalal Nada, Elias Noufi, Yara Zaknoon

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing.

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

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

Almost Optimal Testers for Concise Representations.

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2019

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

Nader H. Bshouty

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Almost Optimal Distribution-Free Junta Testing.

Nader H. Bshouty

Proceedings of the 34th Computational Complexity Conference, 2019

Adaptive Exact Learning of Decision Trees from Membership Queries.

Nader H. Bshouty, Catherine A. Haddad-Zaknoon

Proceedings of the Algorithmic Learning Theory, 2019

On Learning Graphs with Edge-Detecting Queries.

Hasan Abasi, Nader H. Bshouty

Proceedings of the Algorithmic Learning Theory, 2019

2018

Exact learning of juntas from membership queries.

Nader H. Bshouty, Areej Costa

Theor. Comput. Sci., 2018

Exact learning from an honest teacher that answers membership queries.

Nader H. Bshouty

Theor. Comput. Sci., 2018

Non-adaptive learning of a hidden hypergraph.

Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi

Theor. Comput. Sci., 2018

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

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2018

Elementary Proofs of Some Stirling Bounds.

Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad, Thomas Hashem, Fadi Khoury, Omar Sharafy

CoRR, 2018

On Polynomial Time Constructions of Minimum Height Decision Tree.

Nader H. Bshouty, Waseem Makhoul

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

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

Proceedings of the Algorithmic Learning Theory, 2018

2017

Learning Disjunctions of Predicates.

Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav

Proceedings of the 30th Conference on Learning Theory, 2017

Almost Optimal Cover-Free Families.

Nader H. Bshouty, Ariel Gabizon

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Non-Adaptive Randomized Algorithm for Group Testing.

Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016

Learning boolean halfspaces with small weights from membership queries.

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

Theor. Comput. Sci., 2016

Derandomizing Chernoff Bound with Union Bound with an Application to <i>k</i>-wise Independent Sets.

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2016

Enumerating all the Irreducible Polynomials over Finite Field.

Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla

CoRR, 2016

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

Nader H. Bshouty

CoRR, 2016

Lower Bounds for Cover-Free Families.

Ali Z. Abdi, Nader H. Bshouty

Electron. J. Comb., 2016

The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers.

Nader H. Bshouty, Catherine A. Haddad-Zaknoon

Proceedings of the Algorithmic Learning Theory - 27th International Conference, 2016

2015

On Parity Check (0, 1)-Matrix over ℤ_p.

Nader H. Bshouty, Hanna Mazzawi

SIAM J. Discret. Math., 2015

Dense Testers: Almost Linear Time and Locally Explicit Constructions.

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2015

Non-Adaptive Learning a Hidden Hipergraph.

Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi

CoRR, 2015

Linear Time Constructions of Some d -Restriction Problems.

Nader H. Bshouty

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Guest Editors' foreword.

Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann

Theor. Comput. Sci., 2014

On <i>r</i>-Simple <i>k</i>-Path.

Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty

Electron. Colloquium Comput. Complex., 2014

A Simple Algorithm for Hamiltonicity.

Hasan Abasi, Nader H. Bshouty

CoRR, 2014

On r-Simple k-Path.

Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On Exact Learning Monotone DNF from Membership Queries.

Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi

Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

2013

Multilinear Complexity is Equivalent to Optimal Tester Size.

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2013

A Simple Algorithm for Undirected Hamiltonicity.

Hasan Abasi, Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2013

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

Nader H. Bshouty

Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

2012

Toward a deterministic polynomial time algorithm with optimal additive query complexity.

Nader H. Bshouty, Hanna Mazzawi

Theor. Comput. Sci., 2012

Linear classifiers are nearly optimal when hidden variables have diverse effects.

Nader H. Bshouty, Philip M. Long

Mach. Learn., 2012

Testers and their Applications.

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 2012

Testers.

Nader H. Bshouty

ACM Commun. Comput. Algebra, 2012

On the Coin Weighing Problem with the Presence of Noise.

Nader H. Bshouty

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

Editors' Introduction.

Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011

Reconstructing weighted graphs with minimal query complexity.

Nader H. Bshouty, Hanna Mazzawi

Theor. Comput. Sci., 2011

Algorithms for the Coin Weighing Problems with the Presence of Noise.

Nader H. Bshouty, Hanna Mazzawi

Electron. Colloquium Comput. Complex., 2011

On Parity Check (0, 1)-Matrix over Z^p.

Nader H. Bshouty, Hanna Mazzawi

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Optimal Query Complexity for Reconstructing Hypergraphs.

Nader H. Bshouty, Hanna Mazzawi

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering.

Nader H. Bshouty, Philip M. Long

Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010

2009

Using the doubling dimension to analyze the generalization of learning algorithms.

Nader H. Bshouty, Yi Li, Philip M. Long

J. Comput. Syst. Sci., 2009

Linear Classifiers are Nearly Optimal When Hidden Variables Have Diverse Effect.

Nader H. Bshouty, Philip M. Long

Proceedings of the COLT 2009, 2009

Optimal Algorithms for the Coin Weighing Problem with a Spring Scale.

Nader H. Bshouty

Proceedings of the COLT 2009, 2009

2008

Learning Automata.

Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

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

Nader H. Bshouty, Claudio Gentile

Mach. Learn., 2008

Learning with errors in answers to membership queries.

Laurence Bisht, Nader H. Bshouty, Lawrance Khoury

J. Comput. Syst. Sci., 2008

2007

Learning attribute-efficiently with corrupt oracles.

Rotem Bennet, Nader H. Bshouty

Theor. Comput. Sci., 2007

2006

Maximizing agreements and coagnostic learning.

Nader H. Bshouty, Lynn Burroughs

Theor. Comput. Sci., 2006

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

Nader H. Bshouty, Michael Kaminski

Comput. Complex., 2006

Exact Learning Composed Classes with a Small Number of Mistakes.

Nader H. Bshouty, Hanna Mazzawi

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

On Optimal Learning Algorithms for Multiplicity Automata.

Laurence Bisht, Nader H. Bshouty, Hanna Mazzawi

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle.

Nader H. Bshouty, Ehab Wattad

Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

On Exact Learning from Random Walk.

Nader H. Bshouty, Iddo Bentov

Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005

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

Nader H. Bshouty, Lynn Burroughs

Mach. Learn., 2005

Learning DNF from random walks.

Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio

J. Comput. Syst. Sci., 2005

Exploring learnability between exact and PAC.

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

J. Comput. Syst. Sci., 2005

2004

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

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

J. Comput. Syst. Sci., 2004

Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability.

Nader H. Bshouty

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003

On the Proper Learning of Axis-Parallel Concepts.

Nader H. Bshouty, Lynn Burroughs

J. Mach. Learn. Res., 2003

Uniform-distribution attribute noise learnability.

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

Inf. Comput., 2003

2002

PAC learning with nasty noise.

Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz

Theor. Comput. Sci., 2002

Simple Learning Algorithms for Decision Trees and Multivariate Polynomials.

Nader H. Bshouty, Yishay Mansour

SIAM J. Comput., 2002

On Boosting with Polynomially Bounded Distributions.

Nader H. Bshouty, Dmitry Gavinsky

J. Mach. Learn. Res., 2002

On Using Extended Statistical Queries to Avoid Membership Queries.

Nader H. Bshouty, Vitaly Feldman

J. Mach. Learn. Res., 2002

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

Nader H. Bshouty, Nadav Eiron

J. Mach. Learn. Res., 2002

PAC = PAExact and Other Equivalent Models in Learning.

Nader H. Bshouty, Dmitry Gavinsky

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Bounds for the Minimum Disagreement Problem with Applications to Learning Theory.

Nader H. Bshouty, Lynn Burroughs

Proceedings of the Computational Learning Theory, 2002

2001

Learning Regular Sets with an Incomplete Membership Oracle.

Nader H. Bshouty, Avi Owshanko

Proceedings of the Computational Learning Theory, 2001

On Boosting with Optimal Poly-Bounded Distributions.

Nader H. Bshouty, Dmitry Gavinsky

Proceedings of the Computational Learning Theory, 2001

2000

Learning functions represented as multiplicity automata.

Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio

J. ACM, 2000

1999

Learning DNF over the Uniform Distribution Using a Quantum Example Oracle.

Nader H. Bshouty, Jeffrey C. Jackson

SIAM J. Comput., 1999

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

Nader H. Bshouty

J. Algorithms, 1999

Meeting Times of Random Walks on Graphs.

Nader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca

Inf. Process. Lett., 1999

On Learning in the Presence of Unspecified Attribute Values.

Nader H. Bshouty, David K. Wilson

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

Learning Threshold Functions with Small Weights Using Membership Queries.

Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar Radwan, Fathi Saleh

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998

Exact Learning of Discretized Geometric Concepts.

Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias

SIAM J. Comput., 1998

Interpolating Arithmetic Read-Once Formulas in Parallel.

Nader H. Bshouty, Richard Cleve

SIAM J. Comput., 1998

Attribute-Efficient Learning in Query and Mistake-Bound Models.

Nader H. Bshouty, Lisa Hellerstein

J. Comput. Syst. Sci., 1998

On Interpolating Arithmetic Read-Once Formulas with Exponentiation.

Daoud Bshouty, Nader H. Bshouty

J. Comput. Syst. Sci., 1998

On the Direct Sum Conjecture in the Straight Line Model.

Nader H. Bshouty

J. Complex., 1998

Noise-Tolerant Distribution-Free Learning of General Geometric Concepts.

Nader H. Bshouty, Sally A. Goldman, H. David Mathias, Subhash Suri, Hisao Tamaki

J. ACM, 1998

On Learning width Two Branching Programs.

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

Inf. Process. Lett., 1998

Noise-Tolerant Parallel Learning of Geometric Concepts.

Nader H. Bshouty, Sally A. Goldman, H. David Mathias

Inf. Comput., 1998

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

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

Electron. Colloquium Comput. Complex., 1998

A New Composition Theorem for Learning Algorithms

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 1998

Learning Matrix Functions over Rings.

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

Algorithmica, 1998

On Learning Decision Trees with Large Output Domains.

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

Algorithmica, 1998

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

Nader H. Bshouty, Lynn Burroughs

Proceedings of the STACS 98, 1998

1997

Exact Learning of Formulas in Parallel.

Nader H. Bshouty

Mach. Learn., 1997

A Tight Bound for Approximating the Square Root.

Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari

Inf. Process. Lett., 1997

On Learning Multivariate Polynomials Under the Uniform Distribution.

Nader H. Bshouty

Inf. Process. Lett., 1997

Simple Learning Algorithms Using Divide and Conquer.

Nader H. Bshouty

Comput. Complex., 1997

On Learning Programs and Small Depth Circuits.

Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio

Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996

Asking Questions to Minimize Errors.

Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar

J. Comput. Syst. Sci., 1996

Oracles and Queries That Are Sufficient for Exact Learning.

Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon

J. Comput. Syst. Sci., 1996

On the Fourier Spectrum of Monotone Functions.

Nader H. Bshouty, Christino Tamon

J. ACM, 1996

A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries.

Nader H. Bshouty

Inf. Process. Lett., 1996

A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes

Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz

Electron. Colloquium Comput. Complex., 1996

On Learning Branching Programs and Small Depth Circuits

Francesco Bergadano, Nader H. Bshouty, Christino Tamon, Stefano Varricchio

Electron. Colloquium Comput. Complex., 1996

Learning Multivariate Polynomials from Substitution and Equivalence Queries

Francesco Bergadano, Nader H. Bshouty, Stefano Varricchio

Electron. Colloquium Comput. Complex., 1996

Towards the Learnability of DNF Formulae.

Nader H. Bshouty

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

On the Applications of Multiplicity Automata in Learning.

Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

On Learning width Two Branching Programs (Extended Abstract).

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

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

1995

Learning Arithmetic Read-Once Formulas.

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein

SIAM J. Comput., 1995

Size-Depth Tradeoffs for Algebraic Formulas.

Nader H. Bshouty, Richard Cleve, Wayne Eberly

SIAM J. Comput., 1995

Learning Boolean Read-Once Formulas over Generalized Bases.

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein

J. Comput. Syst. Sci., 1995

On the Additive Complexity of 2 x 2 Matrix Multiplication.

Nader H. Bshouty

Inf. Process. Lett., 1995

Exact Learning Boolean Function via the Monotone Theory.

Nader H. Bshouty

Inf. Comput., 1995

The Monotone Theory for the PAC-Model

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 1995

Exact Learning Boolean Functions via the Monotone Theory

Nader H. Bshouty

Electron. Colloquium Comput. Complex., 1995

On the Fourier spectrum of monotone functions (Extended Abstract).

Nader H. Bshouty, Christino Tamon

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On Learning Decision Trees with Large Output Domains (Extended Abstract).

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

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

On the Learnability of <i>Z</i>_n-DNF Formulas (Extended Abstract).

Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

A Note on Learning Multivariate Polynomials Under the Uniform Distribution (Extended Abstract).

Nader H. Bshouty

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994

On the Complexity of Bilinear Forms over Associative Algebras.

Nader H. Bshouty

SIAM J. Comput., 1994

An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models.

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein, Marek Karpinski

Comput. Complex., 1994

On Learning Discretized Geometric Concepts (Extended Abstract)

Nader H. Bshouty, Zhixiang Chen, Steven Homer

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract).

Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

On Learning Arithmetic Read-Once Formulas with Exponentiation (Extended Abstract).

Daoud Bshouty, Nader H. Bshouty

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993

On the Complexity of Functions for Random Access Machines.

Nader H. Bshouty

J. ACM, 1993

Exact Learning via the Monotone Theory (Extended Abstract)

Nader H. Bshouty

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

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

Amir Averbuch, Nader H. Bshouty, Michael Kaminski

J. Algorithms, 1992

A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial.

Nader H. Bshouty

Inf. Process. Lett., 1992

Fast Exponentiation Using the Truncation Operation.

Nader H. Bshouty, Yishay Mansour, Baruch Schieber, Prasoon Tiwari

Comput. Complex., 1992

Compression of Dictionaries via Extensions to Front Coding.

Nader H. Bshouty, Geoffrey T. Falk

Proceedings of the Computing and Information, 1992

On the Exact Learning of Formulas in Parallel (Extended Abstract)

Nader H. Bshouty, Richard Cleve

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates.

Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains.

Nader H. Bshouty

Proceedings of the Advances in Computing and Information, 1991

Size-Depth Tradeoffs for Algebraic Formulae

Nader H. Bshouty, Richard Cleve, Wayne Eberly

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Generalizations of the Normal Basis Theorem of Finite Fields.

Nader H. Bshouty, Gadiel Seroussi

SIAM J. Discret. Math., 1990

Multiplication of Polynomials over Finite Fields.

Nader H. Bshouty, Michael Kaminski

SIAM J. Comput., 1990

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

Nader H. Bshouty

SIAM J. Comput., 1990

1989

A Lower Bound for Matrix Multiplication.

Nader H. Bshouty

SIAM J. Comput., 1989

Multiplicative complexity of polynomial multiplication over finite fields.

Michael Kaminski, Nader H. Bshouty

J. ACM, 1989

On the Extended Direct Sum Conjecture

Nader H. Bshouty

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988

Vector sets for exhaustive testing of logic circuits.

Gadiel Seroussi, Nader H. Bshouty

IEEE Trans. Inf. Theory, 1988

Addition Requirements for Matrix and Transposed Matrix Products.

Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty

J. Algorithms, 1988

1987

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

Michael Kaminski, Nader H. Bshouty

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987