Markus Lohrey, Vorträge 1-2, 4-11 (Raum 0.042, Tel. 7816-408,
Sprechstunde n.V.)
Holger Austinat, Vorträge 3, 12-13 (Raum 1.061, Tel. 7816-225,
Sprechstunde n.V.)
M. Herlihy and N. Shavit: The asynchronous computability theorem for t-resilent tasks. In Proceedings of the 1993 ACM Symposium on Theory of Computing, pages 111-120, 1993.
M. Herlihy and N. Shavit: A simple computability theorem for wait-free computation. In Proceedings of the 1994 ACM Symposium on Theory of Computing, pages 243-262, 1994.
M. Herlihy and N. Shavit: The topoligical structure of asynchronous computability. ps-file, Erscheint in Journal of the ACM, 1999
Nancy A. Lynch: Distributed Algorithms. Morgan Kaufmann, 1998.
Gerard Tel: Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Alberto Negro, Nicola Santoro, and Jorge Urrutia: Efficient Distributed Selection with Bounded Messages. In IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 4, April 1997.
Datum | Thema | Vortragender | |
1. | 8.11.99 | Leader Election | Oswald Heinz |
2. | 15.11.99 | Synchroner Konsens I | Gunther Vogel |
3. | 22.11.99 | Synchroner Konsens II | Khoi Nguyen |
4. | 29.11.99 | Gegenseitiger Ausschluss | Xue Bai |
5. | 6.12.99 | Asynchroner Konsens | Erik Krebs |
6. | 13.12.99 | Atomare Objekte I | Oswald Heinz |
7. | 20.12.99 | Atomare Objekte II | Gabor Duroska |
8. | 10.01.00 | Topological Structure of Asynchronous Computability I | Nicolas Nardelli |
9. | 17.01.00 | Topological Structure of Asynchronous Computability II | Albrecht Messner |
10. | 24.01.00 | Topological Structure of Asynchronous Computability III | Alexander Miller |
11. | 31.01.00 | Topological Structure of Asynchronous Computability IV | Manfred Kufleitner |
12. | 7.02.00 | Terminationserkennung | Leiqin Lu |
13. | 14.02.00 | Efficient Distributed Selection with Bounded Messages | Bastian Leibe |