Sebastiano Vigna

Sebastiano Vigna's AcademicInfluence.com Rankings

Sebastiano Vigna

Computer Science

#4833

World Rank

#5102

Historical Rank

Database

#7391

World Rank

#7659

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Sebastiano Vigna Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Sebastiano Vigna is a professor of computer science at the University of Milan. He created the xorshift+ and xoroshiro128+ pseudorandom number generators. Xorshift128+ is used in the JavaScript engines of Chrome, Firefox, and Safari. In 1991, he received a laurea in Mathematics and in 1996 a Ph.D. in computer science; both from the University of Milan. He developed UbiCrawler, a web crawler, in a collaboration with others.

(See a Problem?)

Sebastiano Vigna's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

SciPy 1.0: fundamental algorithms for scientific computing in Python (2019) (12413)
The webgraph framework I: compression techniques (2004) (1214)
UbiCrawler: a scalable fully distributed Web crawler (2004) (621)
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks (2010) (597)
Four degrees of separation (2011) (551)
Author Correction: SciPy 1.0: fundamental algorithms for scientific computing in Python (2020) (443)
Axioms for Centrality (2013) (383)
The query-flow graph: model and applications (2008) (346)
A reference collection for web spam (2006) (247)
PageRank as a function of the damping factor (2005) (242)
Query suggestions using query-flow graphs (2009) (171)
Effective and Efficient Entity Search in RDF Data (2011) (133)
A large time-aware web graph (2008) (130)
Broadword Implementation of Rank/Select Queries (2008) (130)
Fibrations of graphs (2002) (122)
HyperANF: approximating the neighbourhood function of very large graphs on a budget (2010) (121)
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses (2009) (114)
Toward Reproducible Baselines: The Open-Source IR Reproducibility Challenge (2016) (111)
Graph structure in the web --- revisited: a trick of the heavy tail (2014) (104)
PageRank: Functional dependencies (2009) (103)
Symmetry Breaking in Anonymous Networks: Characterizations (1996) (100)
The Graph Structure in the Web - Analyzed on Different Aggregation Levels (2015) (97)
BUbiNG: massive crawling for the masses (2014) (91)
Quasi-succinct indices (2012) (85)
An Effective Characterization of Computability in Anonymous Networks (2001) (85)
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns (2009) (79)
Computing anonymously with arbitrary knowledge (1999) (75)
The Webgraph framework II: codes for the World-Wide Web (2004) (71)
Interactions of Cultures and Top People of Wikipedia from Ranking of 24 Language Editions (2014) (70)
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations (2004) (69)
A Weighted Correlation Index for Rankings with Ties (2014) (66)
Scrambled Linear Pseudorandom Number Generators (2018) (65)
Further scramblings of Marsaglia's xorshift generators (2014) (60)
Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs (1998) (58)
Viscous democracy for social networks (2011) (57)
Codes for the World Wide Web (2005) (56)
Fast Prefix Search in Little Space, with Applications (2010) (53)
An Experimental Exploration of Marsaglia's xorshift Generators, Scrambled (2014) (52)
Spectral ranking (2009) (52)
Theory and practice of monotone minimal perfect hashing (2011) (52)
On The Synchronic Structure of Transition Systems (1995) (51)
Graph fibrations, graph isomorphism, and PageRank (2006) (49)
MG4J at TREC 2005 (2005) (46)
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups (2005) (46)
Voting in social networks (2009) (44)
In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond (2013) (41)
Permuting Web Graphs (2009) (37)
Query reformulation mining: models, patterns, and applications (2011) (37)
Permuting Web and Social Graphs (2009) (34)
Temporal Evolution of the UK Web (2008) (32)
A note on recursive functions (1996) (28)
Dynamic Z-Fast Tries (2010) (27)
Robustness of social and web graphs to node removal (2013) (27)
Four Degrees of Separation, Really (2012) (26)
A Guided Tour in the Topos of Graphs (2003) (26)
Traps and Pitfalls of Topic-Biased PageRank (2007) (26)
Universal dynamic synchronous self–stabilization (2002) (25)
Fast Scalable Construction of (Minimal Perfect Hash) Functions (2016) (25)
RecSplit: Minimal Perfect Hashing via Recursive Splitting (2019) (23)
Theory and Practise of Monotone Minimal Perfect Hashing (2009) (23)
Computing vector functions on anonymous networks (1997) (22)
Trovatore: Towards a Highly Scalable Distributed Web Crawler (2001) (22)
Cache-Oblivious Peeling of Random Hypergraphs (2013) (22)
Robustness of Social Networks: Comparative Results Based on Distance Distributions (2011) (21)
Complexity of Deciding Sense of Direction (1999) (20)
Paradoxical Effects in PageRank Incremental Computations (2005) (19)
Rank monotonicity in centrality measures (2017) (18)
On Relating Some Models for Concurrency (1993) (18)
On the Relations between Distributive Computability and the BSS Model (1996) (16)
Equality is a Jump (1999) (16)
The language observatory project (LOP) (2005) (16)
TruRank: taking PageRank to the limit (2005) (15)
Mutable strings in Java: design, implementation and lightweight text-search algorithms (2005) (15)
Measuring with jugs (2002) (15)
Minimal Sense of Direction and Decision Problems for Cayley Graphs (1997) (13)
Social Media Analysis (2017) (13)
Distributed, large-scale latent semantic analysis by index interpolation (2008) (12)
TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT (2001) (11)
Self-stabilizing universal algorithms (1997) (11)
Graph structure in the web — Revisited, or a trick of the heavy tail. In WWW'14 Companion, pages 427−432 (2014) (10)
δ-uniform BSS Machines (1998) (10)
Fibonacci Binning (2013) (9)
It is high time we let go of the Mersenne Twister (2019) (9)
Applications of the Calculus of Trees to Process Description Languages (1991) (8)
Efficient Lazy Algorithms for Minimal-Interval Semantics (2006) (8)
On the Lattice of Antichains of Finite Intervals (2015) (8)
MG4J at TREC 2006 (2006) (8)
On the probability of overlap of random subsequences of pseudorandom number generators (2020) (7)
The Turing closure of an Archimedean field (2000) (7)
Introducing a Calculus of Trees (1991) (7)
Fast scalable construction of ([compressed] static | minimal perfect hash) functions (2020) (7)
BUbiNG (2018) (7)
Stanford Matrix Considered Harmful (2007) (6)
delta-Uniform BSS Machines (1998) (6)
Ultra-Large-Scale Repository Analysis via Graph Compression (2020) (5)
The Topos of Labelled Trees: A Categorical Semantics for SCCS (1997) (5)
Predecessor search with distance-sensitive query time (2012) (5)
Liquid FM: Recommending Music through Viscous Democracy (2015) (4)
The Push Algorithm for Spectral Ranking (2011) (4)
Lower bounds for (weak) sense of direction (2003) (4)
Efficient optimally lazy algorithms for minimal-interval semantics (2007) (4)
Specifying IMP(G) Using ASF+SDF: A Case Study (1995) (3)
(Web/Social) Graph Compression (2019) (3)
LXM: better splittable pseudorandom number generators (and almost as fast) (2021) (3)
Lower bounds for sense of direction in regular graphs (2003) (3)
On Some Constructions Which Preserve Sense of Direction (1996) (3)
Multirelational Semantics for ExtendedEntity-Relationship Schemata with Applications (2002) (3)
Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set (2009) (3)
A New Test for Hamming-Weight Dependencies (2021) (3)
Pictures from Mongolia - Partial Sorting in a Partial World (2007) (3)
Good Fibrations and Other Construction Which Preserve Sense of Direction (1996) (3)
Automatic generation of content management systems from EER-based specifications (2003) (2)
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs (2000) (2)
A Notion of Refinement for Automata (1993) (2)
On Relating Some Models for Concurrency 1 (1993) (2)
A Notion of Reenement for Automata (1993) (2)
Coverings that preserve sense of direction (2000) (2)
Trees in distributive categories (1991) (2)
Computationally easy, spectrally good multipliers for congruential pseudorandom number generators (2020) (2)
Compact Fenwick trees for dynamic ranking and selection (2019) (2)
A Tool for Optimal Weak Sense of Direction (2000) (1)
Holographic Trees (2002) (1)
Broadword Implementation of Parenthesis Queries (2013) (1)
An Automata-theoretic Approach to Concurrency through Distributive Categories: on Morphisms (1993) (1)
Spectral Rank Monotonicity on Undirected Networks (2022) (1)
Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search (2003) (1)
Reachability Problems in Entity-Relationship Schema Instances (2004) (1)
Author Correction: SciPy 1.0: fundamental algorithms for scientific computing in Python (2020) (1)
Compressed collections for simulated crawling (2008) (1)
Engineering Compressed Static Functions (2018) (1)
WebGraph: things you thought you could not do with Java™ (2004) (1)
Minimal Perfect Hash Functions (2016) (1)
Rethinking Java strings (2003) (1)
Monotonicity in Undirected Networks (2022) (0)
The Case for Kendall's Assortativity (2019) (0)
Distributive Computability (2003) (0)
delta-Approximable Functions (2000) (0)
WebGraph 1.1 (2006) (0)
MG4J (Managing Gigabyte for Java) 1.1 (2006) (0)
Equality Is a Jump Produced as Part of the Esprit Working Group in Neural and Computational Learning Ii, Neurocolt2 27150 (1998) (0)
Robustness of social and web graphs to node removal (2013) (0)
2 The Computation Models (2007) (0)
Compressed Static Functions and Minimal Perfect Hash Functions (2018) (0)
On Relating Some Models for (2005) (0)
Spiders on the web: a primer on web crawling (2004) (0)
δ-approximable Functions (2001) (0)
The internal extent formula for compacted tries (2010) (0)
Number and nodes : complexity in computer science (2017) (0)
Rank monotonicity in centrality measures—Corrigendum (2019) (0)
224 Internet Mathematics (2014) (0)
Towards an efficient implementation of distributive programs (1997) (0)
WebGraph 2.2 (2008) (0)
E = I + T: The internal extent formula for compacted tries (2010) (0)
On the Lattice of Antichains of Finite Intervals (2016) (0)
Supremum-Norm Convergence for Step-Asynchronous Successive Overrelaxation on M-matrices (2014) (0)
Kings, Name Days, Lazy Servants and Magic (2018) (0)
Monotone Minimal Perfect Hash Functions (2016) (0)
Special Issue on Searching and Mining the Web and Social Networks (2014) (0)

This paper list is powered by the following services:

Other Resources About Sebastiano Vigna

en.wikipedia.org

What Schools Are Affiliated With Sebastiano Vigna?

Sebastiano Vigna is affiliated with the following schools:

University of Milan