| Robust trainability of single neurons KU Höffgen, HU Simon Proceedings of the fifth annual workshop on Computational learning theory …, 1992 | 252 | 1992 |
| How robust is the n-cube? B Becker, HU Simon Information and Computation 77 (2), 162-178, 1988 | 208 | 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 | 204 | 2000 |
| On approximate solutions for combinatorial optimization problems HU Simon SIAM Journal on Discrete Mathematics 3 (2), 294-310, 1990 | 127 | 1990 |
| A tight Ω (loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functions HU Simon Foundations of Computation Theory: Proceedings of the 1983 International FCT …, 1983 | 117 | 1983 |
| Stability of k-Means Clustering S Ben-David, D Pál, HU Simon Learning Theory: 20th Annual Conference on Learning Theory, COLT 2007, San …, 2007 | 114 | 2007 |
| Relations between communication complexity, linear arrangements, and computational complexity J Forster, M Krause, SV Lokam, R Mubarakzjanov, N Schmitt, HU Simon FST TCS 2001: Foundations of Software Technology and Theoretical Computer …, 2001 | 112 | 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 | 99 | 2002 |
| General bounds on the number of examples needed for learning probabilistic concepts HU Simon Proceedings of the sixth annual conference on Computational learning theory …, 1993 | 75 | 1993 |
| 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 | 73 | 2014 |
| Determining the optimal contrast for secret sharing schemes in visual cryptography M Krause, HU Simon Combinatorics, Probability and Computing 12 (3), 285-299, 2003 | 63 | 2003 |
| On learning ring-sum-expansions P Fischer, HU Simon SIAM Journal on Computing 21 (1), 181-192, 1992 | 62 | 1992 |
| Contrast-optimal k out of n secret sharing schemes in visual cryptography T Hofmeister, M Krause, HU Simon Computing and Combinatorics: Third Annual International Conference, COCOON …, 1997 | 60 | 1997 |
| Estimating the optimal margins of embeddings in euclidean half spaces J Forster, N Schmitt, HU Simon, T Suttorp Machine Learning 51, 263-281, 2003 | 42 | 2003 |
| SVM-optimization and steepest-descent line search N List, HU Simon Proceedings of the 22nd Annual Conference on Computational Learning Theory, 2009 | 41 | 2009 |
| A general convergence theorem for the decomposition method N List, HU Simon Learning Theory: 17th Annual Conference on Learning Theory, COLT 2004, Banff …, 2004 | 41 | 2004 |
| Learning decision lists and trees with equivalence-queries HU Simon Computational Learning Theory: Second European Conference, EuroCOLT'95 …, 1995 | 41 | 1995 |
| 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 | 38 | 1999 |
| Preference-based teaching Z Gao, C Ries, H Simon, S Zilles Conference on Learning Theory, 971-997, 2016 | 37 | 2016 |
| Efficient learning of linear perceptrons S Ben-David, HU Simon Advances in Neural Information Processing Systems 13, 2000 | 36 | 2000 |
Sandra ZillesProfessor, Computer Science, University of ReginaVerified email at cs.uregina.ca
