{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:12Z","timestamp":1725600312640},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229343"},{"type":"electronic","value":"9783642229350"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22935-0_23","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T05:20:39Z","timestamp":1313126439000},"page":"266-276","source":"Crossref","is-referenced-by-count":0,"title":["Multiplicative Approximations of Random Walk Transition Probabilities"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kapralov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rina","family":"Panigrahy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","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 J. Numer. Anal.\u00a045 (2007)","DOI":"10.1137\/050643799"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Goel, A., Chowdhury, A.: Fast incremental and personalized pagerank. In: PVLDB (2010)","DOI":"10.14778\/1929861.1929864"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"S. Baswana","year":"2003","unstructured":"Baswana, S., Sen, S.: A simple linear time algorithm for computing (2k\u2009\u2212\u20091)-spanner of o(n 1\u2009+\u20091\/k ) size for weighted graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, Springer, Heidelberg (2003)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Berkhin, P.: A survey on pagerank computing. Internet Mathematics\u00a02 (2005)","DOI":"10.1080\/15427951.2005.10129098"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Clarkson, K., Woodruff, D.: Numerical linear algebra in the streaming model. In: STOC (2009)","DOI":"10.1145\/1536414.1536445"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539794261295","volume":"28","author":"D. Cohen","year":"1999","unstructured":"Cohen, D.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing\u00a028, 210\u2013236 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Dor, D., Halperin, U., Zwick, S.: All pairs almost shortest paths. SIAM Journal on Computing 29 (2000)","DOI":"10.1137\/S0097539797327908"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Drineas, P., Kannan, R.: Fast monte carlo algorithms for approximate matrix multiplication. In: FOCS (2001)","DOI":"10.1109\/SFCS.2001.959921"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Drineas, P., Kannan, R., Mahoney, M.: Fast monte carlo algorithms for matrices i: Approximating matrix multiplication. SIAM J. Computing\u00a036 (2006)","DOI":"10.1137\/S0097539704442684"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Elkin, M.L., Peleg, D.: (1\u2009+\u2009\u03b5, \u03b2)-spanner constructions for general graphs. In: STOC (2001)","DOI":"10.1145\/380752.380797"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Frieze, A., Kannan, R., Vempala, S.: Fast monte-carlo algorithms for finding low-rank approximations. JACM (2004)","DOI":"10.1145\/1039488.1039494"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW (2003)","DOI":"10.1145\/775152.775191"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Extrapolation methods for accelerating pagerank computations. In: WWW (2003)","DOI":"10.1145\/775152.775190"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Mathematics\u00a01 (2004)","DOI":"10.1080\/15427951.2004.10129091"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Magen, A., Zouzias, A.: Low rank matrix-valued chernoff bounds and approximate matrix multiplication. In: SODA (2011)","DOI":"10.1137\/1.9781611973082.109"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Nguyen, N.H., Do, T.T., Tran, T.D.: A fast and efficient algorithm for low-rank approximation of a matrix. In: STOC (2009)","DOI":"10.1145\/1536414.1536446"},{"key":"23_CR17","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Patrascu, M., Roditty, L.: Distance oracles beyond the thorup-zwick bound. In: FOCS (2010)","DOI":"10.1109\/FOCS.2010.83"},{"key":"23_CR19","series-title":"CRM Monograph Series","doi-asserted-by":"crossref","DOI":"10.1090\/crmm\/023","volume-title":"Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems","author":"J. Rutten","year":"2004","unstructured":"Rutten, J., Kwiatkowska, M., Norman, G., Parker, D.: Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. In: Panangaden, P., van Breugel, F. (eds.) Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. CRM Monograph Series, vol.\u00a023, American Mathematical Society, Providence (2004)"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Sarlos, T.: Improved approximation algorithms for large matrices via random projections. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.37"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s, T., Bencz\u00far, A.A., Csalog\u00e1ny, K., Fogaras, D., R\u00e1cz, B.: To randomize or not to randomize: space optimal summaries for hyperlink analysis. In: WWW (2006)","DOI":"10.1145\/1135777.1135823"},{"key":"23_CR22","unstructured":"Sarma, A.D., Gollapudi, S., Panigrahy, R.: Estimating pagerank on graph streams. In: PODS (2008)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. In: STOC (2001)","DOI":"10.1145\/380752.380798"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: SODA (2006)","DOI":"10.1145\/1109557.1109645"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Woodruff, D.: Lower bounds for additive spanners, emulators and more. In: FOCS (2006)","DOI":"10.1109\/FOCS.2006.45"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22935-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T21:03:12Z","timestamp":1560459792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22935-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229343","9783642229350"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22935-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}