Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Weinard, Maik - Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt am Main
Conditional Inequalities Shortest Common Superstring Problem
Deciding the FIFO Stability of Networks in Polynomial Time
Johann Wolfgang Goethe-Universitat Frankfurt am Main
International Journal of Foundations of Computer Science c World Scientific Publishing Company
The Necessity of Timekeeping in Adversarial Maik Weinard
Johann Wolfgang Goethe-Universitat Frankfurt am Main
Conditional Inequalities Shortest Common Superstring Problem
Analyse von Heuristiken Dissertation
Conditional Inequalities and the Shortest Common Superstring Problem
Deciding the FIFO Stability of Networks in Polynomial Time
On the Greedy Superstring Conjecture ? ?? Maik Weinard ? ? ? and Georg Schnitger y
Introduction Uniform Queueing Conclusion The Effects of Local Randomness in the
Analyse von Heuristiken Maik Weinard
The Necessity of Timekeeping in Adversarial Maik Weinard #
The Effects of Local Randomness in the Adversarial Queueing Model
On the Greedy Superstring Conjecture Maik Weinard and Georg Schnitger
Johann Wolfgang GoetheUniversitat Frankfurt am Main
The Necessity of Timekeeping in Adversarial Queueing
On the Greedy Superstring Conjecture # Maik Weinard and Georg Schnitger
International Journal of Foundations of Computer Science # World Scientific Publishing Company
On the Greedy Superstring Conjecture Maik Weinard & Georg Schnitger
