Applications of the Calculus of Trees to Process Description Languages. - Pierpaolo Degano; Stefano Kasangian; Sebastiano Vigna (Category Theory and Computer Science, 1991)

Introducing a Calculus of Trees. - Stefano Kasangian; Sebastiano Vigna (TAPSOFT, Vol.1, 1991)

A Notion of Refinement for Automata. - Nicoletta Sabadini; Sebastiano Vigna; Robert F. C. Walters (AMAST, 1993)

On Relating Some Models for Concurrency. - Pierpaolo Degano; Roberto Gorrieri; Sebastiano Vigna (TAPSOFT, 1993)

On the Complexity of Deciding Sense of Direction. - Paolo Boldi; Sebastiano Vigna (SIROCCO, 1995)

On The Synchronic Structure of Transition Systems. - Luca Bernardinello; Giorgio De Michelis; Katia Petruni; Sebastiano Vigna (STRICT, 1995)

Symmetry Breaking in Anonymous Networks: Characterizations. - Paolo Boldi; Shella Shammah; Sebastiano Vigna; Bruno Codenotti; Peter Gemmell; Janos Simon (ISTCS, 1996)

Good Fibrations and Other Construction Which Preserve Sense of Direction. - Paolo Boldi; Sebastiano Vigna (SIROCCO, 1996)

A Note on Recursive Functions. - Nicoletta Sabadini; Sebastiano Vigna; Robert F. C. Walters (Math. Struct. Comput. Sci., 1996)

On the Relations between Distributive Computability and the BSS Model. - Sebastiano Vigna (Theor. Comput. Sci., 1996)

Computing Vector Functions on Anonymous Networks. - Paolo Boldi; Sebastiano Vigna (PODC, 1997)

Self-stabilizing universal algorithms. - Paolo Boldi; Sebastiano Vigna (WSS, 1997)

The Topos of Labelled Trees: A Categorical Semantics for SCCS. - Stefano Kasangian; Sebastiano Vigna (Fundam. Informaticae, 1997)

Minimal Sense of Direction and Decision Problems for Cayley Graphs. - Paolo Boldi; Sebastiano Vigna (Inf. Process. Lett., 1997)

The Turing Closure of an Archimedean Field. - Paolo Boldi; Sebastiano Vigna (MCU (2), 1998)

delta-Uniform BSS Machines. - Paolo Boldi; Sebastiano Vigna (J. Complex., 1998)

Computing Anonymously with Arbitrary Knowledge. - Paolo Boldi; Sebastiano Vigna (PODC, 1999)

Equality is a Jump. - Paolo Boldi; Sebastiano Vigna (Theor. Comput. Sci., 1999)

delta-Approximable Functions. - Charles Meyssonnier; Paolo Boldi; Sebastiano Vigna (CCA, 2000)

Lower bounds for (weak) sense of direction. - Paolo Boldi; Sebastiano Vigna (SIROCCO, 2000)

More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs. - Paolo Boldi; Sebastiano Vigna (DISC, 2000)

Coverings that preserve sense of direction. - Paolo Boldi; Sebastiano Vigna (Inf. Process. Lett., 2000)

An Effective Characterization of Computability in Anonymous Networks. - Paolo Boldi; Sebastiano Vigna (DISC, 2001)

Trovatore: Towards a Highly Scalable Distributed Web Crawler. - Paolo Boldi; Bruno Codenotti; Massimo Santini 001; Sebastiano Vigna (WWW Posters, 2001)

Multirelational Semantics for ExtendedEntity-Relationship Schemata with Applications. - Sebastiano Vigna (ER, 2002)

Holographic Trees. - Paolo Boldi; Sebastiano Vigna (LATIN, 2002)

Universal dynamic synchronous self-stabilization. - Paolo Boldi; Sebastiano Vigna (Distributed Comput., 2002)

Fibrations of graphs. - Paolo Boldi; Sebastiano Vigna (Discret. Math., 2002)

Measuring with jugs. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (Theor. Comput. Sci., 2002)

Automatic Generation of Content Management Systems from EER-Based Specifications. - Sebastiano Vigna (ASE, 2003)

