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., 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)
3. 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)
4. Aspnes, J., Wieder, U.: The expansion and mixing time of skip graphs with applications. In: SPAA ’05: Proceedings of 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 126–134. ACM, New York (2005).doi:
http://doi.acm.org/10.1145/1073970.1073989
5. Datta, A., Girdzijauskas, S., Aberer, K.: On de bruijn routing in distributed hash tables: There and back again. In: IEEE P2P ’04: Proceedings of 4th International Conference on Peer-to-Peer Computing, pp. 159–166. IEEE Computer Society (2004).doi:
http://dx.doi.org/10.1109/P2P.2004.29