Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract) - Michael Kaminski; Nader H. Bshouty (FOCS, 1987)

Addition Requirements for Matrix and Transposed Matrix Products. - Michael Kaminski; David G. Kirkpatrick; Nader H. Bshouty (J. Algorithms, 1988)

Vector sets for exhaustive testing of logic circuits. - Gadiel Seroussi; Nader H. Bshouty (IEEE Trans. Inf. Theory, 1988)

On the Extended Direct Sum Conjecture - Nader H. Bshouty (STOC, 1989)

Multiplicative complexity of polynomial multiplication over finite fields. - Michael Kaminski; Nader H. Bshouty (J. ACM, 1989)

A Lower Bound for Matrix Multiplication. - Nader H. Bshouty (SIAM J. Comput., 1989)

Maximal Rank of m x n x (mn - k) Tensors. - Nader H. Bshouty (SIAM J. Comput., 1990)

Multiplication of Polynomials over Finite Fields. - Nader H. Bshouty; Michael Kaminski (SIAM J. Comput., 1990)

Generalizations of the Normal Basis Theorem of Finite Fields. - Nader H. Bshouty; Gadiel Seroussi (SIAM J. Discret. Math., 1990)

Size-Depth Tradeoffs for Algebraic Formulae - Nader H. Bshouty; Richard Cleve; Wayne Eberly (FOCS, 1991)

Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains. - Nader H. Bshouty (ICCI, 1991)

Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates. - Nader H. Bshouty; Thomas R. Hancock; Lisa Hellerstein (COLT, 1992)

On the Exact Learning of Formulas in Parallel (Extended Abstract) - Nader H. Bshouty; Richard Cleve (FOCS, 1992)

Compression of Dictionaries via Extensions to Front Coding. - Nader H. Bshouty; Geoffrey T. Falk (ICCI, 1992)

Fast Exponentiation Using the Truncation Operation. - Nader H. Bshouty; Yishay Mansour; Baruch Schieber; Prasoon Tiwari (Comput. Complex., 1992)

A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial. - Nader H. Bshouty (Inf. Process. Lett., 1992)

A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields. - Amir Averbuch; Nader H. Bshouty; Michael Kaminski (J. Algorithms, 1992)

Exact Learning via the Monotone Theory (Extended Abstract) - Nader H. Bshouty (FOCS, 1993)

On the Complexity of Functions for Random Access Machines. - Nader H. Bshouty (J. ACM, 1993)

On Learning Arithmetic Read-Once Formulas with Exponentiation (Extended Abstract). - Daoud Bshouty; Nader H. Bshouty (COLT, 1994)

Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). - Nader H. Bshouty; Richard Cleve; Sampath Kannan; Christino Tamon (COLT, 1994)

On Learning Discretized Geometric Concepts (Extended Abstract) - Nader H. Bshouty; Zhixiang Chen 001; Steven Homer (FOCS, 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 the Complexity of Bilinear Forms over Associative Algebras. - Nader H. Bshouty (SIAM J. Comput., 1994)

A Note on Learning Multivariate Polynomials Under the Uniform Distribution (Extended Abstract). - Nader H. Bshouty (COLT, 1995)

On the Learnability of Zn-DNF Formulas (Extended Abstract). - Nader H. Bshouty; Zhixiang Chen 001; Scott E. Decatur; Steven Homer (COLT, 1995)

On Learning Decision Trees with Large Output Domains (Extended Abstract). - Nader H. Bshouty; Christino Tamon; David K. Wilson (COLT, 1995)

On the Fourier spectrum of monotone functions (Extended Abstract). - Nader H. Bshouty; Christino Tamon (STOC, 1995)

Exact Learning Boolean Functions via the Monotone Theory - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 1995)

On the Fourier spectrum of Monotone Functions - Nader H. Bshouty; Christino Tamon (Electron. Colloquium Comput. Complex., 1995)

The Monotone Theory for the PAC-Model - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 1995)

Exact Learning Boolean Function via the Monotone Theory. - Nader H. Bshouty (Inf. Comput., 1995)

On the Additive Complexity of 2 x 2 Matrix Multiplication. - Nader H. Bshouty (Inf. Process. Lett., 1995)

