L. Arge, D. Eppstein, and M. T. Goodrich, Skip-webs, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05, pp.69-76, 2005.
DOI : 10.1145/1073814.1073827

J. Aspnes and G. Shah, Skip graphs, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp.384-393, 2003.
DOI : 10.1145/1290672.1290674

J. Aspnes and G. Shah, Skip graphs, ACM Transactions on Algorithms, vol.3, issue.4, p.37, 2007.
DOI : 10.1145/1290672.1290674

J. Aspnes and U. Wieder, The expansion and mixing time of skip graphs with applications, SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, pp.126-134, 2005.
DOI : 10.1007/s00446-008-0071-3

O. Beaumont, N. Bonichon, P. Duchon, and H. Larcheveque, Distributed Approximation Algorithm for Resource Clustering, Proceedings of SIROCCO'08, pp.61-73, 2008.
DOI : 10.1007/978-3-540-69355-0_7
URL : https://hal.archives-ouvertes.fr/hal-00396449

L. Devroye, A Limit Theory for Random Skip Lists, The Annals of Applied Probability, vol.2, issue.3, pp.597-609, 1992.
DOI : 10.1214/aoap/1177005651

T. Michael, M. J. Goodrich, J. Z. Nelson, and . Sun, The rainbow skip graph: a fault-tolerant constant-degree distributed data structure, SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp.384-393, 2006.

J. I. Munro, T. Papadakis, and R. Sedgewick, Deterministic skip lists, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, pp.367-375, 1992.

W. Pugh, Skip Lists: A Probabilistic Alternative to Balanced Trees, Communications of the ACM, vol.33, issue.6, 1990.