1. Verteilte Algorithmen zur Koordinatorwahl in Netzwerken, Diplomarbeit Nr. 1727, Universität Stuttgart, Fakultät Informatik, 1999, 66 pp (in German).
2. ? The probability of a rendezvous is minimal in complete graphs,? 13th International Symposium on Algorithms and Computation (ISAAC), Proceedings, Eds. and LNCS 2518, 55-66. Springer-Verlag, New York, 2002.
3. Approximating the permanent of graphs with large factors
4. and Theory of computational complexity, Wiley, New York, 2000.
5. Analysis of a randomized rendezvous algorithm