Rethinking Java strings. - Paolo Boldi; Sebastiano Vigna (PPPJ, 2003)

Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search - Paolo Boldi; Sebastiano Vigna (CoRR, 2003)

Distributive Computability - Sebastiano Vigna (CoRR, 2003)

Lower bounds for sense of direction in regular graphs. - Paolo Boldi; Sebastiano Vigna (Distributed Comput., 2003)

The WebGraph Framework II: Codes For The World-Wide Web. - Paolo Boldi; Sebastiano Vigna (Data Compression Conference, 2004)

Reachability Problems in Entity-Relationship Schema Instances. - Sebastiano Vigna (ER, 2004)

WebGraph: things you thought you could not do with Java™. - Paolo Boldi; Sebastiano Vigna (PPPJ, 2004)

Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (WAW, 2004)

The webgraph framework I: compression techniques. - Paolo Boldi; Sebastiano Vigna (WWW, 2004)

UbiCrawler: a scalable fully distributed Web crawler. - Paolo Boldi; Bruno Codenotti; Massimo Santini 001; Sebastiano Vigna (Softw. Pract. Exp., 2004)

Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups. - Paolo Boldi; Sebastiano Vigna (SPIRE, 2005)

MG4J at TREC 2005. - Paolo Boldi; Sebastiano Vigna (TREC, 2005)

PageRank as a function of the damping factor. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (WWW, 2005)

The language observatory project (LOP). - Yoshiki Mikami; Pavol Zavarsky; Mohd Zaidi Abd Rozan; Izumi Suzuki; Masayuki Takahashi; Tomohide Maki; Irwan Nizan Ayob; Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (WWW (Special interest tracks and posters), 2005)

TruRank: taking PageRank to the limit. - Sebastiano Vigna (WWW (Special interest tracks and posters), 2005)

Paradoxical Effects in PageRank Incremental Computations. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (Internet Math., 2005)

Codes for the World Wide Web. - Paolo Boldi; Sebastiano Vigna (Internet Math., 2005)

Mutable strings in Java: design, implementation and lightweight text-search algorithms. - Paolo Boldi; Sebastiano Vigna (Sci. Comput. Program., 2005)

Efficient Lazy Algorithms for Minimal-Interval Semantics. - Paolo Boldi; Sebastiano Vigna (SPIRE, 2006)

MG4J at TREC 2006. - Paolo Boldi; Sebastiano Vigna (TREC, 2006)

Traps and Pitfalls of Topic-Biased PageRank. - Paolo Boldi; Roberto Posenato; Massimo Santini 001; Sebastiano Vigna (WAW, 2006)

Graph fibrations, graph isomorphism, and PageRank. - Paolo Boldi; Violetta Lonati; Massimo Santini 001; Sebastiano Vigna (RAIRO Theor. Informatics Appl., 2006)

A reference collection for web spam. - Carlos Castillo 001; Debora Donato; Luca Becchetti; Paolo Boldi; Stefano Leonardi 001; Massimo Santini 001; Sebastiano Vigna (SIGIR Forum, 2006)

A Deeper Investigation of PageRank as a Function of the Damping Factor. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (Web Information Retrieval and Linear Algebra Algorithms, 2007)

Stanford Matrix Considered Harmful. - Sebastiano Vigna (Web Information Retrieval and Linear Algebra Algorithms, 2007)

Pictures from Mongolia - Partial Sorting in a Partial World. - Paolo Boldi; Flavio Chierichetti; Sebastiano Vigna (FUN, 2007)

The query-flow graph: model and applications. - Paolo Boldi; Francesco Bonchi; Carlos Castillo 001; Debora Donato; Aristides Gionis; Sebastiano Vigna (CIKM, 2008)

Temporal Evolution of the UK Web. - Ilaria Bordino; Paolo Boldi; Debora Donato; Massimo Santini 001; Sebastiano Vigna (ICDM Workshops, 2008)

Distributed, large-scale latent semantic analysis by index interpolation. - Sebastiano Vigna (Infoscale, 2008)

Broadword Implementation of Rank/Select Queries. - Sebastiano Vigna (WEA, 2008)

