1. D. Aldous, J. Fill, Reversible Markov chains and random walks on graphs, unpublished manuscript, 〈http://stat-www.berkeley.edu/users/aldous/book.html〉, 1999.
2. Eigenvalues and expanders;Alon;Combinatorica,1986
3. J. Aspnes, W. Hurwood, Spreading rumors rapidly despite an adversary, in: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, PODC96, 1996.
4. Design and analysis of an efficient communication strategy for hierarchical and highly changing ad-hoc mobile networks;Chatzigiannakis;ACM/Baltzer Mobile Networks J., Special Issue on Parallel Processing Issues in Mobile Computing, Guest Editors: A. Zomaya, M. Kumar, MONET,2004
5. I. Chatzigiannakis, S. Nikoletseas, P. Spirakis, An efficient communication strategy for ad-hoc mobile networks, in: Proceedings of the 15th International Symposium on Distributed Computing—DISC’01, Lecture Notes in Computer Science, vol. 2180, Springer, Berlin, 2001, pp. 285–299, Also Brief Announcement, in: Proceedings of the 20th Annual Symposium on Principles of Distributed Computing—PODC’01, ACM Press, New York, 2001, pp. 320–322.