Підписатись
Paolo Boldi
Paolo Boldi
Full Professor, Università degli Studi di Milano
Підтверджена електронна адреса в unimi.it
Назва
Посилання
Посилання
Рік
The webgraph framework I: compression techniques
P Boldi, S Vigna
Proceedings of the 13th international conference on World Wide Web, 595-602, 2004
16902004
Four degrees of separation
L Backstrom, P Boldi, M Rosa, J Ugander, S Vigna
Proceedings of the 4th annual ACM Web science conference, 33-42, 2012
9302012
Ubicrawler: A scalable fully distributed web crawler
P Boldi, B Codenotti, M Santini, S Vigna
Software: Practice and Experience 34 (8), 711-726, 2004
8192004
Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks
P Boldi, M Rosa, M Santini, S Vigna
Proceedings of the 20th international conference on World Wide Web, 587-596, 2011
8002011
Axioms for centrality
P Boldi, S Vigna
Internet Mathematics 10 (3-4), 222-262, 2014
5852014
The query-flow graph: model and applications
P Boldi, F Bonchi, C Castillo, D Donato, A Gionis, S Vigna
Proceedings of the 17th ACM conference on Information and knowledge …, 2008
4462008
Efficient semi-streaming algorithms for local triangle counting in massive graphs
L Becchetti, P Boldi, C Castillo, A Gionis
Proceedings of the 14th ACM SIGKDD international conference on Knowledge …, 2008
4232008
PageRank as a function of the damping factor
P Boldi, M Santini, S Vigna
Proceedings of the 14th international conference on World Wide Web, 557-566, 2005
3242005
A reference collection for web spam
C Castillo, D Donato, L Becchetti, P Boldi, S Leonardi, M Santini, S Vigna
ACM Sigir Forum 40 (2), 11-24, 2006
3102006
Query suggestions using query-flow graphs
P Boldi, F Bonchi, C Castillo, D Donato, S Vigna
Proceedings of the 2009 workshop on Web Search Click Data, 56-63, 2009
2072009
Fibrations of graphs
P Boldi, S Vigna
Discrete Mathematics 243 (1-3), 21-66, 2002
1822002
A large time-aware web graph
P Boldi, M Santini, S Vigna
ACM SIGIR Forum 42 (2), 33-38, 2008
1802008
BUbiNG: Massive crawling for the masses
P Boldi, A Marino, M Santini, S Vigna
ACM Transactions on the Web (TWEB) 12 (2), 1-26, 2018
1632018
HyperANF: Approximating the neighbourhood function of very large graphs on a budget
P Boldi, M Rosa, S Vigna
Proceedings of the 20th international conference on World Wide Web, 625-634, 2011
1562011
Injecting uncertainty in graphs for identity obfuscation
P Boldi, F Bonchi, A Gionis, T Tassa
arXiv preprint arXiv:1208.4145, 2012
1512012
Generalizing PageRank: Damping functions for link-based ranking algorithms
R Baeza-Yates, P Boldi, C Castillo
Proceedings of the 29th annual international ACM SIGIR conference on …, 2006
1462006
PageRank: functional dependencies
P Boldi, M Santini, S Vigna
ACM Transactions on Information Systems (TOIS) 27 (4), 1-23, 2009
1262009
Monotone Minimal Perfect Hashing: Searching a Sorted Table with O(1) Accesses
D Belazzougui, P Boldi, R Pagh, S Vigna
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
1262009
Symmetry Breaking in Anonymous Networks: Characterizations.
P Boldi, S Shammah, S Vigna, B Codenotti, P Gemmell, J Simon
ISTCS, 16-26, 1996
1221996
Efficient algorithms for large-scale local triangle counting
L Becchetti, P Boldi, C Castillo, A Gionis
ACM Transactions on Knowledge Discovery from Data (TKDD) 4 (3), 1-28, 2010
1092010
У даний момент система не може виконати операцію. Спробуйте пізніше.
Статті 1–20