A New Lower Bound on Approximability of the Ground State Problem for Tridimensional Ising Spin Glasses. - Roberto Posenato; Massimo Santini 001 (Inf. Process. Lett., 1998)

Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures. - Alberto Bertoni; Massimiliano Goldwurm; Massimo Santini 001 (STACS, 2000)

Clique polynomials have a unique root of smallest modulus. - Massimiliano Goldwurm; Massimo Santini 001 (Inf. Process. Lett., 2000)

On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. - Massimiliano Goldwurm; Beatrice Palano; Massimo Santini 001 (STACS, 2001)

Trovatore: Towards a Highly Scalable Distributed Web Crawler. - Paolo Boldi; Bruno Codenotti; Massimo Santini 001; Sebastiano Vigna (WWW Posters, 2001)

Random Generation for Finitely Ambiguous Context-free Languages. - Alberto Bertoni; Massimiliano Goldwurm; Massimo Santini 001 (RAIRO Theor. Informatics Appl., 2001)

Measuring with jugs. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (Theor. Comput. Sci., 2002)

Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (WAW, 2004)

Approximation algorithms for a hierarchically structured bin packing problem. - Bruno Codenotti; Gianluca De Marco; Mauro Leoncini; Manuela Montangero; Massimo Santini 001 (Inf. Process. Lett., 2004)

UbiCrawler: a scalable fully distributed Web crawler. - Paolo Boldi; Bruno Codenotti; Massimo Santini 001; Sebastiano Vigna (Softw. Pract. Exp., 2004)

PageRank as a function of the damping factor. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (WWW, 2005)

The language observatory project (LOP). - Yoshiki Mikami; Pavol Zavarsky; Mohd Zaidi Abd Rozan; Izumi Suzuki; Masayuki Takahashi; Tomohide Maki; Irwan Nizan Ayob; Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (WWW (Special interest tracks and posters), 2005)

Paradoxical Effects in PageRank Incremental Computations. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (Internet Math., 2005)

Traps and Pitfalls of Topic-Biased PageRank. - Paolo Boldi; Roberto Posenato; Massimo Santini 001; Sebastiano Vigna (WAW, 2006)

Graph fibrations, graph isomorphism, and PageRank. - Paolo Boldi; Violetta Lonati; Massimo Santini 001; Sebastiano Vigna (RAIRO Theor. Informatics Appl., 2006)

A reference collection for web spam. - Carlos Castillo 001; Debora Donato; Luca Becchetti; Paolo Boldi; Stefano Leonardi 001; Massimo Santini 001; Sebastiano Vigna (SIGIR Forum, 2006)

A Deeper Investigation of PageRank as a Function of the Damping Factor. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (Web Information Retrieval and Linear Algebra Algorithms, 2007)

Temporal Evolution of the UK Web. - Ilaria Bordino; Paolo Boldi; Debora Donato; Massimo Santini 001; Sebastiano Vigna (ICDM Workshops, 2008)

The number of convex permutominoes. - Paolo Boldi; Violetta Lonati; Roberto Radicioni; Massimo Santini 001 (Inf. Comput., 2008)

A large time-aware web graph. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (SIGIR Forum, 2008)

Permuting Web Graphs. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (WAW, 2009)

Permuting Web and Social Graphs. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (Internet Math., 2009)

PageRank: Functional dependencies. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (ACM Trans. Inf. Syst., 2009)

Random Generation and Approximate Counting of Combinatorial Structures - Massimo Santini 001 (CoRR, 2010)

Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. - Paolo Boldi; Marco Rosa; Massimo Santini 001; Sebastiano Vigna (WWW, 2011)

Liquid FM: Recommending Music through Viscous Democracy. - Paolo Boldi; Corrado Monti; Massimo Santini 001; Sebastiano Vigna (IIR, 2015)

BUbiNG: Massive Crawling for the Masses. - Paolo Boldi; Andrea Marino 001; Massimo Santini 001; Sebastiano Vigna (ACM Trans. Web, 2018)