- Exact Learning Boolean Functions via the Monotone Theory
- On the Fourier Spectrum of Monotone Functions Nader H. Bshouty Christino Tamon
- On Learning Width Two Branching Programs Extended Abstract
- Multiplication of polynomials over finite fields Nader H. Bshouty and Michael Kaminski
- ON THE DIRECT SUM CONJECTURE IN THE STRAIGHT LINE MODEL
- Chapter 5.5 Trees (91 97) Chapter 13 Binary Search Trees (244 262)
- COLT Models Nader H. Bshouty
- Learning Using Divide and Conquer Nader H. Bshouty Eyal Kushilevitz
- Interpolating Arithmetic ReadOnce Formulas in Parallel
- What is COLT? Nader H. Bshouty Eyal Kushilevitz
- cs,Technion Dictionary)(
- Online Learning Nader H. Bshouty Eyal Kushilevitz
- PAC Learning Nader H. Bshouty Eyal Kushilevitz
- Online Learning Nader H. Bshouty Eyal Kushilevitz
- VCdim and Sauer Lemma Definitions. A range space S is a pair (X, C), where X is finite set of points and
- Hardness Results for Learning DNF Nader H. Bshouty Eyal Kushilevitz
- Lecture 3 in computational learning theory Learning in the PACU(MQ) model
- Polynomial time Prediction Strategy with almost Optimal Mistake Probability
- A Booster for the PAExact model Nader H. Bshouty
- Journal of Machine Learning Research 3 (2002) 49-57 Submitted 3/02; Published 7/02 Learning Monotone DNF from a Teacher that Almost
- Journal of Machine Learning Research 2 (2002) 359-395 Submitted 10/01; Published 02/02 On Using Extended Statistical Queries to Avoid Membership
- Journal of Machine Learning Research 4 (2003) 157-176 Submitted 10/02; Published 6/03 On the Proper Learning of Axis-Parallel Concepts
- Journal of Machine Learning Research 3 (2002) 483-506 Submitted 6/02; Published 11/02 On Boosting with Polynomially Bounded Distributions
- Learning Threshold Functions with Small using Membership Queries
- Uniform-Distribution Attribute Noise Learnability Nader H. Bshouty
- On Learning Exclusive-Or of Terms Nader H. Bshouty
- A Note on Learning Multivariate Polynomials under the Uniform Distribution
- MULTIPLICATIVE COMPLEXITY OF DIRECT SUM OF QUADRATIC SYSTEMS
- Multiplicative complexity of polynomial multiplication over finite fields*
- Introduction Cormen, Leiserson, Rivest, Introduction to Algorithms.
- Chapter 19: B trees (381 397) Chapter 15: Augmenting data structures (281 290)
- Skip Lists Skip lists: A probabilistic Alternative to Balanced Trees,
- Chapter 12-Hash tables (pages 219--243) Lecture7 of Geiger & Itai's slide brochure
- Union/Find Chapter 22 Data Structures for Disjoint Sets (440 462)
- (Directed Graphs) (V,E) V .E
- Garbage Collection (Garbage collection)
- ADDITION REQUIREMENTS FOR MATRIX AND TRANSPOSED MATRIX PRODUCTS
- On Learning Decision Trees with Large Output Domains Nader H. Bshouty Christino Tamon David K. Wilson
- Exact learning Via the Monotone Theory Nader H. Bshouty
- On Learning Arithmetic ReadOnce Formulas with Exponentiation
- NoiseTolerant DistributionFree Learning of General Geometric Concepts
- The Monotone Theory for the PACModel Nader H. Bshouty \Lambda
- Maximal rank of m n ( m n -k ) tensors Nader H. Bshouty
- Arrays+lists Chapter 11.2 Linked lists (204 213)
- Learning with Errors in Answers to Membership Queries Laurence Bisht Nader H. Bshouty
- Median/sort )( BubbleSortO(n).
- -net and -sample Nader H. Bshouty
- Multiplicative complexity of polynomial multiplication over finite fields*
- A lower bound for matrix multiplication Nader H. Bshouty
- Garbage Collection (Garbage collection)
- Algorithms on Strings, Trees, and Sequences, Dan Gustfield Chapter 5, 7.3, 7.4, 7.17
- The Monotone Theory Nader H. Bshouty Eyal Kushilevitz
- More Efficient PAC-learning of DNF with Membership Queries Under the Uniform Distribution
- Exact Learning Multiplicity Automata Nader H. Bshouty Eyal Kushilevitz
- HeapQuickSort for (i = 0; i < n-1; i++) {
- Advanced Topics in Computational Learning 10.6.2003 Lecture 34: Learning Multiplicity Automata Using a
- A COLT Story Nader H. Bshouty Eyal Kushilevitz
- Attributeefficient learning in query and mistakebound models Nader H. Bshouty
- Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
- Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning
- Advanced Topics in Computational Learning 15.7.2003 Lecture 9-10: Learning DNF in PACU(MQ)
- MQ ALGORITHM FOR LEARNING DNF WITH RESPECT TO THE UNIFORM
- Results in other Online Learning Models Nader H. Bshouty
- Computational Learning Theory Assignment 2
