{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:38:05Z","timestamp":1725507485877},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770954"},{"type":"electronic","value":"9783540770961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77096-1_21","type":"book-chapter","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T11:44:46Z","timestamp":1207914286000},"page":"286-300","source":"Crossref","is-referenced-by-count":8,"title":["O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1"],"prefix":"10.1007","author":[{"given":"James","family":"Aspnes","sequence":"first","affiliation":[]},{"given":"Yinghua","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1073970.1073991"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"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\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"21_CR3","unstructured":"Aspnes, J., Shah, G.: Skip Graphs. In: SODA. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, pp. 384\u2013393 (January 2003) (submitted to a special issue of Journal of Algorithms dedicated to select papers of SODA 2003)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1137\/1.9781611972870.10"},{"key":"21_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11734697_1","volume-title":"Engineering Self-Organising Systems","author":"M. Jelasity","year":"2006","unstructured":"Jelasity, M., Babaoglu, O.: T-Man: Gossip-based overlay topology management. In: Brueckner, S.A., Serugendo, G.D.M., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS (LNAI), vol.\u00a03910, pp. 1\u201315. Springer, Heidelberg (2006)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: The bootstrapping service. In: Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS WORKSHOPS): International Workshop on Dynamic Distributed Systems (IWDDS) (2006)","DOI":"10.1109\/ICDCSW.2006.105"},{"key":"21_CR7","first-page":"87","volume-title":"P2P 2005","author":"A. Montresor","year":"2005","unstructured":"Montresor, A., Jelasity, M., Babaoglu, O.: Chord on demand. In: P2P 2005. Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing, pp. 87\u201394. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/301308.301362","volume-title":"Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing","author":"M. Harchol-Balter","year":"1999","unstructured":"Harchol-Balter, M., Leighton, T., Lewin, D.: Resource discovery in distributed networks. In: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pp. 229\u2013237. ACM Press, New York (1999)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/378580.378592","volume-title":"Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures","author":"S. Kutten","year":"2001","unstructured":"Kutten, S., Peleg, D., Vishkin, U.: Deterministic resource discovery in distributed networks. In: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pp. 77\u201383. ACM Press, New York (2001)"},{"key":"21_CR10","unstructured":"Law, C., Siu, K.Y.: An O(logn) randomized resource discovery algorithm. In: Brief Announcements of the 14th International Symposium on Distributed Computing, Technical University of Madrid, Technical Report FIM\/110.1\/DLSIIS\/, pp. 5\u20138. (October 2000)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Kutten, S., Peleg, D.: Asynchronous resource discovery in peer to peer networks. In: SRDS 2002. 21st IEEE Symposium on Reliable Distributed Systems October 13\u201316, 2002, pp. 224\u2013231 (2002)","DOI":"10.1109\/RELDIS.2002.1180191"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/872035.872055","volume-title":"Proceedings of the twenty-second annual symposium on Principles of distributed computing","author":"I. Abraham","year":"2003","unstructured":"Abraham, I., Dolev, D.: Asynchronous resource discovery. In: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pp. 143\u2013150. ACM Press, New York (2003)"},{"issue":"3","key":"21_CR13","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/18.382023","volume":"41","author":"I. Cidon","year":"1995","unstructured":"Cidon, I., Gopal, I., Kutten, S.: New models and algorithms for future networks. IEEE Transactions on Information Theory 41(3), 769\u2013780 (1995)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1145\/226643.226670","volume":"43","author":"M.T. Goodrich","year":"1996","unstructured":"Goodrich, M.T., Kosaraju, S.R.: Sorting on a parallel pointer machine with applications to set expression evaluation. J. ACM\u00a043(2), 331\u2013361 (1996)","journal-title":"J. ACM"},{"issue":"4","key":"21_CR15","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. J. ACM\u00a032(4), 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/SFCS.1988.21938","volume-title":"29th Annual Symposium on Foundations of Computer Science","author":"B. Awerbuch","year":"1988","unstructured":"Awerbuch, B., Sipser, M.: Dynamic networks are as fast as static networks (preliminary version). In: 29th Annual Symposium on Foundations of Computer Science, 24-26 October 1988, White Plains, New York, USA, pp. 206\u2013220. (1988)"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/103418.103443","volume-title":"STOC 1991","author":"R.M. Karp","year":"1991","unstructured":"Karp, R.M.: Probabilistic recurrence relations. In: STOC 1991. Proceedings of the twenty-third annual ACM symposium on Theory of computing, pp. 190\u2013197. ACM Press, New York (1991)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77096-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:08Z","timestamp":1619521208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77096-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770954","9783540770961"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77096-1_21","relation":{},"subject":[]}}