S. Abiteboul, S. Alstrup, H. Kaplan, T. Milo, T. Rauhe et al., Compact Labeling Scheme for Ancestor Queries, SIAM Journal on Computing, vol.35, issue.6, pp.1295-1309, 2006.
DOI : 10.1137/S0097539703437211

Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, A. Rosén et al., Slide???The Key to Polynomial End-to-End Communication, Journal of Algorithms, vol.22, issue.1, pp.158-186, 1997.
DOI : 10.1006/jagm.1996.0819

Y. Afek, B. Awerbuch, and E. Gafni, Applying static network protocols to dynamic networks, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp.358-370, 1987.
DOI : 10.1109/SFCS.1987.7

Y. Afek, B. Awerbuch, S. A. Plotkin, and M. Saks, Local management of a global resource in a communication network, Journal of the ACM, vol.43, issue.1, pp.1-19, 1996.
DOI : 10.1145/227595.227596

Y. Afek, E. Gafni, and M. Ricklin, Upper and lower bounds for routing schemes in dynamic networks, 30th Annual Symposium on Foundations of Computer Science, pp.370-375, 1989.
DOI : 10.1109/SFCS.1989.63505

Y. Afek and M. Ricklin, Sparser: a paradigm for running distributed algorithms J. of Algorithms 14, pp.316-328, 1993.

Y. Afek and M. E. Saks, Detecting global termination conditions in the face of uncertainty, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing , PODC '87, pp.109-124, 1987.
DOI : 10.1145/41840.41850

S. Alstrup, C. Gavoille, H. Kaplan, and T. Rauhe, Nearest common ancestors, Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '02, pp.441-456, 2004.
DOI : 10.1145/564870.564914
URL : https://hal.archives-ouvertes.fr/hal-00307617

R. Bar-yehuda and S. Kutten, Fault tolerant distributed majority commitment, Journal of Algorithms, vol.9, issue.4, pp.568-582, 1988.
DOI : 10.1016/0196-6774(88)90017-X

L. Barrire, P. Flocchini, P. Fraigniaud, and N. Santoro, Can we elect if we cannot compare?, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '03, pp.324-332, 2003.
DOI : 10.1145/777412.777469

Y. Bartal and A. Rosen, The distributed k-server problem-a competitive distributed translator for k-server algorithms, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.344-354, 1992.
DOI : 10.1109/SFCS.1992.267756

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

M. Elkin, A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.185-194, 2007.
DOI : 10.1145/1281100.1281128

M. J. Fischer, N. A. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/3149.214121

P. Fraigniaud and C. Gavoille, Routing in Trees, Proc. 28th Int. Colloq. on Automata, Languages, and Programming (ICALP), pp.757-772, 2001.
DOI : 10.1007/3-540-48224-5_62
URL : https://hal.archives-ouvertes.fr/hal-00307398

C. Gavoille, D. Peleg, S. Pérennes, and R. Raz, Distance labeling in graphs, Journal of Algorithms, vol.53, issue.1, pp.85-112, 2004.
DOI : 10.1016/j.jalgor.2004.05.002
URL : https://hal.archives-ouvertes.fr/hal-00307381

S. Kannan, M. Naor, and S. Rudich, Implicit representation of graphs, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.596-603, 1992.
DOI : 10.1145/62212.62244

M. Katz, N. A. Katz, A. Korman, and D. Peleg, Labeling Schemes for Flow and Connectivity, SIAM Journal on Computing, vol.34, issue.1, pp.23-40, 2004.
DOI : 10.1137/S0097539703433912

E. Korach, S. Kutten, and S. Moran, A modular technique for the design of efficient distributed leader finding algorithms, ACM Transactions on Programming Languages and Systems, vol.12, issue.1, pp.84-101, 1990.
DOI : 10.1145/77606.77610

A. Korman, General compact labeling schemes for dynamic trees, Distributed Computing, vol.51, issue.1, pp.179-193, 2007.
DOI : 10.1007/s00446-007-0035-z

A. Korman, Labeling Schemes for Vertex Connectivity, ACM Transactions on Algorithms, vol.6, issue.2, 2010.
DOI : 10.1007/978-3-540-73420-8_11

A. Korman, Improved compact routing schemes for dynamic trees, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, 2008.
DOI : 10.1145/1400751.1400777

A. Korman, Compact Routing Schemes for Dynamic Trees in the Fixed Port Model, Proc. 10th Int. Conf.on Distributed Computing and Networking, 2009.
DOI : 10.1093/comjnl/30.4.298

A. Korman and S. Kutten, Distributed verification of minimum spanning trees, Distributed Computing, vol.26, issue.1, pp.253-266, 2007.
DOI : 10.1007/s00446-007-0025-1

A. Korman, D. Peleg, and Y. Rodeh, Labeling schemes for dynamic tree networks, Theory of Computing Systems, pp.49-75, 2004.
DOI : 10.1007/3-540-45841-7_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.6080

A. Korman and D. Peleg, Labeling schemes for weighted dynamic trees, Information and Computation, vol.205, issue.12, pp.1721-1740, 2007.
DOI : 10.1016/j.ic.2007.08.004

A. Korman and D. Peleg, Dynamic routing schemes for graphs with low local density, ACM Transactions on Algorithms, vol.4, issue.4, 2008.
DOI : 10.1145/1383369.1383372

A. Korman and D. Peleg, Compact separator decompositions in dynamic trees and applications to labeling schemes, Distributed Computing, vol.26, issue.1, pp.141-161, 2008.
DOI : 10.1007/s00446-008-0061-5

Z. Lotker, B. Patt-shamir, and A. Rosén, Distributed approximate matching, Proc. 26th ACM Symp. on Principles of Distributed Computing (PODC), pp.167-174, 2007.
DOI : 10.1137/080714403
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.3676

D. Peleg, Distributed computing: A Locality-Sensitive Approach, SIAM, 2000.
DOI : 10.1137/1.9780898719772

D. Peleg, Informative labeling schemes for graphs, Proc. 25th Symp. on Mathematical Foundations of Computer Science, volume LNCS-1893, pp.579-588, 2000.

S. Kutten, Optimal fault-tolerant distributed construction of a spanning forest, Information Processing Letters, vol.27, issue.6, pp.299-307, 1988.
DOI : 10.1016/0020-0190(88)90217-7

M. S. Manasse, L. A. Mcgeoch, and D. D. Sleator, Competitive Algorithms for On-Line Problems, Proc. 20th Annual ACM Symposium on Theory of Computing (STOC), pp.322-333, 1988.

D. Peleg and E. Upfal, A trade-off between space and efficiency for routing tables, Journal of the ACM, vol.36, issue.3, pp.510-530, 1989.
DOI : 10.1145/65950.65953

R. E. Tarjan, Data Structures and Network Algorithms, SIAM, 1983.
DOI : 10.1137/1.9781611970265