Football Elimination Is Hard to Decide Under the 3-Point-Rule. - Thorsten Bernholt; Alexander Gülich; Thomas Hofmeister; Niels Schmitt (MFCS, 1999)

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. - Jürgen Forster; Niels Schmitt; Hans Ulrich Simon (COLT/EuroCOLT, 2001)

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. - Jürgen Forster; Matthias Krause 001; Satyanarayana V. Lokam; Rustam Mubarakzjanov; Niels Schmitt; Hans Ulrich Simon (FSTTCS, 2001)

A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three. - Hanno Lefmann; Niels Schmitt (LATIN, 2002)

Komplexitätstheorie, effiziente Algorithmen und die Bundesliga. - Thorsten Bernholt; Alexander Gülich; Thomas Hofmeister; Niels Schmitt; Ingo Wegener (Inform. Spektrum, 2002)

A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions. - Hanno Lefmann; Niels Schmitt (SIAM J. Comput., 2002)

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. - Jürgen Forster; Niels Schmitt; Hans Ulrich Simon; Thorsten Suttorp (Mach. Learn., 2003)

Bayesian Networks and Inner Product Spaces. - Atsuyoshi Nakamura; Michael Schmitt 001; Niels Schmitt; Hans Ulrich Simon (COLT, 2004)

Inner Product Spaces for Bayesian Networks. - Atsuyoshi Nakamura; Michael Schmitt 001; Niels Schmitt; Hans Ulrich Simon (J. Mach. Learn. Res., 2005)