Massimo Santini
Orcid: 0000-0003-1416-0673Affiliations:
- University of Milano, Italy
  According to our database1,
  Massimo Santini
  authored at least 27 papers
  between 1998 and 2015.
  
  
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
- 
    on scopus.com
- 
    on orcid.org
- 
    on dl.acm.org
On csauthors.net:
Bibliography
  2015
    Proceedings of the 6th Italian Information Retrieval Workshop, 2015
    
  
  2014
    Proceedings of the 23rd International World Wide Web Conference, 2014
    
  
  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
  2009
    Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009
    
  
  2008
    Proceedings of the Workshops Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008
    
  
  2007
The Number of Convex Permutominoes.
  
    Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007
    
  
    Proceedings of the Web Information Retrieval and Linear Algebra Algorithms, 11.02., 2007
    
  
  2006
    RAIRO Theor. Informatics Appl., 2006
    
  
    Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006
    
  
  2005
    Proceedings of the 14th international conference on World Wide Web, 2005
    
  
    Proceedings of the 14th international conference on World Wide Web, 2005
    
  
  2004
    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
  2001
    RAIRO Theor. Informatics Appl., 2001
    
  
    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
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