Niels Schmitt

Orcid: 0000-0002-8329-6833

According to our database1, Niels Schmitt authored at least 9 papers between 1999 and 2005.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
Inner Product Spaces for Bayesian Networks.
J. Mach. Learn. Res., 2005

2004
Bayesian Networks and Inner Product Spaces.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
Mach. Learn., 2003

2002
A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions.
SIAM J. Comput., 2002

Komplexitätstheorie, effiziente Algorithmen und die Bundesliga.
Inform. Spektrum, 2002

A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
Proceedings of the Computational Learning Theory, 2001

1999
Football Elimination Is Hard to Decide Under the 3-Point-Rule.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999


  Loading...