Gaia Carenini
2 indexed papers
Publications per year
Top categories
Frequent co-authors
Research Timeline
The paper provides a quantitative characterization of size-oblivious one-sided testability in dense graphs using hypergraph containers, resolving a question in modern combinatorics.
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.
Papers
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 propert…