Massimo Santini

Orcid: 0000-0003-1416-0673

Affiliations:
  • University of Milano, Italy


According to our database1, Massimo Santini authored at least 27 papers between 1998 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
BUbiNG: Massive Crawling for the Masses.
ACM Trans. Web, 2018

2015
Liquid FM: Recommending Music through Viscous Democracy.
Proceedings of the 6th Italian Information Retrieval Workshop, 2015

2011
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks.
Proceedings of the 20th International Conference on World Wide Web, 2011

2010
Random Generation and Approximate Counting of Combinatorial Structures
CoRR, 2010

2009
PageRank: Functional dependencies.
ACM Trans. Inf. Syst., 2009

Permuting Web and Social Graphs.
Internet Math., 2009

Permuting Web Graphs.
Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

2008
A large time-aware web graph.
SIGIR Forum, 2008

The number of convex permutominoes.
Inf. Comput., 2008

Temporal Evolution of the UK Web.
Proceedings of the Workshops Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

2007
A Deeper Investigation of PageRank as a Function of the Damping Factor.
Proceedings of the Web Information Retrieval and Linear Algebra Algorithms, 11.02., 2007

2006
A reference collection for web spam.
SIGIR Forum, 2006

Graph fibrations, graph isomorphism, and PageRank.
RAIRO Theor. Informatics Appl., 2006

Traps and Pitfalls of Topic-Biased PageRank.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

2005
Paradoxical Effects in PageRank Incremental Computations.
Internet Math., 2005

The language observatory project (LOP).
Proceedings of the 14th international conference on World Wide Web, 2005

PageRank as a function of the damping factor.
Proceedings of the 14th international conference on World Wide Web, 2005

2004
UbiCrawler: a scalable fully distributed Web crawler.
Softw. Pract. Exp., 2004

Approximation algorithms for a hierarchically structured bin packing problem.
Inf. Process. Lett., 2004

Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations.
Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

2002
Measuring with jugs.
Theor. Comput. Sci., 2002

2001
Random Generation for Finitely Ambiguous Context-free Languages.
RAIRO Theor. Informatics Appl., 2001

Trovatore: Towards a Highly Scalable Distributed Web Crawler.
Proceedings of the Poster Proceedings of the Tenth International World Wide Web Conference, 2001

On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.
Proceedings of the STACS 2001, 2001

2000
Clique polynomials have a unique root of smallest modulus.
Inf. Process. Lett., 2000

Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.
Proceedings of the STACS 2000, 2000

1998
A New Lower Bound on Approximability of the Ground State Problem for Tridimensional Ising Spin Glasses.
Inf. Process. Lett., 1998


  Loading...