Learning Boolean Read-Once Formulas over Generalized Bases. - Nader H. Bshouty; Thomas R. Hancock; Lisa Hellerstein (J. Comput. Syst. Sci., 1995)

Size-Depth Tradeoffs for Algebraic Formulas. - Nader H. Bshouty; Richard Cleve; Wayne Eberly (SIAM J. Comput., 1995)

Learning Arithmetic Read-Once Formulas. - Nader H. Bshouty; Thomas R. Hancock; Lisa Hellerstein (SIAM J. Comput., 1995)

On Learning width Two Branching Programs (Extended Abstract). - Nader H. Bshouty; Christino Tamon; David K. Wilson (COLT, 1996)

On the Applications of Multiplicity Automata in Learning. - Amos Beimel; Francesco Bergadano; Nader H. Bshouty; Eyal Kushilevitz; Stefano Varricchio (FOCS, 1996)

Towards the Learnability of DNF Formulae. - Nader H. Bshouty (STOC, 1996)

Learning Multivariate Polynomials from Substitution and Equivalence Queries - Francesco Bergadano; Nader H. Bshouty; Stefano Varricchio (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)

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)

A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries. - Nader H. Bshouty (Inf. Process. Lett., 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)

Asking Questions to Minimize Errors. - Nader H. Bshouty; Sally A. Goldman; Thomas R. Hancock; Sleiman Matar (J. Comput. Syst. Sci., 1996)

On Learning Programs and Small Depth Circuits. - Francesco Bergadano; Nader H. Bshouty; Christino Tamon; Stefano Varricchio (EuroCOLT, 1997)

Simple Learning Algorithms Using Divide and Conquer. - Nader H. Bshouty (Comput. Complex., 1997)

On Learning Multivariate Polynomials Under the Uniform Distribution. - Nader H. Bshouty (Inf. Process. Lett., 1997)

A Tight Bound for Approximating the Square Root. - Nader H. Bshouty; Yishay Mansour; Baruch Schieber; Prasoon Tiwari (Inf. Process. Lett., 1997)

Exact Learning of Formulas in Parallel. - Nader H. Bshouty (Mach. Learn., 1997)

Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem. - Nader H. Bshouty; Lynn Burroughs (STACS, 1998)

On Learning Decision Trees with Large Output Domains. - Nader H. Bshouty; Christino Tamon; David K. Wilson (Algorithmica, 1998)

Learning Matrix Functions over Rings. - Nader H. Bshouty; Christino Tamon; David K. Wilson (Algorithmica, 1998)

A New Composition Theorem for Learning Algorithms - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 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)

Noise-Tolerant Parallel Learning of Geometric Concepts. - Nader H. Bshouty; Sally A. Goldman; H. David Mathias (Inf. Comput., 1998)

