Matthias Ott

According to our database, Matthias Ott authored at least 8 papers between 1995 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2002

Avoiding coding tricks by hyperrobust learning.

Matthias Ott, Frank Stephan

Theor. Comput. Sci., 2002

Learning to Win Process-Control Games Watching Game-Masters.

John Case, Matthias Ott, Arun Sharma, Frank Stephan

Inf. Comput., 2002

2000

Structural measures for games and process control in the branch learning model.

Matthias Ott, Frank Stephan

Theor. Comput. Sci., 2000

Robust Learning Aided by Context.

John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan

J. Comput. Syst. Sci., 2000

1998

Learning strategies for infinite games.

Matthias Ott

PhD thesis, 1998

1997

The Complexity of Learning Branches and Strategies from Queries.

Matthias Ott, Frank Stephan

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996

Learning Branches and Learning to Win Closed Games.

Martin Kummer, Matthias Ott

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

1995

Effective Strategies for Enumeration Games.

Martin Kummer, Matthias Ott

Proceedings of the Computer Science Logic, 9th International Workshop, 1995