The SCEAS System
Navigation Menu

Search the dblp DataBase


Maik Weinard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maik Weinard
    Deciding the FIFO Stability of Networks in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:81-92 [Conf]
  2. Maik Weinard, Georg Schnitger
    On the Greedy Superstring Conjecture. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:387-398 [Conf]
  3. Uli Laube, Maik Weinard
    Conditional Inequalities and the Shortest Common Superstring Problem. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:124-138 [Conf]
  4. Maik Weinard
    The Necessity of Timekeeping in Adversarial Queueing. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:440-451 [Conf]
  5. 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:1219-1230 [Journal]
  6. 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:247-0 [Journal]

  7. Selected Design Issues. [Citation Graph (, )][DBLP]

  8. The Effects of Local Randomness in the Adversarial Queueing Model. [Citation Graph (, )][DBLP]

Search in 0.049secs, Finished in 0.049secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002