default search action
Luca Pretto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Marco Bressan, Enoch Peserico, Luca Pretto:
Sublinear Algorithms for Local Graph-Centrality Estimation. SIAM J. Comput. 52(4): 968-1008 (2023) - 2020
- [j3]Marco Bressan
, Enoch Peserico, Luca Pretto:
On Approximating the Stationary Distribution of Time-Reversible Markov Chains. Theory Comput. Syst. 64(3): 444-466 (2020)
2010 – 2019
- 2018
- [c12]Marco Bressan, Enoch Peserico, Luca Pretto:
Sublinear Algorithms for Local Graph Centrality Estimation. FOCS 2018: 709-718 - [c11]Marco Bressan
Brief Announcement: On Approximating PageRank Locally with Sublinear Query Complexity. SPAA 2018: 87-89 - [c10]Marco Bressan
On Approximating the Stationary Distribution of Time-reversible Markov Chains. STACS 2018: 18:1-18:14 - [i5]Marco Bressan, Enoch Peserico, Luca Pretto:
On approximating the stationary distribution of time-reversible Markov chains. CoRR abs/1801.00196 (2018) - 2016
- [i4]Marco Bressan, Enoch Peserico, Luca Pretto:
The Power of Local Information in PageRank. CoRR abs/1604.00202 (2016) - 2015
- [i3]Marco Bressan, Enoch Peserico, Luca Pretto:
Simple set cardinality estimation through random sampling. CoRR abs/1512.07901 (2015) - 2014
- [i2]Marco Bressan, Enoch Peserico, Luca Pretto:
Approximating PageRank locally with sublinear query complexity. CoRR abs/1404.1864 (2014) - 2013
- [c9]Marco Bressan, Enoch Peserico, Luca Pretto:
The power of local information in PageRank. WWW (Companion Volume) 2013: 179-180 - 2012
- [j2]Enoch Peserico, Luca Pretto:
HITS Can Converge Slowly, But Not Too Slowly, in Score and Rank. SIAM J. Discret. Math. 26(3): 1189-1209 (2012) - 2011
- [c8]Marco Bressan
Local computation of PageRank: the ranking side. CIKM 2011: 631-640
2000 – 2009
- 2009
- [c7]Enoch Peserico, Luca Pretto:
HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank. COCOON 2009: 348-357 - [c6]Enoch Peserico, Luca Pretto:
Score and rank convergence of HITS. SIGIR 2009: 770-771 - 2008
- [p1]Luca Pretto:
Analysis of Web Link Analysis Algorithms: The Mathematics of Ranking. Information Access through Search Engines and Digital Libraries 2008: 97-111 - [i1]Enoch Peserico, Luca Pretto:
The rank convergence of HITS can be slow. CoRR abs/0807.3006 (2008) - 2007
- [c5]Maristella Agosti
An Approach for the Construction of an Experimental Test Collection to Evaluate Search Systems that Exploit Annotations. DELOS 2007: 167-176 - [c4]Massimo Melucci, Luca Pretto:
PageRank: When Order Changes. ECIR 2007: 581-588 - [c3]Maristella Agosti
Annotations and Digital Libraries: Designing Adequate Test-Beds. ICADL 2007: 150-159 - 2005
- [j1]Maristella Agosti
A Theoretical Study of a Generalized Version of Kleinberg's HITS Algorithm. Inf. Retr. 8(2): 219-243 (2005) - 2003
- [c2]Maristella Agosti, Luca Pretto:
Structural Properties of Kleinberg's HITS Algorithm. SEBD 2003: 449-458 - 2002
- [b1]Luca Pretto:
A theoretical approach to link analysis algorithms. University of Padua, Italy, 2002 - [c1]Luca Pretto:
A Theoretical Analysis of Google's PageRank. SPIRE 2002: 131-144
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: