Luca Pretto
Luca Pretto
Verified email at dei.unipd.it
Title
Cited by
Cited by
Year
A theoretical analysis of Google’s PageRank
L Pretto
International Symposium on String Processing and Information Retrieval, 131-144, 2002
582002
A theoretical study of a generalized version of Kleinberg’s HITS algorithm
M Agosti, L Pretto
Information Retrieval 8 (2), 219-243, 2005
232005
Local computation of PageRank: the ranking side
M Bressan, L Pretto
Proceedings of the 20th ACM international conference on Information and …, 2011
182011
The power of local information in pagerank
M Bressan, E Peserico, L Pretto
Proceedings of the 22nd International Conference on World Wide Web, 179-180, 2013
122013
PageRank: When order changes
M Melucci, L Pretto
European Conference on Information Retrieval, 581-588, 2007
112007
Score and rank convergence of HITS
E Peserico, L Pretto
Proceedings of the 32nd international ACM SIGIR conference on Research and …, 2009
92009
Approximating pagerank locally with sublinear query complexity
M Bressan, E Peserico, L Pretto
arXiv preprint arXiv:1404.1864, 2014
82014
What does it mean to converge in rank
E Peserico, L Pretto
Proc. of ICTIR, 239-245, 2007
82007
A theoretical approach to link analysis algorithms, 2002
L Pretto
PhD Thesis, 0
8
HITS can converge slowly, but not too slowly, in score and rank
E Peserico, L Pretto
International Computing and Combinatorics Conference, 348-357, 2009
72009
Simple set cardinality estimation through random sampling
M Bressan, E Peserico, L Pretto
arXiv preprint arXiv:1512.07901, 2015
52015
Exploiting relevance assessment for the creation of an experimental test collection to evaluate systems that use annotations
M Agosti, T Coppotelli, N Ferro, L Pretto
DELOS, 195-202, 2007
52007
On approximating the stationary distribution of time-reversible Markov chains
M Bressan, E Peserico, L Pretto
Theory of Computing Systems, 1-23, 2018
32018
Annotations and digital libraries: Designing adequate test-beds
M Agosti, T Coppotelli, N Ferro, L Pretto
International Conference on Asian Digital Libraries, 150-159, 2007
32007
Sublinear algorithms for local graph centrality estimation
M Bressan, E Peserico, L Pretto
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
22018
Brief announcement: On approximating PageRank locally with sublinear query complexity
M Bressan, E Peserico, L Pretto
Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018
22018
The rank convergence of HITS can be slow
E Peserico, L Pretto
arXiv preprint arXiv:0807.3006, 2008
22008
Analysis of Web Link Analysis Algorithms: The Mathematics of Ranking
L Pretto
Information Access through Search Engines and Digital Libraries, 97-111, 2008
12008
An approach for the construction of an experimental test collection to evaluate search systems that exploit annotations
M Agosti, T Coppotelli, N Ferro, L Pretto
International DELOS Conference, 167-176, 2007
12007
HITS Can Converge Slowly, But Not Too Slowly, in Score and Rank
E Peserico, L Pretto
SIAM Journal on Discrete Mathematics 26 (3), 1189-1209, 2012
2012
The system can't perform the operation now. Try again later.
Articles 1–20