default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMassimo Santini 0001
Person information
- affiliation: University of Milano, Italy
Other persons with the same name
- Massimo Santini — disambiguation page
- Massimo Santini 0002 — Department of Heart Cardiac Diseases, San Filippo Neri Hospital, Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j14]Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna
:
BUbiNG: Massive Crawling for the Masses. ACM Trans. Web 12(2): 12:1-12:26 (2018)- 2016
- [i5]Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna:
BUbiNG: Massive Crawling for the Masses. CoRR abs/1601.06919 (2016) - 2015
- [c13]Paolo Boldi, Corrado Monti, Massimo Santini, Sebastiano Vigna:
Liquid FM: Recommending Music through Viscous Democracy. IIR 2015 - [i4]Paolo Boldi, Corrado Monti, Massimo Santini, Sebastiano Vigna:
Liquid FM: Recommending Music through Viscous Democracy. CoRR abs/1503.08604 (2015) - 2014
- [c12]Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna:
BUbiNG: massive crawling for the masses. WWW (Companion Volume) 2014: 227-228 - 2011
- [c11]Paolo Boldi, Marco Rosa, Massimo Santini, Sebastiano Vigna:
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. WWW 2011: 587-596 - 2010
- [i3]Paolo Boldi, Marco Rosa, Massimo Santini, Sebastiano Vigna:
Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. CoRR abs/1011.5425 (2010) - [i2]Massimo Santini:
Random Generation and Approximate Counting of Combinatorial Structures. CoRR abs/1012.3000 (2010)
2000 – 2009
- 2009
- [j13]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
Permuting Web and Social Graphs. Internet Math. 6(3): 257-283 (2009) - [j12]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
PageRank: Functional dependencies. ACM Trans. Inf. Syst. 27(4): 19:1-19:23 (2009) - [c10]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
Permuting Web Graphs. WAW 2009: 116-126 - 2008
- [j11]Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini:
The number of convex permutominoes. Inf. Comput. 206(9-10): 1074-1083 (2008) - [j10]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
A large time-aware web graph. SIGIR Forum 42(2): 33-38 (2008) - [c9]Ilaria Bordino, Paolo Boldi, Debora Donato, Massimo Santini, Sebastiano Vigna:
Temporal Evolution of the UK Web. ICDM Workshops 2008: 909-918 - 2007
- [c8]Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini:
The Number of Convex Permutominoes. LATA 2007: 151-162 - [i1]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
A Deeper Investigation of PageRank as a Function of the Damping Factor. Web Information Retrieval and Linear Algebra Algorithms 2007 - 2006
- [j9]Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna:
Graph fibrations, graph isomorphism, and PageRank. RAIRO Theor. Informatics Appl. 40(2): 227-253 (2006) - [j8]Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, Sebastiano Vigna:
A reference collection for web spam. SIGIR Forum 40(2): 11-24 (2006) - [c7]Paolo Boldi, Roberto Posenato, Massimo Santini, Sebastiano Vigna:
Traps and Pitfalls of Topic-Biased PageRank. WAW 2006: 107-116 - 2005
- [j7]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
Paradoxical Effects in PageRank Incremental Computations. Internet Math. 2(3): 387-404 (2005) - [c6]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
PageRank as a function of the damping factor. WWW 2005: 557-566 - [c5]Yoshiki Mikami, Pavol Zavarsky, Mohd Zaidi Abd Rozan, Izumi Suzuki, Masayuki Takahashi, Tomohide Maki, Irwan Nizan Ayob, Paolo Boldi, Massimo Santini, Sebastiano Vigna:
The language observatory project (LOP). WWW (Special interest tracks and posters) 2005: 990-991 - 2004
- [j6]Bruno Codenotti, Gianluca De Marco, Mauro Leoncini, Manuela Montangero, Massimo Santini:
Approximation algorithms for a hierarchically structured bin packing problem. Inf. Process. Lett. 89(5): 215-221 (2004) - [j5]Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna:
UbiCrawler: a scalable fully distributed Web crawler. Softw. Pract. Exp. 34(8): 711-726 (2004) - [c4]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. WAW 2004: 168-180 - 2002
- [j4]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
Measuring with jugs. Theor. Comput. Sci. 282(2): 259-270 (2002) - 2001
- [j3]Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini:
Random Generation for Finitely Ambiguous Context-free Languages. RAIRO Theor. Informatics Appl. 35(6): 499-512 (2001) - [c3]Massimiliano Goldwurm, Beatrice Palano, Massimo Santini:
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. STACS 2001: 305-316 - [c2]Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna:
Trovatore: Towards a Highly Scalable Distributed Web Crawler. WWW Posters 2001 - 2000
- [j2]Massimiliano Goldwurm, Massimo Santini:
Clique polynomials have a unique root of smallest modulus. Inf. Process. Lett. 75(3): 127-132 (2000) - [c1]Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini:
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures. STACS 2000: 567-580
1990 – 1999
- 1998
- [j1]Roberto Posenato, Massimo Santini:
A New Lower Bound on Approximability of the Ground State Problem for Tridimensional Ising Spin Glasses. Inf. Process. Lett. 68(4): 167-171 (1998)
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:
