272 citations · 458 across the 8 of their papers we have counts for
1 paper · 1 filter
Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano +2
The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random r-SAT…