Obserwuj
Sebastiano Vigna
Sebastiano Vigna
Dipartimento di Informatica, Università degli Studi di Milano
Zweryfikowany adres z unimi.it - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
SciPy 1.0: fundamental algorithms for scientific computing in Python
P Virtanen, R Gommers, TE Oliphant, M Haberland, T Reddy, ...
Nature methods 17 (3), 261-272, 2020
344812020
The webgraph framework I: compression techniques
P Boldi, S Vigna
Proceedings of the 13th international conference on World Wide Web, 595-602, 2004
16872004
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
9372012
Ubicrawler: A scalable fully distributed web crawler
P Boldi, B Codenotti, M Santini, S Vigna
Software: Practice and Experience 34 (8), 711-726, 2004
8242004
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
7972011
Axioms for centrality
P Boldi, S Vigna
Internet Mathematics 10 (3-4), 222-262, 2014
5922014
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
4502008
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
3272005
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
3122006
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
2052009
Broadword implementation of rank/select queries
S Vigna
Experimental Algorithms, 154-168, 2008
1842008
A large time-aware web graph
P Boldi, M Santini, S Vigna
ACM SIGIR Forum 42 (2), 33-38, 2008
1812008
Fibrations of graphs
P Boldi, S Vigna
Discrete Mathematics 243 (1-3), 21-66, 2002
1812002
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
1672014
Effective and efficient entity search in RDF data
R Blanco, P Mika, S Vigna
The Semantic Web–ISWC 2011: 10th International Semantic Web Conference, Bonn …, 2011
1602011
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
1592011
BUbiNG: Massive Crawling for the Masses
P Boldi, A Marino, M Santini, S Vigna
158*
Scrambled linear pseudorandom number generators
D Blackman, S Vigna
ACM Transactions on Mathematical Software (TOMS) 47 (4), 1-32, 2021
1572021
Quasi-succinct indices
S Vigna
Proceedings of the sixth ACM international conference on Web search and data …, 2013
1322013
The Graph Structure in the Web: Analyzed on Different Aggregation Levels
R Meusel, S Vigna, O Lehmberg, C Bizer
The Journal of Web Science 1 (1), 33-47, 2015
1312015
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20