| A theoretical analysis of Google’s PageRank L Pretto String Processing and Information Retrieval: 9th International Symposium …, 2002 | 74 | 2002 |
| A theoretical study of a generalized version of Kleinberg’s HITS algorithm M Agosti, L Pretto Information Retrieval 8 (2), 219-243, 2005 | 26 | 2005 |
| Local computation of PageRank: the ranking side M Bressan, L Pretto Proceedings of the 20th ACM international conference on Information and …, 2011 | 24 | 2011 |
| 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 | 17 | 2013 |
| Sublinear algorithms for local graph-centrality estimation M Bressan, E Peserico, L Pretto SIAM Journal on Computing 52 (4), 968-1008, 2023 | 15 | 2023 |
| PageRank: When order changes M Melucci, L Pretto Advances in Information Retrieval: 29th European Conference on IR Research …, 2007 | 14 | 2007 |
| Simple set cardinality estimation through random sampling M Bressan, E Peserico, L Pretto arXiv preprint arXiv:1512.07901, 2015 | 13 | 2015 |
| Score and rank convergence of HITS E Peserico, L Pretto Proceedings of the 32nd international ACM SIGIR conference on Research and …, 2009 | 13 | 2009 |
| On approximating the stationary distribution of time-reversible Markov chains M Bressan, E Peserico, L Pretto Theory of Computing Systems 64 (3), 444-466, 2020 | 11 | 2020 |
| Approximating pagerank locally with sublinear query complexity M Bressan, E Peserico, L Pretto arXiv preprint arXiv:1404.1864, 2014 | 11 | 2014 |
| What does it mean to converge in rank E Peserico, L Pretto Proc. of ICTIR, 239-245, 2007 | 9 | 2007 |
| HITS can converge slowly, but not too slowly, in score and rank E Peserico, L Pretto International Computing and Combinatorics Conference, 348-357, 2009 | 8 | 2009 |
| A theoretical approach to link analysis algorithms, 2002 L Pretto PhD Thesis, 0 | 7 | |
| 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 Conference 2007 Working Notes, 195-202, 2007 | 5 | 2007 |
| 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 | 3 | 2018 |
| 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 | 3 | 2012 |
| Analysis of web link analysis algorithms: The mathematics of ranking L Pretto Information Access through Search Engines and Digital Libraries, 97-111, 2008 | 3 | 2008 |
| Annotations and digital libraries: Designing adequate test-beds M Agosti, T Coppotelli, N Ferro, L Pretto Asian Digital Libraries. Looking Back 10 Years and Forging New Frontiers …, 2007 | 3 | 2007 |
| The rank convergence of HITS can be slow E Peserico, L Pretto arXiv preprint arXiv:0807.3006, 2008 | 2 | 2008 |
| 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 | | 2007 |