On Learning width Two Branching Programs. - Nader H. Bshouty; Christino Tamon; David K. Wilson (Inf. Process. Lett., 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 the Direct Sum Conjecture in the Straight Line Model. - Nader H. Bshouty (J. Complex., 1998)

On Interpolating Arithmetic Read-Once Formulas with Exponentiation. - Daoud Bshouty; Nader H. Bshouty (J. Comput. Syst. Sci., 1998)

Attribute-Efficient Learning in Query and Mistake-Bound Models. - Nader H. Bshouty; Lisa Hellerstein (J. Comput. Syst. Sci., 1998)

Interpolating Arithmetic Read-Once Formulas in Parallel. - Nader H. Bshouty; Richard Cleve (SIAM J. Comput., 1998)

Exact Learning of Discretized Geometric Concepts. - Nader H. Bshouty; Paul W. Goldberg; Sally A. Goldman; H. David Mathias (SIAM J. Comput., 1998)

Learning Threshold Functions with Small Weights Using Membership Queries. - Elias Abboud; Nader Agha; Nader H. Bshouty; Nizar Radwan; Fathi Saleh (COLT, 1999)

On Learning in the Presence of Unspecified Attribute Values. - Nader H. Bshouty; David K. Wilson (COLT, 1999)

Meeting Times of Random Walks on Graphs. - Nader H. Bshouty; Lisa Higham; Jolanta Warpechowska-Gruca (Inf. Process. Lett., 1999)

Lower Bounds for the Complexity of Functions in a Realistic RAM Model. - Nader H. Bshouty (J. Algorithms, 1999)

Learning DNF over the Uniform Distribution Using a Quantum Example Oracle. - Nader H. Bshouty; Jeffrey C. Jackson (SIAM J. Comput., 1999)

Learning functions represented as multiplicity automata. - Amos Beimel; Francesco Bergadano; Nader H. Bshouty; Eyal Kushilevitz; Stefano Varricchio (J. ACM, 2000)

On Boosting with Optimal Poly-Bounded Distributions. - Nader H. Bshouty; Dmitry Gavinsky (COLT/EuroCOLT, 2001)

Learning Regular Sets with an Incomplete Membership Oracle. - Nader H. Bshouty; Avi Owshanko (COLT/EuroCOLT, 2001)

Bounds for the Minimum Disagreement Problem with Applications to Learning Theory. - Nader H. Bshouty; Lynn Burroughs (COLT, 2002)

PAC = PAExact and Other Equivalent Models in Learning. - Nader H. Bshouty; Dmitry Gavinsky (FOCS, 2002)

On the proper learning of axis parallel concepts - Nader H. Bshouty; Lynn Burroughs (Electron. Colloquium Comput. Complex., 2002)

Learning Monotone DNF from a Teacher that Almost Does Not Answer Membership Queries. - Nader H. Bshouty; Nadav Eiron (J. Mach. Learn. Res., 2002)

On Using Extended Statistical Queries to Avoid Membership Queries. - Nader H. Bshouty; Vitaly Feldman (J. Mach. Learn. Res., 2002)

On Boosting with Polynomially Bounded Distributions. - Nader H. Bshouty; Dmitry Gavinsky (J. Mach. Learn. Res., 2002)

Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. - Nader H. Bshouty; Yishay Mansour (SIAM J. Comput., 2002)

PAC learning with nasty noise. - Nader H. Bshouty; Nadav Eiron; Eyal Kushilevitz (Theor. Comput. Sci., 2002)

Uniform-distribution attribute noise learnability. - Nader H. Bshouty; Jeffrey C. Jackson; Christino Tamon (Inf. Comput., 2003)

Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability. - Nader H. Bshouty (COLT, 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)

Exploring learnability between exact and PAC. - Nader H. Bshouty; Jeffrey C. Jackson; Christino Tamon (J. Comput. Syst. Sci., 2005)

Learning DNF from random walks. - Nader H. Bshouty; Elchanan Mossel; Ryan O'Donnell; Rocco A. Servedio (J. Comput. Syst. Sci., 2005)

Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning. - Nader H. Bshouty; Lynn Burroughs (Mach. Learn., 2005)

On Exact Learning from Random Walk. - Nader H. Bshouty; Iddo Bentov (ALT, 2006)

On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle. - Nader H. Bshouty; Ehab Wattad (ALT, 2006)

On Optimal Learning Algorithms for Multiplicity Automata. - Laurence Bisht; Nader H. Bshouty; Hanna Mazzawi (COLT, 2006)

Exact Learning Composed Classes with a Small Number of Mistakes. - Nader H. Bshouty; Hanna Mazzawi (COLT, 2006)

Polynomial multiplication over finite fields: from quadratic to straight-line complexity. - Nader H. Bshouty; Michael Kaminski (Comput. Complex., 2006)

Maximizing agreements and coagnostic learning. - Nader H. Bshouty; Lynn Burroughs (Theor. Comput. Sci., 2006)

Learning attribute-efficiently with corrupt oracles. - Rotem Bennet; Nader H. Bshouty (Theor. Comput. Sci., 2007)

Learning with errors in answers to membership queries. - Laurence Bisht; Nader H. Bshouty; Lawrance Khoury (J. Comput. Syst. Sci., 2008)

Guest Editors' Introduction: Special issue on Learning Theory (COLT-2007). - Nader H. Bshouty; Claudio Gentile (Mach. Learn., 2008)

Learning Automata. - Amos Beimel; Francesco Bergadano; Nader H. Bshouty; Eyal Kushilevitz; Stefano Varricchio (Encyclopedia of Algorithms, 2008)

Optimal Algorithms for the Coin Weighing Problem with a Spring Scale. - Nader H. Bshouty (COLT, 2009)

Linear Classifiers are Nearly Optimal When Hidden Variables Have Diverse Effect. - Nader H. Bshouty; Philip M. Long (COLT, 2009)

On Parity Check (0, 1)-Matrix over Zp. - Hanna Mazzawi; Nader H. Bshouty (Electron. Colloquium Comput. Complex., 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)

Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering. - Nader H. Bshouty; Philip M. Long (ICML, 2010)

Optimal Query Complexity for Reconstructing Hypergraphs. - Nader H. Bshouty; Hanna Mazzawi (STACS, 2010)

On Parity Check (0, 1)-Matrix over Zp. - Nader H. Bshouty; Hanna Mazzawi (SODA, 2011)

Algorithms for the Coin Weighing Problems with the Presence of Noise. - Nader H. Bshouty; Hanna Mazzawi (Electron. Colloquium Comput. Complex., 2011)

Reconstructing weighted graphs with minimal query complexity. - Nader H. Bshouty; Hanna Mazzawi (Theor. Comput. Sci., 2011)

Editors' Introduction. - Nader H. Bshouty; Gilles Stoltz; Nicolas Vayatis; Thomas Zeugmann (ALT, 2012)

On the Coin Weighing Problem with the Presence of Noise. - Nader H. Bshouty (APPROX-RANDOM, 2012)

Testers. - Nader H. Bshouty (ACM Commun. Comput. Algebra, 2012)

Testers and their Applications. - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 2012)

