-
1
-
-
70449117853
-
Sort me if you can: How to sort dynamic data
-
A. Anagnostopoulos, R. Kumar, M. Mahdian, and E. Upfal. Sort me if you can: How to sort dynamic data. In ICALP, pages 339-350, 2009.
-
(2009)
ICALP
, pp. 339-350
-
-
Anagnostopoulos, A.1
Kumar, R.2
Mahdian, M.3
Upfal, E.4
-
2
-
-
84863416398
-
Algorithms on evolving graphs
-
A. Anagnostopoulos, R. Kumar, M. Mahdian, and E. Upfal. Algorithms on evolving graphs. In ITCS, pages 149-160, 2012.
-
ITCS
, vol.2012
, pp. 149-160
-
-
Anagnostopoulos, A.1
Kumar, R.2
Mahdian, M.3
Upfal, E.4
-
3
-
-
38149027373
-
Monte Carlo methods in Pagerank computation: When one iteration is sufficient
-
K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova. Monte Carlo methods in Pagerank computation: When one iteration is sufficient. SIAM J. Numer. Anal., 45(2):890-904, 2007.
-
(2007)
SIAM J. Numer. Anal.
, vol.45
, Issue.2
, pp. 890-904
-
-
Avrachenkov, K.1
Litvak, N.2
Nemirovsky, D.3
Osipova, N.4
-
4
-
-
79959919123
-
Fast personalized PageRank on MapReduce
-
B. Bahmani, K. Chakrabarti, and D. Xin. Fast personalized PageRank on MapReduce. In SIGMOD, pages 973-984, 2011.
-
(2011)
SIGMOD
, pp. 973-984
-
-
Bahmani, B.1
Chakrabarti, K.2
Xin, D.3
-
5
-
-
79960170113
-
Fast incremental and personalized PageRank
-
B. Bahmani, A. Chowdhury, and A. Goel. Fast incremental and personalized PageRank. PVLDB, 4:173-184, 2010.
-
(2010)
PVLDB
, vol.4
, pp. 173-184
-
-
Bahmani, B.1
Chowdhury, A.2
Goel, A.3
-
6
-
-
77954235092
-
Survey: A survey on PageRank computing
-
P. Berkhin. Survey: A survey on PageRank computing. Internet Mathematics, 2(1):73-120, 2005.
-
(2005)
Internet Mathematics
, vol.2
, Issue.1
, pp. 73-120
-
-
Berkhin, P.1
-
7
-
-
18744409364
-
Local methods for estimating PageRank values
-
Y.-Y. Chen, Q. Gan, and T. Suel. Local methods for estimating PageRank values. In CIKM, pages 381-389, 2004.
-
(2004)
CIKM
, pp. 381-389
-
-
Chen, Y.-Y.1
Gan, Q.2
Suel, T.3
-
8
-
-
84906214435
-
Link evolution: Analysis and algorithms
-
S. Chien, C. Dwork, S. Kumar, D. Simon, and D. Sivakumar. Link evolution: Analysis and algorithms. Internet Mathematics, 1(3):277-304, 2003.
-
(2003)
Internet Mathematics
, vol.1
, Issue.3
, pp. 277-304
-
-
Chien, S.1
Dwork, C.2
Kumar, S.3
Simon, D.4
Sivakumar, D.5
-
10
-
-
35348902039
-
The discoverability of the web
-
A. Dasgupta, A. Ghosh, R. Kumar, C. Olston, S. Pandey, and A. Tomkins. The discoverability of the web. In WWW, pages 421-430, 2007.
-
(2007)
WWW
, pp. 421-430
-
-
Dasgupta, A.1
Ghosh, A.2
Kumar, R.3
Olston, C.4
Pandey, S.5
Tomkins, A.6
-
11
-
-
33749577594
-
Estimating the global PageRank of web communities
-
J. V. Davis and I. S. Dhillon. Estimating the global PageRank of web communities. In KDD, pages 116-125, 2006.
-
(2006)
KDD
, pp. 116-125
-
-
Davis, J.V.1
Dhillon, I.S.2
-
12
-
-
21444431910
-
Dynamic graph algorithms
-
M. J. Atallah, editor, CRC Press
-
D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In M. J. Atallah, editor, Algorithms and Theoretical Computing Handbook. CRC Press, 1999.
-
(1999)
Algorithms and Theoretical Computing Handbook
-
-
Eppstein, D.1
Galil, Z.2
Italiano, G.F.3
-
14
-
-
17444376867
-
-
Technical report, Stanford University
-
S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Exploiting the block structure of the web for computing PageRank. Technical report, Stanford University, 2003.
-
(2003)
Exploiting the Block Structure of the Web for Computing PageRank
-
-
Kamvar, S.1
Haveliwala, T.2
Manning, C.3
Golub, G.4
-
15
-
-
84880487682
-
Extrapolation methods for accelerating PageRank computations
-
S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub. Extrapolation methods for accelerating PageRank computations. In WWW, pages 261-270, 2003.
-
(2003)
WWW
, pp. 261-270
-
-
Kamvar, S.D.1
Haveliwala, T.H.2
Manning, C.D.3
Golub, G.H.4
-
18
-
-
85000192048
-
-
Updating PageRank with iterative aggregation. posters
-
A. N. Langville and C. D. Meyer. Updating PageRank with iterative aggregation. In WWW (posters), pages 392-393, 2004.
-
(2004)
WWW
, pp. 392-393
-
-
Langville, A.N.1
Meyer, C.D.2
-
19
-
-
33750184660
-
Updating Markov Chains with an eye on Google's PageRank
-
A. N. Langville and C. D. Meyer. Updating Markov Chains with an eye on Google's PageRank. SIAM J. Matrix Anal. Appl., 27(4):968-987, 2006.
-
(2006)
SIAM J. Matrix Anal. Appl.
, vol.27
, Issue.4
, pp. 968-987
-
-
Langville, A.N.1
Meyer, C.D.2
-
20
-
-
34250684611
-
A uniform approach to accelerated PageRank computation
-
F. McSherry. A uniform approach to accelerated PageRank computation. In WWW, pages 575-582, 2005.
-
(2005)
WWW
, pp. 575-582
-
-
McSherry, F.1
-
22
-
-
57349141405
-
Recrawl scheduling based on information longevity
-
C. Olston and S. Pandey. Recrawl scheduling based on information longevity. In WWW, pages 437-446, 2008.
-
(2008)
WWW
, pp. 437-446
-
-
Olston, C.1
Pandey, S.2
-
23
-
-
0003780986
-
-
Technical report, Stanford InfoLab
-
L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab, 1999.
-
(1999)
The PageRank Citation Ranking: Bringing Order to the Web
-
-
Page, L.1
Brin, S.2
Motwani, R.3
Winograd, T.4
-
24
-
-
33745753308
-
User-centric web crawling
-
S. Pandey and C. Olston. User-centric web crawling. In WWW, pages 401-411, 2005.
-
(2005)
WWW
, pp. 401-411
-
-
Pandey, S.1
Olston, C.2
-
25
-
-
42549138928
-
Crawl ordering by search impact
-
S. Pandey and C. Olston. Crawl ordering by search impact. In WSDM, pages 3-14, 2008.
-
(2008)
WSDM
, pp. 3-14
-
-
Pandey, S.1
Olston, C.2
-
26
-
-
77249143284
-
Property testing: A learning theory perspective
-
D. Ron. Property testing: A learning theory perspective. Found. Trends Mach. Learn., 1:307-402, 2008.
-
(2008)
Found. Trends Mach. Learn.
, vol.1
, pp. 307-402
-
-
Ron, D.1
-
27
-
-
77249103616
-
Algorithmic and analysis techniques in property testing
-
D. Ron. Algorithmic and analysis techniques in property testing. Found. Trends Theor. Comput. Sci., 5:73-205, 2010.
-
(2010)
Found. Trends Theor. Comput. Sci.
, vol.5
, pp. 73-205
-
-
Ron, D.1
-
28
-
-
79951738724
-
Scalable proximity estimation and link prediction in online social networks
-
H. H. Song, T. W. Cho, V. Dave, Y. Zhang, and L. Qiu. Scalable proximity estimation and link prediction in online social networks. In IMC, pages 322-335, 2009.
-
(2009)
IMC
, pp. 322-335
-
-
Song, H.H.1
Cho, T.W.2
Dave, V.3
Zhang, Y.4
Qiu, L.5
-
29
-
-
52649167294
-
Proximity tracking on time-evolving bipartite graphs
-
H. Tong, S. Papadimitriou, P. S. Yu, and C. Faloutsos. Proximity tracking on time-evolving bipartite graphs. In SDM, pages 704-715, 2008.
-
(2008)
SDM
, pp. 704-715
-
-
Tong, H.1
Papadimitriou, S.2
Yu, P.S.3
Faloutsos, C.4
-
30
-
-
77953055403
-
Optimal crawling strategies for web search engines
-
J. L. Wolf, M. S. Squillante, P. S. Yu, J. Sethuraman, and L. Ozsen. Optimal crawling strategies for web search engines. In WWW, pages 136-147, 2002.
-
(2002)
WWW
, pp. 136-147
-
-
Wolf, J.L.1
Squillante, M.S.2
Yu, P.S.3
Sethuraman, J.4
Ozsen, L.5
|