1. Lynch, N.A., Distributed Algorithms, San Francisco, CA: Morgan Kaufmann, 1997.
2. Wattenhofer, R, Principles of Distributed Computing, Lecture Material, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, 2014. Available at http://dcg.ethz.ch/lectures/fs14/podc.
3. Peleg, D. and Rubinovich, V., A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction, SIAM J. Comput., 2000, vol. 30, no. 5, pp. 1427–1442.
4. Dinitz, Y., Moran, Sh., and Rajsbaum, S, Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings, J. ACM, 2008, vol. 55, no. 1, pp. 1–28.
5. Vyalyi, M.N. and Khuziev, I.M, Distributed Communication Complexity of Spanning Tree Construction, Probl. Peredachi Inf., 2015, vol. 51, no. 1, pp. 54–71 [Probl. Inf. Trans. (Engl. Transl.), 2015, vol. 51, no. 1, pp. 49–65].