Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastiano Vigna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j48]Guy L. Steele Jr.
, Sebastiano Vigna:
Computationally easy, spectrally good multipliers for congruential pseudorandom number generators. Softw. Pract. Exp. 52(2): 443-458 (2022)- [j47]David Blackman, Sebastiano Vigna:
A New Test for Hamming-Weight Dependencies. ACM Trans. Model. Comput. Simul. 32(3): 19:1-19:13 (2022) - [i38]Paolo Boldi, Flavio Furia, Sebastiano Vigna:
Spectral Rank Monotonicity on Undirected Networks. CoRR abs/2202.01044 (2022) - [i37]Paolo Boldi, Flavio Furia, Sebastiano Vigna:
Monotonicity in Undirected Networks. CoRR abs/2207.06218 (2022) - 2021
- [j46]Guy L. Steele Jr., Sebastiano Vigna:
LXM: better splittable pseudorandom number generators (and almost as fast). Proc. ACM Program. Lang. 5(OOPSLA): 1-31 (2021) - [j45]David Blackman, Sebastiano Vigna:
Scrambled Linear Pseudorandom Number Generators. ACM Trans. Math. Softw. 47(4): 36:1-36:32 (2021) - [c69]Paolo Boldi, Flavio Furia, Sebastiano Vigna:
Spectral Rank Monotonicity on Undirected Networks. COMPLEX NETWORKS 2021: 234-246 - [i36]David Blackman, Sebastiano Vigna:
A New Test for Hamming-Weight Dependencies. CoRR abs/2108.13061 (2021) - 2020
- [j44]Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna:
Fast scalable construction of ([compressed] static | minimal perfect hash) functions. Inf. Comput. 273: 104517 (2020) - [j43]Sebastiano Vigna:
On the probability of overlap of random subsequences of pseudorandom number generators. Inf. Process. Lett. 158: 105939 (2020) - [j42]Stefano Marchini, Sebastiano Vigna:
Compact Fenwick trees for dynamic ranking and selection. Softw. Pract. Exp. 50(7): 1184-1202 (2020) - [c68]Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna:
RecSplit: Minimal Perfect Hashing via Recursive Splitting. ALENEX 2020: 175-185 - [c67]Paolo Boldi, Antoine Pietri, Sebastiano Vigna, Stefano Zacchiroli:
Ultra-Large-Scale Repository Analysis via Graph Compression. SANER 2020: 184-194 - [i35]Guy L. Steele Jr., Sebastiano Vigna:
Computationally easy, spectrally good multipliers for congruential pseudorandom number generators. CoRR abs/2001.05304 (2020)
2010 – 2019
- 2019
- [j41]Paolo Boldi, Sebastiano Vigna:
Rank monotonicity in centrality measures - Corrigendum. Netw. Sci. 7(2): 265-268 (2019) - [c66]Paolo Boldi, Sebastiano Vigna:
The Case for Kendall's Assortativity. COMPLEX NETWORKS (2) 2019: 291-302 - [r3]Paolo Boldi, Sebastiano Vigna:
(Web/Social) Graph Compression. Encyclopedia of Big Data Technologies 2019 - [i34]Stefano Marchini, Sebastiano Vigna:
Compact Fenwick trees for dynamic ranking and selection. CoRR abs/1904.12370 (2019) - [i33]Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna:
RecSplit: Minimal Perfect Hashing via Recursive Splitting. CoRR abs/1910.06416 (2019) - [i32]Sebastiano Vigna:
It is high time we let go of the Mersenne Twister. CoRR abs/1910.06437 (2019) - 2018
- [j40]Paolo Boldi, Sebastiano Vigna:
On the Lattice of Antichains of Finite Intervals. Order 35(1): 57-81 (2018) - [j39]Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna:
BUbiNG: Massive Crawling for the Masses. ACM Trans. Web 12(2): 12:1-12:26 (2018) - [c65]Marco Genuzio, Sebastiano Vigna:
Engineering Compressed Static Functions. DCC 2018: 52-61 - [c64]Paolo Boldi, Sebastiano Vigna:
Kings, Name Days, Lazy Servants and Magic. FUN 2018: 10:1-10:13 - [i31]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Fast Prefix Search in Little Space, with Applications. CoRR abs/1804.04720 (2018) - [i30]David Blackman, Sebastiano Vigna:
Scrambled Linear Pseudorandom Number Generators. CoRR abs/1805.01407 (2018) - 2017
- [j38]Sebastiano Vigna:
Further scramblings of Marsaglia's xorshift generators. J. Comput. Appl. Math. 315: 175-181 (2017) - [j37]Paolo Boldi, Alessandro Luongo, Sebastiano Vigna:
Rank monotonicity in centrality measures. Netw. Sci. 5(4): 529-550 (2017) - 2016
- [j36]Sebastiano Vigna:
Spectral ranking. Netw. Sci. 4(4): 433-445 (2016) - [j35]Paolo Boldi, Sebastiano Vigna:
Efficient optimally lazy algorithms for minimal-interval semantics. Theor. Comput. Sci. 648: 8-25 (2016) - [j34]Sebastiano Vigna:
An Experimental Exploration of Marsaglia's xorshift Generators, Scrambled. ACM Trans. Math. Softw. 42(4): 30:1-30:23 (2016) - [c63]Jimmy Lin, Matt Crane, Andrew Trotman, Jamie Callan, Ishan Chattopadhyaya, John Foley, Grant Ingersoll, Craig MacDonald, Sebastiano Vigna:
Toward Reproducible Baselines: The Open-Source IR Reproducibility Challenge. ECIR 2016: 408-420 - [c62]Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna:
Fast Scalable Construction of (Minimal Perfect Hash) Functions. SEA 2016: 339-352 - [r2]Paolo Boldi, Sebastiano Vigna:
Minimal Perfect Hash Functions. Encyclopedia of Algorithms 2016: 1291-1294 - [r1]Paolo Boldi, Sebastiano Vigna:
Monotone Minimal Perfect Hash Functions. Encyclopedia of Algorithms 2016: 1349-1352 - [i29]Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna:
BUbiNG: Massive Crawling for the Masses. CoRR abs/1601.06919 (2016) - [i28]Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna:
Fast Scalable Construction of (Minimal Perfect Hash) Functions. CoRR abs/1603.04330 (2016) - 2015
- [j33]Robert Meusel, Sebastiano Vigna, Oliver Lehmberg, Christian Bizer:
The Graph Structure in the Web - Analyzed on Different Aggregation Levels. J. Web Sci. 1(1): 33-47 (2015) - [c61]Paolo Boldi, Corrado Monti, Massimo Santini, Sebastiano Vigna:
Liquid FM: Recommending Music through Viscous Democracy. IIR 2015 - [c60]Sebastiano Vigna:
A Weighted Correlation Index for Rankings with Ties. WWW 2015: 1166-1176 - [i27]Paolo Boldi, Corrado Monti, Massimo Santini, Sebastiano Vigna:
Liquid FM: Recommending Music through Viscous Democracy. CoRR abs/1503.08604 (2015) - 2014
- [j32]Nelly Litvak, Sebastiano Vigna:
Special Issue on Searching and Mining the Web and Social Networks. Internet Math. 10(3-4): 219-221 (2014) - [j31]Paolo Boldi, Sebastiano Vigna:
Axioms for Centrality. Internet Math. 10(3-4): 222-262 (2014) - [c59]Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano, Rossano Venturini, Sebastiano Vigna:
Cache-Oblivious Peeling of Random Hypergraphs. DCC 2014: 352-361 - [c58]Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna:
BUbiNG: massive crawling for the masses. WWW (Companion Volume) 2014: 227-228 - [c57]Robert Meusel, Sebastiano Vigna, Oliver Lehmberg, Christian Bizer:
Graph structure in the web - revisited: a trick of the heavy tail. WWW (Companion Volume) 2014: 427-432 - [i26]Sebastiano Vigna:
An experimental exploration of Marsaglia's xorshift generators, scrambled. CoRR abs/1402.6246 (2014) - [i25]Sebastiano Vigna:
Further scramblings of Marsaglia's xorshift generators. CoRR abs/1404.0390 (2014) - [i24]Sebastiano Vigna:
A Weighted Correlation Index for Rankings with Ties. CoRR abs/1404.3325 (2014) - [i23]Sebastiano Vigna:
Supremum-Norm Convergence for Step-Asynchronous Successive Overrelaxation on M-matrices. CoRR abs/1404.3327 (2014) - [i22]Young-Ho Eom, Pablo Aragón, David Laniado, Andreas Kaltenbrunner, Sebastiano Vigna, Dima Shepelyansky:
Interactions of cultures and top people of Wikipedia from ranking of 24 language editions. CoRR abs/1405.7183 (2014) - 2013
- [j30]Paolo Boldi, Marco Rosa, Sebastiano Vigna:
Robustness of social and web graphs to node removal. Soc. Netw. Anal. Min. 3(4): 829-842 (2013) - [c56]Paolo Boldi, Sebastiano Vigna:
In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond. ICDM Workshops 2013: 621-628 - [c55]Sebastiano Vigna:
Quasi-succinct indices. WSDM 2013: 83-92 - [i21]Sebastiano Vigna:
Broadword Implementation of Parenthesis Queries. CoRR abs/1301.5468 (2013) - [i20]Paolo Boldi, Sebastiano Vigna:
Axioms for Centrality. CoRR abs/1308.2140 (2013) - [i19]Paolo Boldi, Sebastiano Vigna:
In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond. CoRR abs/1308.2144 (2013) - [i18]Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano, Rossano Venturini, Sebastiano Vigna:
Cache-Oblivious Peeling of Random Hypergraphs. CoRR abs/1312.0526 (2013) - [i17]Sebastiano Vigna:
Fibonacci Binning. CoRR abs/1312.3749 (2013) - 2012
- [c54]Paolo Boldi, Sebastiano Vigna:
Four Degrees of Separation, Really. ASONAM 2012: 1222-1227 - [c53]Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano Vigna:
Four degrees of separation. WebSci 2012: 33-42 - [i16]Paolo Boldi, Sebastiano Vigna:
Four Degrees of Separation, Really. CoRR abs/1205.5509 (2012) - [i15]Sebastiano Vigna:
Quasi-Succinct Indices. CoRR abs/1206.4300 (2012) - [i14]Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna:
Predecessor search with distance-sensitive query time. CoRR abs/1209.5441 (2012) - 2011
- [j29]Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna:
Viscous democracy for social networks. Commun. ACM 54(6): 129-137 (2011) - [j28]Paolo Boldi, Sebastiano Vigna:
E=I+T: The internal extent formula for compacted tries. Inf. Process. Lett. 111(7): 310-313 (2011) - [j27]Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna:
Query reformulation mining: models, patterns, and applications. Inf. Retr. 14(3): 257-289 (2011) - [j26]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Theory and practice of monotone minimal perfect hashing. ACM J. Exp. Algorithmics 16 (2011) - [c52]Roi Blanco, Peter Mika, Sebastiano Vigna:
Effective and Efficient Entity Search in RDF Data. ISWC (1) 2011: 83-97 - [c51]Paolo Boldi, Marco Rosa, Sebastiano Vigna:
Robustness of Social Networks: Comparative Results Based on Distance Distributions. SocInfo 2011: 8-21 - [c50]Paolo Boldi, Marco Rosa, Massimo Santini, Sebastiano Vigna:
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. WWW 2011: 587-596 - [c49]Paolo Boldi, Marco Rosa, Sebastiano Vigna:
HyperANF: approximating the neighbourhood function of very large graphs on a budget. WWW 2011: 625-634 - [i13]Paolo Boldi, Sebastiano Vigna:
The Push Algorithm for Spectral Ranking. CoRR abs/1109.4680 (2011) - [i12]Paolo Boldi, Marco Rosa, Sebastiano Vigna:
Robustness of Social Networks: Comparative Results Based on Distance Distributions. CoRR abs/1110.4474 (2011) - [i11]Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano Vigna:
Four Degrees of Separation. CoRR abs/1111.4570 (2011) - 2010
- [c48]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Fast Prefix Search in Little Space, with Applications. ESA (1) 2010: 427-438 - [c47]Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna:
Dynamic Z-Fast Tries. SPIRE 2010: 159-172 - [i10]Paolo Boldi, Marco Rosa, Massimo Santini, Sebastiano Vigna:
Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. CoRR abs/1011.5425 (2010) - [i9]Paolo Boldi, Marco Rosa, Sebastiano Vigna:
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget. CoRR abs/1011.5599 (2010) - [i8]Paolo Boldi, Sebastiano Vigna:
E = I + T: The internal extent formula for compacted tries. CoRR abs/1012.3024 (2010)
2000 – 2009
- 2009
- [j25]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
Permuting Web and Social Graphs. Internet Math. 6(3): 257-283 (2009) - [j24]Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna:
Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set. Theory Comput. Syst. 44(2): 269-288 (2009) - [j23]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
PageRank: Functional dependencies. ACM Trans. Inf. Syst. 27(4): 19:1-19:23 (2009) - [c46]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Theory and Practise of Monotone Minimal Perfect Hashing. ALENEX 2009: 132-144 - [c45]Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna:
Voting in social networks. CIKM 2009: 777-786 - [c44]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. SODA 2009: 785-794 - [c43]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
Permuting Web Graphs. WAW 2009: 116-126 - [c42]Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna:
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns. Web Intelligence 2009: 183-190 - [c41]Paolo Boldi, Francesco Bonchi, Carlos Castillo, Debora Donato, Sebastiano Vigna:
Query suggestions using query-flow graphs. WSCD@WSDM 2009: 56-63 - [i7]Sebastiano Vigna:
Spectral Ranking. CoRR abs/0912.0238 (2009) - 2008
- [j22]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
A large time-aware web graph. SIGIR Forum 42(2): 33-38 (2008) - [j21]Alessio Orlandi, Sebastiano Vigna:
Compressed collections for simulated crawling. SIGIR Forum 42(2): 39-44 (2008) - [c40]Paolo Boldi, Francesco Bonchi, Carlos Castillo, Debora Donato, Aristides Gionis, Sebastiano Vigna:
The query-flow graph: model and applications. CIKM 2008: 609-618 - [c39]Ilaria Bordino, Paolo Boldi, Debora Donato, Massimo Santini, Sebastiano Vigna:
Temporal Evolution of the UK Web. ICDM Workshops 2008: 909-918 - [c38]Sebastiano Vigna:
Distributed, large-scale latent semantic analysis by index interpolation. Infoscale 2008: 18 - [c37]Sebastiano Vigna:
Broadword Implementation of Rank/Select Queries. WEA 2008: 154-168 - 2007
- [c36]Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna:
Pictures from Mongolia - Partial Sorting in a Partial World. FUN 2007: 66-77 - [i6]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
A Deeper Investigation of PageRank as a Function of the Damping Factor. Web Information Retrieval and Linear Algebra Algorithms 2007 - [i5]Sebastiano Vigna:
Stanford Matrix Considered Harmful. Web Information Retrieval and Linear Algebra Algorithms 2007 - [i4]Sebastiano Vigna, Paolo Boldi:
Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics. CoRR abs/0710.1525 (2007) - [i3]Sebastiano Vigna:
Stanford Matrix Considered Harmful. CoRR abs/0710.1962 (2007) - 2006
- [j20]Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna:
Graph fibrations, graph isomorphism, and PageRank. RAIRO Theor. Informatics Appl. 40(2): 227-253 (2006) - [j19]Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, Sebastiano Vigna:
A reference collection for web spam. SIGIR Forum 40(2): 11-24 (2006) - [c35]Paolo Boldi, Sebastiano Vigna:
Efficient Lazy Algorithms for Minimal-Interval Semantics. SPIRE 2006: 134-149 - [c34]Paolo Boldi, Sebastiano Vigna:
MG4J at TREC 2006. TREC 2006 - [c33]Paolo Boldi, Roberto Posenato, Massimo Santini, Sebastiano Vigna:
Traps and Pitfalls of Topic-Biased PageRank. WAW 2006: 107-116 - 2005
- [j18]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
Paradoxical Effects in PageRank Incremental Computations. Internet Math. 2(3): 387-404 (2005) - [j17]Paolo Boldi, Sebastiano Vigna:
Codes for the World Wide Web. Internet Math. 2(4): 407-429 (2005) - [j16]Paolo Boldi, Sebastiano Vigna:
Mutable strings in Java: design, implementation and lightweight text-search algorithms. Sci. Comput. Program. 54(1): 3-23 (2005) - [c32]Paolo Boldi, Sebastiano Vigna:
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups. SPIRE 2005: 25-28 - [c31]Paolo Boldi, Sebastiano Vigna:
MG4J at TREC 2005. TREC 2005 - [c30]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
PageRank as a function of the damping factor. WWW 2005: 557-566 - [c29]Sebastiano Vigna:
TruRank: taking PageRank to the limit. WWW (Special interest tracks and posters) 2005: 976-977 - [c28]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). WWW (Special interest tracks and posters) 2005: 990-991 - 2004
- [j15]Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna:
UbiCrawler: a scalable fully distributed Web crawler. Softw. Pract. Exp. 34(8): 711-726 (2004) - [c27]Paolo Boldi, Sebastiano Vigna:
The WebGraph Framework II: Codes For The World-Wide Web. Data Compression Conference 2004: 528 - [c26]Sebastiano Vigna:
Reachability Problems in Entity-Relationship Schema Instances. ER 2004: 96-109 - [c25]Paolo Boldi, Sebastiano Vigna:
WebGraph: things you thought you could not do with Java™. PPPJ 2004: 1-8 - [c24]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. WAW 2004: 168-180 - [c23]Paolo Boldi, Sebastiano Vigna:
The webgraph framework I: compression techniques. WWW 2004: 595-602 - 2003
- [j14]Paolo Boldi, Sebastiano Vigna:
Lower bounds for sense of direction in regular graphs. Distributed Comput. 16(4): 279-286 (2003) - [j13]Paolo Boldi, Sebastiano Vigna:
Lower bounds for weak sense of direction. J. Discrete Algorithms 1(2): 119-128 (2003) - [c22]Sebastiano Vigna:
Automatic Generation of Content Management Systems from EER-Based Specifications. ASE 2003: 259-262 - [c21]Paolo Boldi, Sebastiano Vigna:
Rethinking Java strings. PPPJ 2003: 27-30 - [i2]