Martin Dietzfelbinger. The Probability of a Rendezvous is Minimal in Complete Graphs. In Prosenjit Bose, Pat Morin, editors, Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings. Volume 2518 of Lecture Notes in Computer Science, pages 55-66, Springer, 2002. [doi]
Abstract is missing.