Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Angluin, D., Aspnes, J., Chen, J., Wu, Y., Yin, Y.: Fast construction of overlay networks. In: SPAA 2005. Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, NV, USA (July 2005)
2. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
3. Aspnes, J., Shah, G.: Skip Graphs. In: SODA. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, pp. 384–393 (January 2003) (submitted to a special issue of Journal of Algorithms dedicated to select papers of SODA 2003)
4. Onus, M., Richa, A., Scheideler, C.: Linearization: Locally self-stabilizing sorting in graphs. In: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) ( to appear, 2007)
5. Lecture Notes in Artificial Intelligence;M. Jelasity,2006
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献