1. S. Alesker, “A remark on the Szarek-Talagrand theorem,” Combinatorics, Probability, and Computing, vol. 6, pp. 139–144, 1997.
2. N. Alon, S. Ben-David, N. Cesa-Bianchi, and D. Haussler, “Scale-sensitive dimensions, uniform convergence, and learnability,” Journal of the ACM, vol. 44, pp. 615–631, 1997.
3. M. Anthony and P. L. Bartlett, Neural Network Learning: Theoretical Foundations, Cambridge University Press, Cambridge, 1999.
4. P. Assouad, “Sur les classes de Vapnik-Chervonenkis,” Comptes Rendus des Séances de l’Académie des Sciences. Série I, vol. 292, pp. 921–924, 1981.
5. N. Cesa-Bianchi and D. Haussler, “A graph-theoretic generalization of the Sauer-Shelah lemma,” Discrete Applied Mathematics, vol. 86, pp. 27–35, 1998.