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

Gaia Carenini

2 indexed papers

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

Publications per year

2
26

Top categories

Complexity×2Algorithms×2Combinatorics×2Stats Theory×1

Frequent co-authors

Cameron Seth1×
Yuichi Yoshida1×

Research Timeline

2026
A quantitative container characterization of one-sided testability

The paper provides a quantitative characterization of size-oblivious one-sided testability in dense graphs using hypergraph containers, resolving a question in modern combinatorics.

Ranked spreadness and sample-based testing

This paper introduces ranked spreadness, a new structure for set systems that allows for width-free hitting and weighted-concentration theorems, and applies it to the simulation of nonadaptive property testers by sample-based testers.

Highlighted terms show continued research focus across papers

Papers

math.STcs.CCcs.DSTheoreticalRecentAug 4, 2026

Ranked spreadness and sample-based testing

Gaia Carenini

This paper introduces ranked spreadness, a new structure for set systems that allows for width-free hitting and weighted-concentration theorems, and applies it to the simulation of nonadaptive propert…

View →
math.COcs.CCcs.DSTheoretical
Recent
Aug 2, 2026

A quantitative container characterization of one-sided testability

Gaia Carenini, Cameron Seth, Yuichi Yoshida

The paper provides a quantitative characterization of size-oblivious one-sided testability in dense graphs using hypergraph containers, resolving a question in modern combinatorics.

View →