Literaturreferenzen des Teilprojekts A7

Konferenzen

[M95]	Ernst W. Mayr: Scheduling Interval Orders in Parallel Proceedings of the 28th Hawaii International Conference on System Sciences (HICSS-28), Vol. II: Software Technology, 20-28, IEEE Computer Society Press, 1995.
[HM96]	Volker Heun, Ernst W. Mayr: Embedding Graphs with Bounded Treewidth into Optimal Hypercubes Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS 96), LNCS 1046, 157-168, Springer-Verlag, 1996.
[HM96b]	Volker Heun, Ernst W. Mayr: Optimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees Into Hypercubes Proceedings of the 4th Parallel Systems and Algorithms Workshop, Jülich, Germany, 10-12 April, 1996 (PASA'96), 195-209, World Scientific Publishing, 1997.
[EJ96a]	Thomas Erlebach, Klaus Jansen: Scheduling of Virtual Connections in Fast Networks Proceedings of the 4th Parallel Systems and Algorithms Workshop, Jülich, Germany, 10-12 April, 1996 (PASA'96), 13-32, World Scientific Publishing, 1997.
[HM96c]	Volker Heun, Ernst W. Mayr: Efficient Dynamic Embeddings of Arbitrary Binary Trees into Hypercubes Proceedings of the 3rd International Workshop on Parallel Algorithms for Irregularly Structured Problems (IRREGULAR '96), LNCS 1117, 287-298, Springer-Verlag, 1996.
[MS96]	Ernst W. Mayr, Hans Stadtherr: Efficient Parallel Algorithms for Scheduling with Tree Precedence Constraints Proceedings of the 2nd International Euro-Par Conference on Parallel Processing (Euro-Par'96) Vol. II, LNCS 1124, 543-554, Springer-Verlag, 1996.
[HM96d]	Volker Heun, Ernst W. Mayr: A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes Proceedings of the 2nd International Euro-Par Conference on Parallel Processing (Euro-Par'96), Vol. I, LNCS 1123, 222-233, Springer-Verlag, 1996.
[EJ97]	Thomas Erlebach, Klaus Jansen: Call Scheduling in Trees, Rings and Meshes Proceedings of the 30th Hawaii International Conference on System Sciences (HICSS-30), Vol. I, 221-222, IEEE Computer Society Press, 1997.

Zeitschriften

[MW96]	Ernst W. Mayr, Ralph Werchner: Divide-and-Conquer Algorithms on the Hypercube Theoretical Computer Science 162 (1996), 283-296.
[HM96a]	Volker Heun, Ernst W. Mayr: A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube Journal of Algorithms, Vol. 20, No. 2 (1996), 375-399.
[M96]	Ernst W. Mayr: Scheduling interval orders in parallel Parallel Algorithms and Applications, Vol. 8 (1996), 21-34.

Dissertationen

[H96]

Volker Heun:
Efficient Embeddings of Treelike Graphs into Hypercubes
Dissertation, Technische Universität München, 1996
Reihe Informatik, Shaker Verlag, Aachen, 1996.

Beiträge in Büchern

[BE97]

Stefan Bischof, Thomas Erlebach:
Classification and Survey of Strategies
In: T. Schnekenburger und G. Stellner (Hrsg.):
Dynamic Load Distribution for Parallel Applications, Bd. 24 der Reihe TEUBNER TEXTE zur Informatik, Teubner Verlag, Stuttgart, 1997.

Technische Berichte

[HM93]	Volker Heun, Ernst W. Mayr: A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube Technical Report TUM-I9321: PS-File (340kB), gzipped PS-File (87kB)
[MW93]	Ernst W. Mayr, Ralph Werchner: Divide-and-Conquer Algorithms on the Hypercube Technical Report TUM-I9322: PS-File (485kB), gzipped PS-File (107kB)
[M94]	Ernst W. Mayr: Scheduling Interval Orders in Parallel Technical Report TUM-I9426: PS-File (333kB), gzipped PS-File (95kB)
[MS95]	Ernst W. Mayr, Hans Stadtherr: Optimal Parallel Algorithms for Two Processor Scheduling with Tree Precedence Constraints Technical Report TUM-I9531: PS-File (931kB), gzipped PS-File (187kB)
[MW95a]	Ernst W. Mayr, Ralph Werchner: Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks Technical Report TUM-I9532: PS-File (800kB), gzipped PS-File (175kB)
[HM95]	Volker Heun, Ernst W. Mayr: Embedding Graphs with Bounded Treewidth into Optimal Hypercubes Technical Report TUM-I9539: PS-File (975kB), gzipped PS-File (179kB) (SFB 342/22/95 A - Teilprojekt A7)

Stefan Bischof,1997-09-18