{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:53:35Z","timestamp":1773654815854,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,10,31]],"date-time":"2005-10-31T00:00:00Z","timestamp":1130716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,10,31]]},"DOI":"10.1145\/1099554.1099705","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"578-585","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Distributed PageRank computation based on iterative aggregation-disaggregation methods"],"prefix":"10.1145","author":[{"given":"Yangbo","family":"Zhu","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Shaozhi","family":"Ye","sequence":"additional","affiliation":[{"name":"University of California, Davis, CA"}]},{"given":"Xing","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2005,10,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013367.1013537"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.214137"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of Int. Workshop on Mathematical Computer Performance and Reliability","author":"Chatelin F.","year":"1983","unstructured":"F. Chatelin . Iterative aggregation\/disaggregation methods. In Proc. of Int. Workshop on Mathematical Computer Performance and Reliability , 1983 . F. Chatelin. Iterative aggregation\/disaggregation methods. In Proc. of Int. Workshop on Mathematical Computer Performance and Reliability, 1983."},{"key":"e_1_3_2_1_5_1","first-page":"59","volume-title":"Vol 76","author":"Courtois P.","year":"1986","unstructured":"P. Courtois and P. Semal . Block iterative algorithm for stochastic matrices. Linear Algebra and its Application , Vol 76 , pages 59 -- 70 , 1986 . P. Courtois and P. Semal. Block iterative algorithm for stochastic matrices. Linear Algebra and its Application, Vol 76, pages 59--70, 1986."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988714"},{"key":"e_1_3_2_1_7_1","volume-title":"Fast parallel pagerank: A linear system approach. Technical report","author":"Gleich D.","year":"2004","unstructured":"D. Gleich , L. Zhukov , and P. Berkhin . Fast parallel pagerank: A linear system approach. Technical report , Yahoo Corp ., 2004 . D. Gleich, L. Zhukov, and P. Berkhin. Fast parallel pagerank: A linear system approach. Technical report, Yahoo Corp., 2004."},{"key":"e_1_3_2_1_8_1","volume-title":"Matrix computations","author":"Golub G.","year":"1996","unstructured":"G. Golub and C. V. Loan . Matrix computations ( 3 rd ed.). Johns Hopkins Univ. Press , 1996 . G. Golub and C. V. Loan. Matrix computations (3rd ed.). Johns Hopkins Univ. Press, 1996.","edition":"3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479804439808"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of the 4th Copper Mountain Conf. on Iterative Methods","author":"Kafeety H.","year":"1992","unstructured":"H. Kafeety , C. Meyer , and W. Stewart . A general framework for iterative aggregation\/ disaggregation methods . In Proc. of the 4th Copper Mountain Conf. on Iterative Methods , 1992 . H. Kafeety, C. Meyer, and W. Stewart. A general framework for iterative aggregation\/ disaggregation methods. In Proc. of the 4th Copper Mountain Conf. on Iterative Methods, 1992."},{"key":"e_1_3_2_1_11_1","volume-title":"Stanford Univ.","author":"Kamvar S.","year":"2003","unstructured":"S. Kamvar , T. Haveliwala , and G. Golub . Adaptive methods for the computation of pagerank. Technical report , Stanford Univ. , 2003 . S. Kamvar, T. Haveliwala, and G. Golub. Adaptive methods for the computation of pagerank. Technical report, Stanford Univ., 2003."},{"key":"e_1_3_2_1_12_1","volume-title":"Stanford Univ.","author":"Kamvar S.","year":"2003","unstructured":"S. Kamvar , T. Haveliwala , C. Manning , and G. Golub . Exploiting the block structure of the web for computing pagerank. Technical report , Stanford Univ. , 2003 . S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Exploiting the block structure of the web for computing pagerank. Technical report, Stanford Univ., 2003."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775190"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0904037"},{"key":"e_1_3_2_1_15_1","volume-title":"Rank Correlation Methods. Edward Arnold","author":"Kendall M.","year":"1990","unstructured":"M. Kendall and J. Gibbons . Rank Correlation Methods. Edward Arnold , London , 5 edition, 1990 . M. Kendall and J. Gibbons. Rank Correlation Methods. Edward Arnold, London, 5 edition, 1990."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013367.1013491"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129091"},{"key":"e_1_3_2_1_19_1","volume-title":"Stanford Univ.","author":"Lee C.","year":"2003","unstructured":"C. Lee , G. Golub , and S. Zenios . A fast two-stage algorithm for computing pagerank and its extensions. Technical report , Stanford Univ. , 2003 . C. Lee, G. Golub, and S. Zenios. A fast two-stage algorithm for computing pagerank and its extensions. Technical report, Stanford Univ., 2003."},{"key":"e_1_3_2_1_20_1","volume-title":"How much information project. Technical report","author":"Lyman P.","year":"2003","unstructured":"P. Lyman , H. Varian , J. Dunn , A. Strygin , and K. Swearingen . How much information project. Technical report , Univ. of California , Berkeley , 2003 . P. Lyman, H. Varian, J. Dunn, A. Strygin, and K. Swearingen. How much information project. Technical report, Univ. of California, Berkeley, 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645740.666754"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(02)00333-6"},{"key":"e_1_3_2_1_23_1","volume-title":"A note on local and global convergence analysis of iterative aggregation-disaggregation methods. Submitted to Linear Algebra and Applications","author":"Marek I.","year":"2005","unstructured":"I. Marek and I. Pultarova . A note on local and global convergence analysis of iterative aggregation-disaggregation methods. Submitted to Linear Algebra and Applications , 2005 . I. Marek and I. Pultarova. A note on local and global convergence analysis of iterative aggregation-disaggregation methods. Submitted to Linear Algebra and Applications, 2005."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1031050"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01397879"},{"key":"e_1_3_2_1_26_1","volume-title":"Stanford Univ.","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The pagerank citation ranking: Bringing order to the web. Technical report , Stanford Univ. , 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Univ., 1998."},{"key":"e_1_3_2_1_27_1","first-page":"201","article-title":"A two stage iteration for solving nearly completely decomposable markov chains. Recent Advances in Iterative Methods","volume":"60","author":"Stewart G.","year":"1993","unstructured":"G. Stewart , W. Stewart , and D. McAllister . A two stage iteration for solving nearly completely decomposable markov chains. Recent Advances in Iterative Methods , IMA Vol. Math. Appl. 60 : 201 -- 216 , 1993 . G. Stewart, W. Stewart, and D. McAllister. A two stage iteration for solving nearly completely decomposable markov chains. Recent Advances in Iterative Methods, IMA Vol. Math. Appl. 60:201--216, 1993.","journal-title":"IMA"},{"key":"e_1_3_2_1_31_1","first-page":"420","volume-title":"Proc. of VLDB'04 Conf.","author":"Wang Y.","year":"2004","unstructured":"Y. Wang and D. DeWitt . Computing pagerank in a distributed internet search engine system . In Proc. of VLDB'04 Conf. , pages 420 -- 431 , 2004 . Y. Wang and D. DeWitt. Computing pagerank in a distributed internet search engine system. In Proc. of VLDB'04 Conf., pages 420--431, 2004."}],"event":{"name":"CIKM05: Conference on Information and Knowledge Management","location":"Bremen Germany","acronym":"CIKM05","sponsor":["ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 14th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1099554.1099705","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1099554.1099705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:44Z","timestamp":1750263524000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1099554.1099705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,31]]},"references-count":28,"alternative-id":["10.1145\/1099554.1099705","10.1145\/1099554"],"URL":"https:\/\/doi.org\/10.1145\/1099554.1099705","relation":{},"subject":[],"published":{"date-parts":[[2005,10,31]]},"assertion":[{"value":"2005-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}