B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tre, counting, leader election and related problems, Proc. Annual ACM Symp. on Theory of Computing (STOC), pp.230-240, 1987.
DOI : 10.1145/28395.28421

Y. Afek, S. Kuten, and M. Yung, Local detection for global self stabilization, Proc. 4th Workshop on Distributed Algorithms, pp.15-28, 1991.

R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg, Labeling schemes for tree representation, Proc. 7th International Workshop on Distributed Computing (IWDC), pp.13-24, 2005.
DOI : 10.1007/11603771_2
URL : https://hal.archives-ouvertes.fr/hal-00341573

R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg, Label-Guided Graph Exploration by a Finite Automaton, 32nd Int. Colloquium on Automata, Languages and Programming (ICALP), pp.335-346, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00339772

F. Chin and H. F. Ting, An almost linear time and O(n log n + e) messages distributed algorithm for minimum-weight spanning trees, Proc 26th IEEE Symp. on Foundations of Computer Science (FOCS), pp.257-266, 1985.

T. H. Cormen, T. Leiserson, and R. L. Rivest, Introduction to Algorithms, 1990.

M. Elkin, A faster distributed protocol for constructing a minimum spanning tree, Proc. ACM-SIAM on Discrete Algorithms (SODA), pp.352-361, 2004.
DOI : 10.1016/j.jcss.2006.07.002

M. Elkin, An Unconditional Lower Bound on the Hardness of Approximation of Distributed Minimum Spanning Tree Problem, Proc. 36th Annual ACM Symp. on Theory of Computing (STOC), pp.331-340, 2004.

P. Fraigniaud, D. Ilcinkas, and A. Pelc, Oracle size, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.179-187, 2006.
DOI : 10.1145/1146381.1146410
URL : https://hal.archives-ouvertes.fr/hal-00339854

P. Fraigniaud, D. Ilcinkas, and A. Pelc, Tree Exploration with an Oracle, MFCS), pp.24-37, 2006.
DOI : 10.1007/11821069_2
URL : https://hal.archives-ouvertes.fr/hal-00339868

E. Gafni, Improvements in the time complexity of two message-optimal election algorithms, Proceedings of the fourth annual ACM symposium on Principles of distributed computing , PODC '85, pp.175-185, 1985.
DOI : 10.1145/323596.323612

R. G. Gallager, P. A. Humblet, and P. M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems, vol.5, issue.1, pp.66-67, 1983.
DOI : 10.1145/357195.357200

F. Kuhn, T. Moscibroda, and R. Wattenhofer, What cannot be compute Locally!, Proc. 23th ACM Symp. on Principles of Distributed Computing, pp.300-309, 2004.

Z. Lotker, B. Patt-shamir, and D. Peleg, Distributed MST for Constant Diameter Graphs, Proc. 20th ACM Symp. on Principles of Distributed Computing, pp.63-72, 2001.
DOI : 10.1007/s00446-005-0127-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.3391

M. Naor and L. Stockmeyer, What can be computed locally?, 25th ACM Symposium on Theory of Computing (STOC), pp.184-193, 1993.
DOI : 10.1145/167088.167149
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.902

D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Mathematics, 2000.
DOI : 10.1137/1.9780898719772

D. Peleg and R. Rubinovich, A near-tight lower bound on the time complexity of distributed MST construction, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), pp.253-261, 1999.
DOI : 10.1109/SFFCS.1999.814597