21 citations · 42 across the 15 of their papers we have counts for
25 papers
Semi-Monotonicity for Spectral Centrality Measures
Paolo Boldi, Davide D'Ascenzo, Flavio Furia +1
Score monotonicity and rank monotonicity are properties describing the behavior of a centrality measure when an arc is added to a network: the former requires that the score of the…
Modular Rank and Linear-Complexity Tests for Pseudorandom Number Generators
Sebastiano Vigna
Standard batteries of tests for pseudorandom number generators (such as dieharder, the NIST suite, and TestU01) provide two empirical tests for linearity, the binary rank and linea…
Modern Minimal Perfect Hashing: A Survey
Hans-Peter Lehmann, Thomas Mueller, Rasmus Pagh +4
Given a set of keys, a perfect hash function for maps the keys in to the first integers without collisions. It may return an arbitrary result for any key…
ε-Cost Sharding: Scaling Hypergraph-Based Static Functions and Filters to Trillions of Keys
Sebastiano Vigna
We describe a simple and yet very scalable implementation of static functions (VFunc) and of static filters (VFilter) based on hypergraphs. We introduce the idea of ε-cost sharding…
Score and Rank Semi-Monotonicity for Closeness, Betweenness and Harmonic Centrality
Paolo Boldi, Davide D'Ascenzo, Flavio Furia +1
In the study of the behavior of centrality measures with respect to network modifications, score monotonicity means that adding an arc increases the centrality score of the target…
MS-BioGraphs: Sequence Similarity Graph Datasets
Mohsen Koohi Esfahani, Paolo Boldi, Hans Vandierendonck +2
Progress in High-Performance Computing in general, and High-Performance Graph Processing in particular, is highly dependent on the availability of publicly-accessible, relevant, an…