![]() |
| 2006 | ||
|---|---|---|
| 6 | EE | Maik Weinard: Deciding the FIFO Stability of Networks in Polynomial Time. CIAC 2006: 81-92 |
| 5 | EE | Uli Laube, Maik Weinard: Erratum: "Conditional Inequalities And The Shortest Common Superstring Problem". Int. J. Found. Comput. Sci. 17(1): 247- (2006) |
| 2005 | ||
| 4 | EE | Maik Weinard: The Necessity of Timekeeping in Adversarial Queueing. WEA 2005: 440-451 |
| 3 | EE | Uli Laube, Maik Weinard: Conditional inequalities and the shortest common superstring problem. Int. J. Found. Comput. Sci. 16(6): 1219-1230 (2005) |
| 2004 | ||
| 2 | EE | Uli Laube, Maik Weinard: Conditional Inequalities and the Shortest Common Superstring Problem. Stringology 2004: 124-138 |
| 2003 | ||
| 1 | EE | Maik Weinard, Georg Schnitger: On the Greedy Superstring Conjecture. FSTTCS 2003: 387-398 |
| 1 | Uli Laube | [2] [3] [5] |
| 2 | Georg Schnitger | [1] |