| 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 | 113 | 2001 |
| Estimating the optimal margins of embeddings in euclidean half spaces J Forster, N Schmitt, HU Simon, T Suttorp Machine Learning 51, 263-281, 2003 | 43 | 2003 |
| Football elimination is hard to decide under the 3-point-rule T Bernholt, A Gülich, T Hofmeister, N Schmitt International Symposium on Mathematical Foundations of Computer Science, 410-418, 1999 | 34 | 1999 |
| In-memory end-to-end process of predictive analytics C Heuer, N Schmitt US Patent App. 14/076,187, 2015 | 21 | 2015 |
| Estimating the optimal margins of embeddings in Euclidean half spaces J Forster, N Schmitt, HU Simon International Conference on Computational Learning Theory, 402-415, 2001 | 21 | 2001 |
| A deterministic polynomial-time algorithm for Heilbronn's problem in three dimensions H Lefmann, N Schmitt SIAM Journal on Computing 31 (6), 1926-1947, 2002 | 18 | 2002 |
| Inner Product Spaces for Bayesian Networks. A Nakamura, M Schmitt, N Schmitt, T Jaakkola Journal of Machine Learning Research 6 (9), 2005 | 12 | 2005 |
| Komplexitatstheorie, effiziente Algorithmen und die Bundesliga T Bernholt, A Gulich, T Hofmeister, N Schmitt, I Wegener Informatik-Spektrum 25 (6), 488-502, 2002 | 7 | 2002 |
| Bayesian networks and inner product spaces A Nakamura, M Schmitt, N Schmitt, HU Simon International Conference on Computational Learning Theory, 518-533, 2004 | 2 | 2004 |
| A Deterministic Polynomial Time Algorithm for Heilbronn’s Problem in Dimension Three H Lefmann, N Schmitt LATIN 2002: Theoretical Informatics: 5th Latin American Symposium Cancun …, 2002 | | 2002 |
| Relations between Communication Complexity, Linear Arrangements, and Computational Complexity RMN Schmitt, HU Simon | | |
