Maik Weinard

According to our database, Maik Weinard authored at least 8 papers between 2003 and 2010.

Collaborative distances:

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

2010

Selected Design Issues.

Sabine Helwig, Falk Hüffner, Ivo Rössling, Maik Weinard

Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2008

The Effects of Local Randomness in the Adversarial Queueing Model.

Yann Lorion, Maik Weinard

Proceedings of the Algorithms, 2008

2006

Analyse von Heuristiken (Analysis of heuristics)

Maik Weinard

PhD thesis, 2006

Erratum: "Conditional Inequalities And The Shortest Common Superstring Problem".

Uli Laube, Maik Weinard

Int. J. Found. Comput. Sci., 2006

Deciding the FIFO Stability of Networks in Polynomial Time.

Maik Weinard

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

The Necessity of Timekeeping in Adversarial Queueing.

Maik Weinard

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004

Conditional Inequalities and the Shortest Common Superstring Problem.

Uli Laube, Maik Weinard

Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

2003

On the Greedy Superstring Conjecture.

Maik Weinard, Georg Schnitger

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003