
Search the dblp DataBase
Maik Weinard:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Maik Weinard
Deciding the FIFO Stability of Networks in Polynomial Time. [Citation Graph (0, 0)][DBLP] CIAC, 2006, pp:8192 [Conf]
 Maik Weinard, Georg Schnitger
On the Greedy Superstring Conjecture. [Citation Graph (0, 0)][DBLP] FSTTCS, 2003, pp:387398 [Conf]
 Uli Laube, Maik Weinard
Conditional Inequalities and the Shortest Common Superstring Problem. [Citation Graph (0, 0)][DBLP] Stringology, 2004, pp:124138 [Conf]
 Maik Weinard
The Necessity of Timekeeping in Adversarial Queueing. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:440451 [Conf]
 Uli Laube, Maik Weinard
Conditional inequalities and the shortest common superstring problem. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:12191230 [Journal]
 Uli Laube, Maik Weinard
Erratum: "Conditional Inequalities And The Shortest Common Superstring Problem". [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2006, v:17, n:1, pp:2470 [Journal]
Selected Design Issues. [Citation Graph (, )][DBLP]
The Effects of Local Randomness in the Adversarial Queueing Model. [Citation Graph (, )][DBLP]
Search in 0.049secs, Finished in 0.049secs