A large time-aware web graph. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (SIGIR Forum, 2008)

Compressed collections for simulated crawling. - Alessio Orlandi; Sebastiano Vigna (SIGIR Forum, 2008)

Theory and Practise of Monotone Minimal Perfect Hashing. - Djamal Belazzougui; Paolo Boldi; Rasmus Pagh; Sebastiano Vigna (ALENEX, 2009)

Voting in social networks. - Paolo Boldi; Francesco Bonchi; Carlos Castillo 001; Sebastiano Vigna (CIKM, 2009)

Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. - Djamal Belazzougui; Paolo Boldi; Rasmus Pagh; Sebastiano Vigna (SODA, 2009)

Permuting Web Graphs. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (WAW, 2009)

From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns. - Paolo Boldi; Francesco Bonchi; Carlos Castillo 001; Sebastiano Vigna (Web Intelligence, 2009)

Query suggestions using query-flow graphs. - Paolo Boldi; Francesco Bonchi; Carlos Castillo 001; Debora Donato; Sebastiano Vigna (WSCD@WSDM, 2009)

Permuting Web and Social Graphs. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (Internet Math., 2009)

Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set. - Paolo Boldi; Flavio Chierichetti; Sebastiano Vigna (Theory Comput. Syst., 2009)

PageRank: Functional dependencies. - Paolo Boldi; Massimo Santini 001; Sebastiano Vigna (ACM Trans. Inf. Syst., 2009)

Fast Prefix Search in Little Space, with Applications. - Djamal Belazzougui; Paolo Boldi; Rasmus Pagh; Sebastiano Vigna (ESA (1), 2010)

Dynamic Z-Fast Tries. - Djamal Belazzougui; Paolo Boldi; Sebastiano Vigna (SPIRE, 2010)

Effective and Efficient Entity Search in RDF Data. - Roi Blanco; Peter Mika; Sebastiano Vigna (ISWC (1), 2011)

Robustness of Social Networks: Comparative Results Based on Distance Distributions. - Paolo Boldi; Marco Rosa; Sebastiano Vigna (SocInfo, 2011)

Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. - Paolo Boldi; Marco Rosa; Massimo Santini 001; Sebastiano Vigna (WWW, 2011)

HyperANF: approximating the neighbourhood function of very large graphs on a budget. - Paolo Boldi; Marco Rosa; Sebastiano Vigna (WWW, 2011)

Viscous democracy for social networks. - Paolo Boldi; Francesco Bonchi; Carlos Castillo 001; Sebastiano Vigna (Commun. ACM, 2011)

The Push Algorithm for Spectral Ranking - Paolo Boldi; Sebastiano Vigna (CoRR, 2011)

E=I+T: The internal extent formula for compacted tries. - Paolo Boldi; Sebastiano Vigna (Inf. Process. Lett., 2011)

Query reformulation mining: models, patterns, and applications. - Paolo Boldi; Francesco Bonchi; Carlos Castillo 001; Sebastiano Vigna (Inf. Retr., 2011)

Theory and practice of monotone minimal perfect hashing. - Djamal Belazzougui; Paolo Boldi; Rasmus Pagh; Sebastiano Vigna (ACM J. Exp. Algorithmics, 2011)

Four Degrees of Separation, Really. - Paolo Boldi; Sebastiano Vigna (ASONAM, 2012)

Four degrees of separation. - Lars Backstrom; Paolo Boldi; Marco Rosa; Johan Ugander; Sebastiano Vigna (WebSci, 2012)

Predecessor search with distance-sensitive query time - Djamal Belazzougui; Paolo Boldi; Sebastiano Vigna (CoRR, 2012)

In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond. - Paolo Boldi; Sebastiano Vigna (ICDM Workshops, 2013)

Quasi-succinct indices. - Sebastiano Vigna (WSDM, 2013)

Fibonacci Binning. - Sebastiano Vigna (CoRR, 2013)

Broadword Implementation of Parenthesis Queries - Sebastiano Vigna (CoRR, 2013)

