Search the dblp DataBase

Publications of Author

1. Massimo Santini, Andrea Tettamanzi
   Genetic Programming for Financial Time Series Prediction. [Citation Graph (0, 0)][DBLP]
   EuroGP, 2001, pp:361-370 [Conf]
   
2. Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini
   Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures. [Citation Graph (0, 0)][DBLP]
   STACS, 2000, pp:567-580 [Conf]
   
3. Massimiliano Goldwurm, Beatrice Palano, Massimo Santini
   On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   STACS, 2001, pp:305-316 [Conf]
   
4. Paolo Boldi, Massimo Santini, Sebastiano Vigna
   Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. [Citation Graph (0, 0)][DBLP]
   WAW, 2004, pp:168-180 [Conf]
   
5. Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna
   Trovatore: Towards a Highly Scalable Distributed Web Crawler. [Citation Graph (0, 0)][DBLP]
   WWW Posters, 2001, pp:- [Conf]
   
6. Paolo Boldi, Massimo Santini, Sebastiano Vigna
   PageRank as a function of the damping factor. [Citation Graph (0, 0)][DBLP]
   WWW, 2005, pp:557-566 [Conf]
   
7. 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). [Citation Graph (0, 0)][DBLP]
   WWW (Special interest tracks and posters), 2005, pp:990-991 [Conf]
   
8. Bruno Codenotti, Gianluca De Marco, Mauro Leoncini, Manuela Montangero, Massimo Santini
   Approximation algorithms for a hierarchically structured bin packing problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2004, v:89, n:5, pp:215-221 [Journal]
   
9. Massimiliano Goldwurm, Massimo Santini
   Clique polynomials have a unique root of smallest modulus. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:75, n:3, pp:127-132 [Journal]
   
10. Roberto Posenato, Massimo Santini
    A New Lower Bound on Approximability of the Ground State Problem for Tridimensional Ising Spin Glasses. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:4, pp:167-171 [Journal]
    
11. Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini
    Random Generation for Finitely Ambiguous Context-free Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:6, pp:499-512 [Journal]
    
12. Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, Sebastiano Vigna
    A reference collection for web spam. [Citation Graph (0, 0)][DBLP]
    SIGIR Forum, 2006, v:40, n:2, pp:11-24 [Journal]
    
13. Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna
    UbiCrawler: a scalable fully distributed Web crawler. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2004, v:34, n:8, pp:711-726 [Journal]
    
14. Paolo Boldi, Massimo Santini, Sebastiano Vigna
    Measuring with jugs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:282, n:2, pp:259-270 [Journal]
    
15. Paolo Boldi, Massimo Santini, Sebastiano Vigna
    A Deeper Investigation of PageRank as a Function of the Damping Factor. [Citation Graph (0, 0)][DBLP]
    Web Information Retrieval and Linear Algebra Algorithms, 2007, pp:- [Conf]
    
16. 
    Temporal Evolution of the UK Web. [Citation Graph (, )][DBLP]
    
    
17. 
    Traps and Pitfalls of Topic-Biased PageRank. [Citation Graph (, )][DBLP]
    
    
18. 
    Permuting Web Graphs. [Citation Graph (, )][DBLP]