{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T16:38:39Z","timestamp":1783183119861,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,2,8]],"date-time":"2017-02-08T00:00:00Z","timestamp":1486512000000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA9550-12-1-0411"],"award-info":[{"award-number":["FA9550-12-1-0411"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["1447697"],"award-info":[{"award-number":["1447697"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,2,8]]},"DOI":"10.1145\/2835776.2835823","type":"proceedings-article","created":{"date-parts":[[2016,2,4]],"date-time":"2016-02-04T11:26:02Z","timestamp":1454585162000},"page":"163-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":112,"title":["Personalized PageRank Estimation and Search"],"prefix":"10.1145","author":[{"given":"Peter","family":"Lofgren","sequence":"first","affiliation":[{"name":"Stanford, Stanford University, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siddhartha","family":"Banerjee","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashish","family":"Goel","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,2,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777891"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/050643799"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/1929861.1929864"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187891"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367618"},{"key":"e_1_3_2_1_6_1","first-page":"1423","volume-title":"Advances in Neural Information Processing Systems","author":"Banerjee S.","year":"2015","unstructured":"S. Banerjee and P. Lofgren. Fast bidirectional probability estimation in markov models. In Advances in Neural Information Processing Systems, pages 1423--1431, 2015."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129116"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242650"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129104"},{"key":"e_1_3_2_1_10_1","volume-title":"PageRank beyond the web. arXiv, cs.SI:1407.5107","author":"Gleich D. F.","year":"2014","unstructured":"D. F. Gleich. PageRank beyond the web. arXiv, cs.SI:1407.5107, 2014. Accepted for publication in SIAM Review."},{"key":"e_1_3_2_1_11_1","volume-title":"preparation: Cross partitioning: Realtime computation of cosine similarity, personalized pagerank, and more. Technical report","author":"Goel A.","year":"2015","unstructured":"A. Goel, P. Gupta, and P. Lofgren. In preparation: Cross partitioning: Realtime computation of cosine similarity, personalized pagerank, and more. Technical report, Stanford University, 2015. available at http:\/\/www.stanford.edu\/plofgren\/."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488433"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511513"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775191"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/270146"},{"key":"e_1_3_2_1_16_1","unstructured":"Laboratory for web algorithmics. http:\/\/law.di.unimi.it\/datasets.php. Accessed: 2014-02--11."},{"key":"e_1_3_2_1_17_1","unstructured":"P. Lofgren. Efficient Algorithms for Personalized PageRank. PhD thesis Stanford University 2015. available at http:\/\/cs.stanford.edu\/people\/plofgren\/."},{"key":"e_1_3_2_1_18_1","volume-title":"Personalized pagerank to a target node. arXiv preprint arXiv:1304.4658","author":"Lofgren P.","year":"2013","unstructured":"P. Lofgren and A. Goel. Personalized pagerank to a target node. arXiv preprint arXiv:1304.4658, 2013."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623745"},{"key":"e_1_3_2_1_20_1","volume-title":"The pagerank citation ranking: bringing order to the web","author":"Page L.","year":"1999","unstructured":"L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: bringing order to the web. 1999."},{"key":"e_1_3_2_1_21_1","first-page":"2321","volume-title":"Advances in Neural Information Processing Systems","author":"Shrivastava A.","year":"2014","unstructured":"A. Shrivastava and P. Li. Asymmetric lsh (alsh) for sublinear time maximum inner product search (mips). In Advances in Neural Information Processing Systems, pages 2321--2329, 2014."},{"key":"e_1_3_2_1_22_1","volume-title":"Improved asymmetric locality sensitive hashing (alsh) for maximum inner product search (mips). stat, 1050:13","author":"Shrivastava A.","year":"2014","unstructured":"A. Shrivastava and P. Li. Improved asymmetric locality sensitive hashing (alsh) for maximum inner product search (mips). stat, 1050:13, 2014."},{"key":"e_1_3_2_1_23_1","unstructured":"Stanford network analysis platform (snap). http:\/\/http:\/\/snap.stanford.edu\/. Accessed: 2014-02--11."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321520"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355749"}],"event":{"name":"WSDM 2016: Ninth ACM International Conference on Web Search and Data Mining","location":"San Francisco California USA","acronym":"WSDM 2016","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the Ninth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2835776.2835823","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2835776.2835823","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2835776.2835823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:41:13Z","timestamp":1763458873000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2835776.2835823"}},"subtitle":["A Bidirectional Approach"],"short-title":[],"issued":{"date-parts":[[2016,2,8]]},"references-count":25,"alternative-id":["10.1145\/2835776.2835823","10.1145\/2835776"],"URL":"https:\/\/doi.org\/10.1145\/2835776.2835823","relation":{},"subject":[],"published":{"date-parts":[[2016,2,8]]},"assertion":[{"value":"2016-02-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}