Robustness of social and web graphs to node removal. - Paolo Boldi; Marco Rosa; Sebastiano Vigna (Soc. Netw. Anal. Min., 2013)

Cache-Oblivious Peeling of Random Hypergraphs. - Djamal Belazzougui; Paolo Boldi; Giuseppe Ottaviano; Rossano Venturini; Sebastiano Vigna (DCC, 2014)

BUbiNG: massive crawling for the masses. - Paolo Boldi; Andrea Marino 001; Massimo Santini 001; Sebastiano Vigna (WWW (Companion Volume), 2014)

Graph structure in the web - revisited: a trick of the heavy tail. - Robert Meusel; Sebastiano Vigna; Oliver Lehmberg; Christian Bizer (WWW (Companion Volume), 2014)

Interactions of cultures and top people of Wikipedia from ranking of 24 language editions. - Young-Ho Eom; Pablo Aragón; David Laniado; Andreas Kaltenbrunner; Sebastiano Vigna; Dima Shepelyansky (CoRR, 2014)

Supremum-Norm Convergence for Step-Asynchronous Successive Overrelaxation on M-matrices. - Sebastiano Vigna (CoRR, 2014)

Axioms for Centrality. - Paolo Boldi; Sebastiano Vigna (Internet Math., 2014)

Special Issue on Searching and Mining the Web and Social Networks. - Nelly Litvak; Sebastiano Vigna (Internet Math., 2014)

Liquid FM: Recommending Music through Viscous Democracy. - Paolo Boldi; Corrado Monti; Massimo Santini 001; Sebastiano Vigna (IIR, 2015)

A Weighted Correlation Index for Rankings with Ties. - Sebastiano Vigna (WWW, 2015)

The Graph Structure in the Web - Analyzed on Different Aggregation Levels. - Robert Meusel; Sebastiano Vigna; Oliver Lehmberg; Christian Bizer (J. Web Sci., 2015)

Toward Reproducible Baselines: The Open-Source IR Reproducibility Challenge. - Jimmy Lin; Matt Crane; Andrew Trotman; Jamie Callan; Ishan Chattopadhyaya; John Foley; Grant Ingersoll; Craig MacDonald; Sebastiano Vigna (ECIR, 2016)

Fast Scalable Construction of (Minimal Perfect Hash) Functions. - Marco Genuzio; Giuseppe Ottaviano; Sebastiano Vigna (SEA, 2016)

Spectral ranking. - Sebastiano Vigna (Netw. Sci., 2016)

Efficient optimally lazy algorithms for minimal-interval semantics. - Paolo Boldi; Sebastiano Vigna (Theor. Comput. Sci., 2016)

An Experimental Exploration of Marsaglia's xorshift Generators, Scrambled. - Sebastiano Vigna (ACM Trans. Math. Softw., 2016)

Minimal Perfect Hash Functions. - Paolo Boldi; Sebastiano Vigna (Encyclopedia of Algorithms, 2016)

Monotone Minimal Perfect Hash Functions. - Paolo Boldi; Sebastiano Vigna (Encyclopedia of Algorithms, 2016)

Further scramblings of Marsaglia's xorshift generators. - Sebastiano Vigna (J. Comput. Appl. Math., 2017)

Rank monotonicity in centrality measures. - Paolo Boldi; Alessandro Luongo; Sebastiano Vigna (Netw. Sci., 2017)

Engineering Compressed Static Functions. - Marco Genuzio; Sebastiano Vigna (DCC, 2018)

Kings, Name Days, Lazy Servants and Magic. - Paolo Boldi; Sebastiano Vigna (FUN, 2018)

On the Lattice of Antichains of Finite Intervals. - Paolo Boldi; Sebastiano Vigna (Order, 2018)

The Case for Kendall's Assortativity. - Paolo Boldi; Sebastiano Vigna (COMPLEX NETWORKS (2), 2019)

It is high time we let go of the Mersenne Twister. - Sebastiano Vigna (CoRR, 2019)

Rank monotonicity in centrality measures - Corrigendum. - Paolo Boldi; Sebastiano Vigna (Netw. Sci., 2019)