Linear classifiers are nearly optimal when hidden variables have diverse effects. - Nader H. Bshouty; Philip M. Long (Mach. Learn., 2012)

Toward a deterministic polynomial time algorithm with optimal additive query complexity. - Nader H. Bshouty; Hanna Mazzawi (Theor. Comput. Sci., 2012)

Exact Learning from Membership Queries: Some Techniques, Results and New Directions. - Nader H. Bshouty (ALT, 2013)

A Simple Algorithm for Undirected Hamiltonicity. - Hasan Abasi; Nader H. Bshouty (Electron. Colloquium Comput. Complex., 2013)

Multilinear Complexity is Equivalent to Optimal Tester Size. - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 2013)

On Exact Learning Monotone DNF from Membership Queries. - Hasan Abasi; Nader H. Bshouty; Hanna Mazzawi (ALT, 2014)

On r-Simple k-Path. - Hasan Abasi; Nader H. Bshouty; Ariel Gabizon; Elad Haramaty (MFCS (2), 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 (Electron. Colloquium Comput. Complex., 2014)

Guest Editors' foreword. - Nader H. Bshouty; Gilles Stoltz; Nicolas Vayatis; Thomas Zeugmann (Theor. Comput. Sci., 2014)

Linear Time Constructions of Some d -Restriction Problems. - Nader H. Bshouty (CIAC, 2015)

Non-Adaptive Learning a Hidden Hipergraph. - Hasan Abasi; Nader H. Bshouty; Hanna Mazzawi (CoRR, 2015)

Dense Testers: Almost Linear Time and Locally Explicit Constructions. - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 2015)

The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers. - Nader H. Bshouty; Catherine A. Haddad-Zaknoon (ALT, 2016)

Lower Bounds for Cover-Free Families. - Ali Z. Abdi; Nader H. Bshouty (Electron. J. Comb., 2016)

Derandomizing Chernoff Bound with Union Bound with an Application to $k$-wise Independent Sets. - Nader H. Bshouty (CoRR, 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 (Electron. Colloquium Comput. Complex., 2016)

Learning boolean halfspaces with small weights from membership queries. - Hasan Abasi; Ali Z. Abdi; Nader H. Bshouty (Theor. Comput. Sci., 2016)

Non-Adaptive Randomized Algorithm for Group Testing. - Nader H. Bshouty; Nuha Diab; Shada R. Kawar; Robert J. Shahla (ALT, 2017)

Almost Optimal Cover-Free Families. - Nader H. Bshouty; Ariel Gabizon (CIAC, 2017)

Learning Disjunctions of Predicates. - Nader H. Bshouty; Dana Drachsler-Cohen; Martin T. Vechev; Eran Yahav (COLT, 2017)

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 (ALT, 2018)

On Polynomial Time Constructions of Minimum Height Decision Tree. - Nader H. Bshouty; Waseem Makhoul (ISAAC, 2018)

Elementary Proofs of Some Stirling Bounds. - Nader H. Bshouty; Vivian E. Bshouty-Hurani; George Haddad; Thomas Hashem; Fadi Khoury; Omar Sharafy (CoRR, 2018)

Lower Bound for Non-Adaptive Estimate the Number of Defective Items. - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 2018)

