1. Aberer, K., Cudré-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-Grid: a self-organizing structured P2P system. SIGMOD Rec. 32(3), 29–33 (2003). doi:
http://doi.acm.org/10.1145/945721.945729
2. Abraham, I., Awerbuch, B., Azar, Y., Bartal, Y., Malkhi, D., Pavlov, E.: A generic scheme for building overlay networks in adversarial scenarios. In: IPDPS ’03: Proceedings of 17th International Symposium on Parallel and Distributed Processing, p. 40.2. IEEE Computer Society (2003)
3. Abraham, I., Malkhi, D., Manku, G.S.: Papillon: greedy routing in rings. In: DISC ’05: Proceedings of 19th International Conference on Distributed Computing. Lecture Notes in Computer Science, vol. 3724, pp. 514–515. Springer, Berlin (2005)
4. Arge, L., Eppstein, D., Goodrich, M.T.: Skip-webs: efficient distributed data structures for multi-dimensional data sets. In: PODC ’05: Proceedings of 24th Annual ACM Symposium on Principles of Distributed Computing, pp. 69–76. ACM, New York (2005). doi:
http://doi.acm.org/10.1145/1073814.1073827
5. Aspnes, J., Shah, G.: Skip graphs. In: SODA ’03: Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 384–393. Society for Industrial and Applied Mathematics (2003)