Sebastiano Vigna
Sebastiano Vigna
Dipartimento di Informatica, Università degli Studi di Milano
Verified email at unimi.it - Homepage
TitleCited byYear
The webgraph framework I: compression techniques
P Boldi, S Vigna
Proceedings of the 13th international conference on World Wide Web, 595-602, 2004
10572004
Ubicrawler: A scalable fully distributed web crawler
P Boldi, B Codenotti, M Santini, S Vigna
Software: Practice and Experience 34 (8), 711-726, 2004
6432004
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
6172012
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
4502011
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
3612008
Axioms for centrality
P Boldi, S Vigna
Internet Mathematics 10 (3-4), 222-262, 2014
2892014
A reference collection for web spam
C Castillo, D Donato, L Becchetti, P Boldi, S Leonardi, M Santini, S Vigna
SIGIR forum 40 (2), 11-24, 2006
2642006
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
2502005
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
1642009
Effective and efficient entity search in RDF data
R Blanco, P Mika, S Vigna
International Semantic Web Conference, 83-97, 2011
1402011
Fibrations of graphs
P Boldi, S Vigna
Discrete Mathematics 243 (1-3), 21-66, 2002
1212002
A large time-aware web graph
P Boldi, M Santini, S Vigna
ACM SIGIR Forum 42 (2), 33-38, 2008
1152008
Broadword implementation of rank/select queries
S Vigna
Experimental Algorithms, 154-168, 2008
1142008
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
1132011
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
992009
Symmetry breaking in anonymous networks: Characterizations
P Boldi, B Codenotti, P Gemmell, S Shammah, J Simon, S Vigna
Proc. 4th Israeli Symposium on Theory of Computing and Systems, 16-26, 1996
991996
Graph structure in the web---revisited: a trick of the heavy tail
R Meusel, S Vigna, O Lehmberg, C Bizer
Proceedings of the companion publication of the 23rd international …, 2014
922014
From" dango" to" japanese cakes": Query reformulation models and patterns
P Boldi, F Bonchi, C Castillo, S Vigna
Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT'09. IEEE …, 2009
902009
Do your worst to make the best: Paradoxical effects in pagerank incremental computations
P Boldi, M Santini, S Vigna
Algorithms and Models for the Web-Graph, 168-180, 2004
89*2004
PageRank: Functional dependencies.
P Boldi, M Santini, S Vigna
ACM Trans. Inf. Syst. 27 (4), 19:1-19:23, 2009
872009
The system can't perform the operation now. Try again later.
Articles 1–20