Non-adaptive learning of a hidden hypergraph. - Hasan Abasi; Nader H. Bshouty; Hanna Mazzawi (Theor. Comput. Sci., 2018)

Exact learning from an honest teacher that answers membership queries. - Nader H. Bshouty (Theor. Comput. Sci., 2018)

Exact learning of juntas from membership queries. - Nader H. Bshouty; Areej Costa (Theor. Comput. Sci., 2018)

On Learning Graphs with Edge-Detecting Queries. - Hasan Abasi; Nader H. Bshouty (ALT, 2019)

Adaptive Exact Learning of Decision Trees from Membership Queries. - Nader H. Bshouty; Catherine A. Haddad-Zaknoon (ALT, 2019)

Almost Optimal Distribution-Free Junta Testing. - Nader H. Bshouty (CCC, 2019)

Lower Bound for Non-Adaptive Estimation of the Number of Defective Items. - Nader H. Bshouty (ISAAC, 2019)

Almost Optimal Testers for Concise Representations. - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 2019)

Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing. - Nader H. Bshouty; George Haddad; Catherine A. Haddad-Zaknoon (SOFSEM, 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 (SWAT, 2020)

Lecture Note on LCSSX's Lower Bounds for Non-Adaptive Distribution-free Property Testing. - Nader H. Bshouty (CoRR, 2020)

An Optimal Tester for k-Linear. - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 2020)

On Learning and Testing Decision Tree. - Nader H. Bshouty; Catherine A. Haddad-Zaknoon (CoRR, 2021)

Optimal deterministic group testing algorithms to estimate the number of defectives. - Nader H. Bshouty; Catherine A. Haddad-Zaknoon (Theor. Comput. Sci., 2021)

Almost Optimal Proper Learning and Testing Polynomials. - Nader H. Bshouty (LATIN, 2022)

On Testing Decision Tree. - Nader H. Bshouty; Catherine A. Haddad-Zaknoon (STACS, 2022)

On properties that are non-trivial to test. - Nader H. Bshouty; Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2022)

Non-Adaptive Proper Learning Polynomials. - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 2022)

On Detecting Some Defective Items in Group Testing. - Nader H. Bshouty; Catherine A. Haddad-Zaknoon (COCOON (1), 2023)

On Property Testing of the Binary Rank. - Nader H. Bshouty (MFCS, 2023)

A Note on Property Testing of the Binary Rank. - Nader H. Bshouty (CoRR, 2023)

Superpolynomial Lower Bounds for Learning Monotone Classes. - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 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)

An optimal tester for k-linear. - Nader H. Bshouty (Theor. Comput. Sci., 2023)

Approximating the Number of Relevant Variables in a Parity Implies Proper Learning. - Nader H. Bshouty; George Haddad (APPROX/RANDOM, 2024)

Approximating the Number of Relevant Variables in a Parity Implies Proper Learning. - Nader H. Bshouty (Electron. Colloquium Comput. Complex., 2024)

On one-sided testing affine subspaces. - Nader H. Bshouty (Theor. Comput. Sci., 2024)

On Exact Learning of d-Monotone Functions. - Nader H. Bshouty (CIAC (1), 2025)

A tight lower bound on non-adaptive group testing estimation. - Nader H. Bshouty; Tsun-Ming Cheung; Gergely Harcos; Hamed Hatami; Anthony Ostuni (Discret. Appl. Math., 2025)

On Properties that are Non-trivial to Test. - Nader H. Bshouty; Oded Goldreich 001 (Computational Complexity and Local Algorithms, 2025)

On Exact Learning of d-Monotone Functions. - Nader H. Bshouty (CoRR, 2025)

Improved lower bound for estimating the number of defective items. - Nader H. Bshouty (J. Comb. Optim., 2025)

Sublinear Time Algorithms for Abelian Group Isomorphism and Basis Construction. - Nader H. Bshouty (CoRR, 2025)