{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:43:14Z","timestamp":1725651794677},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642305405"},{"type":"electronic","value":"9783642305412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30541-2_4","type":"book-chapter","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T15:48:16Z","timestamp":1340034496000},"page":"41-53","source":"Crossref","is-referenced-by-count":20,"title":["A Sublinear Time Algorithm for PageRank Computations"],"prefix":"10.1007","author":[{"given":"Christian","family":"Borgs","sequence":"first","affiliation":[]},{"given":"Michael","family":"Brautbar","sequence":"additional","affiliation":[]},{"given":"Jennifer","family":"Chayes","sequence":"additional","affiliation":[]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/15427951.2008.10129302","volume":"5","author":"R. Andersen","year":"2008","unstructured":"Andersen, R., Borgs, C., Chayes, J.T., Hopcroft, J.E., Mirrokni, V.S., Teng, S.-H.: Local computation of pagerank contributions. Internet Mathematics\u00a05(1), 23\u201345 (2008)","journal-title":"Internet Mathematics"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F.R.K., Lang, K.J.: Local graph partitioning using pagerank vectors. In: FOCS, pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte carlo methods in pagerank computation: When one iteration is sufficient. SIAM Journal on Numerical Analysis\u00a045 (2007)","DOI":"10.1137\/050643799"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Berkhin, P.: Survey: A survey on pagerank computing. Internet Mathematics\u00a02(1) (2005)","DOI":"10.1080\/15427951.2005.10129098"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Berkhin, P.: Bookmark-coloring approach to personalized pagerank computing. Internet Mathematics\u00a03(1) (2006)","DOI":"10.1080\/15427951.2006.10129116"},{"key":"4_CR6","unstructured":"Brautbar, M., Kearns, M.: Local algorithms for finding interesting individuals in large networks. In: ICS, pp. 188\u2013199 (2010)"},{"issue":"1-7","key":"4_CR7","first-page":"107","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks\u00a030(1-7), 107\u2013117 (1998)","journal-title":"Computer Networks"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"T.H. Haveliwala","year":"2003","unstructured":"Haveliwala, T.H.: Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. Trans. Knowl. Data Eng.\u00a015(4), 784\u2013796 (2003)","journal-title":"Trans. Knowl. Data Eng."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW, pp. 271\u2013279 (2003)","DOI":"10.1145\/775189.775191"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Spectral methods for matrices and tensors. In: STOC, pp. 1\u201312 (2010)","DOI":"10.1145\/1806689.1806691"},{"key":"4_CR11","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Stanford University (1998)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1137\/100791075","volume":"25","author":"R. Rubinfeld","year":"2011","unstructured":"Rubinfeld, R., Shapira, A.: Sublinear time algorithms. SIAM Journal on Discrete Math.\u00a025, 1562\u20131588 (2011)","journal-title":"SIAM Journal on Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30541-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:44:08Z","timestamp":1620128648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30541-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642305405","9783642305412"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30541-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}