| Robust trainability of single neurons KU Hoffgen, HU Simon, KS Vanhorn Journal of Computer and System Sciences 50 (1), 114-125, 1995 | 243 | 1995 |
| How robust is the n-cube? B Becker, HU Simon Information and Computation 77 (2), 162-178, 1988 | 203 | 1988 |
| Contrast-optimal k out of n secret sharing schemes in visual cryptography T Hofmeister, M Krause, HU Simon Theoretical Computer Science 240 (2), 471-485, 2000 | 197 | 2000 |
| On approximate solutions for combinatorial optimization problems HU Simon SIAM Journal on Discrete Mathematics 3 (2), 294-310, 1990 | 124 | 1990 |
| A tight Ω (loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functions HU Simon International Conference on Fundamentals of Computation Theory, 439-444, 1983 | 114 | 1983 |
| Stability of k-Means Clustering S Ben-David, D Pál, HU Simon International conference on computational learning theory, 20-34, 2007 | 107 | 2007 |
| Relations between communication complexity, linear arrangements, and computational complexity J Forster, M Krause, SV Lokam, R Mubarakzjanov, N Schmitt, HU Simon International Conference on Foundations of Software Technology and …, 2001 | 106 | 2001 |
| Limitations of learning via embeddings in Euclidean half spaces S Ben-David, N Eiron, HU Simon Journal of Machine Learning Research 3 (Nov), 441-461, 2002 | 93 | 2002 |
| Recursive teaching dimension, VC-dimension and sample compression T Doliwa, G Fan, HU Simon, S Zilles The Journal of Machine Learning Research 15 (1), 3107-3131, 2014 | 67 | 2014 |
| General bounds on the number of examples needed for learning probabilistic concepts HU Simon Journal of Computer and System Sciences 52 (2), 239-254, 1996 | 67 | 1996 |
| On learning ring-sum-expansions P Fischer, HU Simon SIAM Journal on Computing 21 (1), 181-192, 1992 | 65 | 1992 |
| Contrast-optimal k out of n secret sharing schemes in visual cryptography T Hofmeister, M Krause, HU Simon International Computing and Combinatorics Conference, 176-185, 1997 | 62 | 1997 |
| Determining the optimal contrast for secret sharing schemes in visual cryptography M Krause, HU Simon Combinatorics, Probability and Computing 12 (3), 285-299, 2003 | 61 | 2003 |
| SVM-optimization and steepest-descent line search N List, HU Simon Proceedings of the 22nd Annual Conference on Computational Learning Theory, 2009 | 40 | 2009 |
| Learning decision lists and trees with equivalence-queries HU Simon European Conference on Computational Learning Theory, 322-336, 1995 | 40 | 1995 |
| Estimating the optimal margins of embeddings in euclidean half spaces J Forster, N Schmitt, HU Simon, T Suttorp Machine Learning 51 (3), 263-281, 2003 | 37 | 2003 |
| Sample-efficient strategies for learning in the presence of noise N Cesa-Bianchi, E Dichterman, P Fischer, E Shamir, HU Simon Journal of the ACM (JACM) 46 (5), 684-719, 1999 | 37 | 1999 |
| A general convergence theorem for the decomposition method N List, HU Simon International Conference on Computational Learning Theory, 363-377, 2004 | 36 | 2004 |
| Efficient learning of linear perceptrons S Ben-David, HU Simon Advances in Neural Information Processing Systems 13, 2000 | 35 | 2000 |
| Word problems for groups and contextfree recognition. HU Simon FCT, 417-422, 1979 | 34 | 1979 |
Sandra ZillesProfessor, Computer Science, University of ReginaVerified email at cs.uregina.ca
