Zitierungen

• [BryaO03] Brynt, Randal E. / O'Hallaron, David R. Computer Systems - A Programmers' Perspective. Prentice Hall Pearson Education, 2003.
• [Bokh87] Bokhari, Shahid H. Assignment Problems in Parallel and Distributed Computing. Kluwer Academic Publishers, 1987.
• [CoffD73] Coffmann, E. G., Jr. / Denning, P., Operating Systems Theory, Prentice-Hall, Inc., 1973
• [CoffG93] Coffman, E. G., Jr. / Garey, M. R., Proof of the 4/3 Conjecture for Preempive vs Nonpreemptive Two-Processor Scheduling. Journal of the ACM, 40(5):991-1018, November 1993.
• [Dies96] Diestel, Reinhard. Graphentheorie. Springer-Lehrbuch. Springer, 1996.
• [GareJ79] Garey, Michael R. / Johnson, David S. Computers and Intractability. W. H. Freeman and Company, 1979.
• [Jung94] Jungnickel, Dieter. Graphen, Netzwerke und Algorithmen. BI Wissenschaftsverlag, 3 edition, 1994. Vollständig überarbeitete und erweiterte Auflage.
• [Jose96] Joseph, M., Real-time Systems: Specification, Verification and Analysis, Prentice Hall, 1996
• [Knut93] Knuth, Donald E. The Stanford GraphBase. Addison-Wesley Publishing Company, 1993. A Platform for Combinatorial Computing.
• [Liu00] Liu, Jane W.S. Real-Time Systems. Prentice-Hall, 2000
• [MehlN99] Mehlhorn, Kurt / Näher, Stefan. LEDA A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
• [Pine95] Pinedo, Michael. Scheduling - Theory, Algorithms, and Systems Prentice Hall, 1995.
• [Stie01] Stiege, Günther. Higher Decompositions in Undirected Graphs. Berichte aus dem Fachbereich Informatik 1/01, Universität Oldenburg, 2001.
• [Stie01b] Stierand, Ingo. Ambrosia/MP - Ein Echtzeitbetriebssystem für eingebettete Mikroprozessorsysteme. Universität Oldenburg. Berichte aus dem Fachbereich Informatik 6/01
• [Stie96b] Stiege, Günther. Connectivity and Periodicity in Undirected Graphs Hildesheimer Informatik-Berichte 31/96, Universität Hildesheim, 1996.
• [Stie97] Stiege, Günther. Remarks on Periods and Colorings in Graphs. Hildesheimer Informatik-Berichte 03/97, Universität Hildesheim, 1997.
• [Stie97a] Stiege, Günther. An Algorithm for Finding the Connectivity Structure of Undirected Graphs. Hildesheimer Informatik-Berichte 13/97, Universität Hildesheim, 1997.
• [Stie98] Stiege, Günther. Edge Partitions in Undirected Graphs. Berichte aus dem Fachbereich Informatik 5/98, Universität Oldenburg, 1998.

up