Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Sebastiano Vigna

Sebastiano Vigna

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Combinatorics×1Discrete Math×1Algorithms×1

Frequent co-authors

Paolo Boldi1×

Research Timeline

2026
Modular Rank and Linear-Complexity Tests for Pseudorandom Number Generators

The paper introduces a modular version of rank and linear-complexity tests for pseudorandom number generators and provides a Rust program, modlin, to detect statistical bias in generators that are linear over larger fields.

The lattice of antichains of intervals: Dyck paths, level sets, and sweep dimension

The paper studies the structure and properties of the Clarke-Cormack-Burkowski lattice and its relation to Dyck words and random walks.

Highlighted terms show continued research focus across papers

Papers

math.COcs.DMTheoreticalRecentOct 30, 2026

The lattice of antichains of intervals: Dyck paths, level sets, and sweep dimension

Paolo Boldi, Sebastiano Vigna

The paper studies the structure and properties of the Clarke-Cormack-Burkowski lattice and its relation to Dyck words and random walks.

View →
cs.DSEmpiricalRecent
Jun 21, 2026

Modular Rank and Linear-Complexity Tests for Pseudorandom Number Generators

Sebastiano Vigna

The paper introduces a modular version of rank and linear-complexity tests for pseudorandom number generators and provides a Rust program, modlin, to detect statistical bias in generators that are lin…

View →