(Web/Social) Graph Compression. - Paolo Boldi; Sebastiano Vigna (Encyclopedia of Big Data Technologies, 2019)

RecSplit: Minimal Perfect Hashing via Recursive Splitting. - Emmanuel Esposito; Thomas Mueller Graf; Sebastiano Vigna (ALENEX, 2020)

Ultra-Large-Scale Repository Analysis via Graph Compression. - Paolo Boldi; Antoine Pietri; Sebastiano Vigna; Stefano Zacchiroli (SANER, 2020)

Fast scalable construction of ([compressed] static | minimal perfect hash) functions. - Marco Genuzio; Giuseppe Ottaviano; Sebastiano Vigna (Inf. Comput., 2020)

On the probability of overlap of random subsequences of pseudorandom number generators. - Sebastiano Vigna (Inf. Process. Lett., 2020)

Compact Fenwick trees for dynamic ranking and selection. - Stefano Marchini; Sebastiano Vigna (Softw. Pract. Exp., 2020)

Spectral Rank Monotonicity on Undirected Networks. - Paolo Boldi; Flavio Furia; Sebastiano Vigna (COMPLEX NETWORKS, 2021)

LXM: better splittable pseudorandom number generators (and almost as fast). - Guy L. Steele Jr.; Sebastiano Vigna (Proc. ACM Program. Lang., 2021)

Scrambled Linear Pseudorandom Number Generators. - David Blackman; Sebastiano Vigna (ACM Trans. Math. Softw., 2021)

Computationally easy, spectrally good multipliers for congruential pseudorandom number generators. - Guy L. Steele Jr.; Sebastiano Vigna (Softw. Pract. Exp., 2022)

A New Test for Hamming-Weight Dependencies. - David Blackman; Sebastiano Vigna (ACM Trans. Model. Comput. Simul., 2022)

On Overcoming HPC Challenges of Trillion-Scale Real-World Graph Datasets. - Mohsen Koohi Esfahani; Paolo Boldi; Hans Vandierendonck; Peter Kilpatrick; Sebastiano Vigna (IEEE Big Data, 2023)

Score and Rank Semi-monotonicity for Closeness, Betweenness and Harmonic Centrality. - Paolo Boldi; Davide D'Ascenzo; Flavio Furia; Sebastiano Vigna (COMPLEX NETWORKS (3), 2023)

Dataset Announcement: MS-BioGraphs, Trillion-Scale Public Real-World Sequence Similarity Graphs. - Mohsen Koohi Esfahani; Paolo Boldi; Hans Vandierendonck; Peter Kilpatrick; Sebastiano Vigna (IISWC, 2023)

MS-BioGraphs: Sequence Similarity Graph Datasets. - Mohsen Koohi Esfahani; Paolo Boldi; Hans Vandierendonck; Peter Kilpatrick; Sebastiano Vigna (CoRR, 2023)

Monotonicity in undirected networks. - Paolo Boldi; Flavio Furia; Sebastiano Vigna (Netw. Sci., 2023)

Engineering Zuffix Arrays. - Paolo Boldi; Stefano Marchini; Sebastiano Vigna (SEA, 2024)

WebGraph: The Next Generation (Is in Rust). - Tommaso Fontana; Sebastiano Vigna; Stefano Zacchiroli (WWW (Companion Volume), 2024)

﻿Score and rank semi-monotonicity for closeness, betweenness, and distance-decay centralities. - Paolo Boldi; Davide D'Ascenzo; Flavio Furia; Sebastiano Vigna (Soc. Netw. Anal. Min., 2024)

Ten Years of Open Wikipedia Ranking. - Paolo Boldi; Flavio Furia; Sebastiano Vigna (WWW (Companion Volume), 2025)

ε-Cost Sharding: Scaling Hypergraph-Based Static Functions and Filters to Trillions of Keys. - Sebastiano Vigna (CoRR, 2025)

Modern Minimal Perfect Hashing: A Survey. - Hans-Peter Lehmann; Thomas Mueller; Rasmus Pagh; Giulio Ermanno Pibiri; Peter Sanders 001; Sebastiano Vigna; Stefan Walzer (CoRR, 2025)