{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:31:01Z","timestamp":1760707861610,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744658"},{"type":"electronic","value":"9783540744665"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74466-5_55","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T14:54:32Z","timestamp":1188226472000},"page":"514-525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Asynchronous Distributed Power Iteration with Gossip-Based Normalization"],"prefix":"10.1007","author":[{"given":"M\u00e1rk","family":"Jelasity","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffrey","family":"Canright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenth","family":"Eng\u00f8-Monsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)"},{"key":"55_CR2","unstructured":"Sankaralingam, K., Sethumadhavan, S., Browne, J.C.: Distributed pagerank for p2p systems. In: Proc. HPDC-12, pp. 58\u201369 (2003)"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Shi, S., Yu, J., Yang, G., Wang, D.: Distributed page ranking in structured p2p networks. In: Proc. ICPP 2003, pp. 179\u2013186 (October 2003)","DOI":"10.1109\/ICPP.2003.1240579"},{"key":"55_CR4","unstructured":"Parreira, J.X., Donato, D., Michel, S., Weikum, G.: Efficient and decentralized PageRank approximation in a peer-to-peer web search network. In: Proc. VLDB, pp. 415\u2013426 (2006)"},{"key":"55_CR5","volume-title":"Proc. WWW","author":"S.D. Kamvar","year":"2003","unstructured":"Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: Proc. WWW, ACM Press, New York (2003)"},{"key":"55_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45071-8_50","volume-title":"Computing and Combinatorics","author":"Y. Koren","year":"2003","unstructured":"Koren, Y.: On spectral graph drawing. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 496\u2013508. Springer, Heidelberg (2003)"},{"key":"55_CR7","volume-title":"Proc. SIGCOMM 2004","author":"F. Dabek","year":"2004","unstructured":"Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: A decentralized network coordinate system. In: Proc. SIGCOMM 2004, ACM Press, New York (2004)"},{"issue":"1","key":"55_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/4904.4801","volume":"33","author":"B. Lubachevsky","year":"1986","unstructured":"Lubachevsky, B., Mitra, D.: A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit radius. J. of the ACM\u00a033(1), 130\u2013150 (1986)","journal-title":"J. of the ACM"},{"key":"55_CR9","unstructured":"Burgess, M., Canright, G., Eng\u00f8-Monsen, K.: Importance-ranking functions derived from the eigenvectors of directed graphs. Technical Report DELIS-TR-0325, DELIS Project (2006)"},{"issue":"3","key":"55_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M. Jelasity","year":"2005","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Transactions on Computer Systems\u00a023(3), 219\u2013252 (2005)","journal-title":"ACM Transactions on Computer Systems"},{"key":"55_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-540-30229-2_5","volume-title":"Middleware 2004","author":"M. Jelasity","year":"2004","unstructured":"Jelasity, M., Guerraoui, R., Kermarrec, A.M., van Steen, M.: The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. In: Jacobsen, H.A. (ed.) Middleware 2004. LNCS, vol.\u00a03231, pp. 79\u201398. Springer, Heidelberg (2004)"},{"key":"55_CR12","unstructured":"PeerSim, http:\/\/peersim.sourceforge.net\/"},{"key":"55_CR13","first-page":"482","volume-title":"Proc. FOCS 2003","author":"D. Kempe","year":"2003","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. FOCS 2003, pp. 482\u2013491. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"1","key":"55_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics\u00a074(1), 47\u201397 (2002)","journal-title":"Reviews of Modern Physics"},{"key":"55_CR15","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2019small-world\u2019 networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"55_CR16","doi-asserted-by":"crossref","unstructured":"Bai, Z., Demmel, J., Dongarra, J., Ruhe, A., van der Vorst, H. (eds.): Templates for the Solution of Algebraic Eigenvalue Problems: a Practical Guide, SIAM, Philadelphia (2000)","DOI":"10.1137\/1.9780898719581"},{"key":"55_CR17","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R. Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Diameter of the world wide web. Nature\u00a0401, 130\u2013131 (1999)","journal-title":"Nature"},{"issue":"1-2","key":"55_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0377-0427(00)00409-X","volume":"123","author":"A. Frommer","year":"2000","unstructured":"Frommer, A., Szyld, D.B.: On asynchronous iterations. Journal of Computational and Applied Mathematics\u00a0123(1-2), 201\u2013216 (2000)","journal-title":"Journal of Computational and Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2007 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74466-5_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:37:39Z","timestamp":1737394659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74466-5_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540744658","9783540744665"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74466-5_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}