{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:19Z","timestamp":1750307719504,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T00:00:00Z","timestamp":1240185600000},"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":[[2009,4,20]]},"DOI":"10.1145\/1526709.1526715","type":"proceedings-article","created":{"date-parts":[[2009,4,21]],"date-time":"2009-04-21T14:17:17Z","timestamp":1240323437000},"page":"31-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Fast dynamic reranking in large graphs"],"prefix":"10.1145","author":[{"given":"Purnamrita","family":"Sarkar","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Andrew W.","family":"Moore","sequence":"additional","affiliation":[{"name":"Google Inc., Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1451983.1451994"},{"key":"e_1_3_2_1_2_1","volume-title":"Reversible Markov Chains","author":"Aldous D.","year":"2001","unstructured":"D. Aldous and J. A. Fill . Reversible Markov Chains . 2001 . D. Aldous and J. A. Fill. Reversible Markov Chains. 2001."},{"key":"e_1_3_2_1_3_1","volume-title":"VLDB","author":"Balmin A.","year":"2004","unstructured":"A. Balmin , V. Hristidis , and Y. Papakonstantinou . ObjectRank: Authority-based keyword search in databases . In VLDB , 2004 . A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-based keyword search in databases. In VLDB, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/297805.297827"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242650"},{"key":"e_1_3_2_1_6_1","author":"Freund Y.","year":"2003","unstructured":"Y. Freund , R. Iyer , R. E. Schapire , and Y. Singer . An efficient boosting algorithm for combining preferences. J. Mach. Learn. Res. , 2003 . Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. J. Mach. Learn. Res., 2003.","journal-title":"An efficient boosting algorithm for combining preferences. J. Mach. Learn. Res."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.233"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. VLDB","author":"Gyongyi Z.","year":"2004","unstructured":"Z. Gyongyi , H. Garcia-- Molina , and J. Pedersen . Combating web spam with trustrank . In Proc. VLDB , 2004 . Z. Gyongyi, H. Garcia--Molina, and J. Pedersen. Combating web spam with trustrank. In Proc. VLDB, 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367552"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242730"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. SODA","author":"Koutis I.","year":"2007","unstructured":"I. Koutis and G. L. Miller . A linear work, o(n1=6) time, parallel algorithm for solving planar laplacians . In Proc. SODA , 2007 . I. Koutis and G. L. Miller. A linear work, o(n1=6) time, parallel algorithm for solving planar laplacians. In Proc. SODA, 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015780"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135794"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. UAI","author":"Sarkar P.","year":"2007","unstructured":"P. Sarkar and A. Moore . A tractable approach to finding closest truncated-commute-time neighbors in large graphs . In Proc. UAI , 2007 . P. Sarkar and A. Moore. A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In Proc. UAI, 2007."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390269"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763653.1763684"},{"key":"e_1_3_2_1_19_1","volume-title":"ICML","volume":"20","author":"Zhu X.","year":"2003","unstructured":"X. Zhu , Z. Ghahramani , and J. Lafferty . Semi-supervised learning using gaussian fields and harmonic functions . In ICML , volume 20 , 2003 . X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML, volume 20, 2003."}],"event":{"name":"WWW '09: The 18th International World Wide Web Conference","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","ACM Association for Computing Machinery"],"location":"Madrid Spain","acronym":"WWW '09"},"container-title":["Proceedings of the 18th international conference on World wide web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1526709.1526715","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1526709.1526715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:29Z","timestamp":1750253429000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1526709.1526715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,20]]},"references-count":18,"alternative-id":["10.1145\/1526709.1526715","10.1145\/1526709"],"URL":"https:\/\/doi.org\/10.1145\/1526709.1526715","relation":{},"subject":[],"published":{"date-parts":[[2009,4,20]]},"assertion":[{"value":"2009-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}