71 citations · 239 across the 38 of their papers we have counts for
23 papers · 1 filter
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…
A New Test for Hamming-Weight Dependencies
David Blackman, Sebastiano Vigna
We describe a new statistical test for pseudorandom number generators (PRNGs). Our test can find bias induced by dependencies among the Hamming weights of the outputs of a PRNG, ev…
Computationally easy, spectrally good multipliers for congruential pseudorandom number generators
Guy Steele, Sebastiano Vigna
Congruential pseudorandom number generators rely on good multipliers, that is, integers that have good performance with respect to the spectral test. We provide lists of multiplier…
RecSplit: Minimal Perfect Hashing via Recursive Splitting
Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna
A minimal perfect hash function bijectively maps a key set out of a universe into the first natural numbers. Minimal perfect hash functions are used, for example, to…