2 papers
cs.DS2026
Incremental Dominating Set
Ilan Doron Arad, Jonathan Gal, Seffi Naor
Dominating Set is a fundamental problem in graph theory: given a graph, find a minimum-weight subset of vertices such that every vertex is either selected or adjacent to a selected…
cs.CR2025
Majority is not Needed: A Counterstrategy to Selfish Mining
Jonathan Gal, Maytal B Szabo, Ori Rottenstreich
In the last few years several papers investigated selfish mine attacks, most of which assumed that every miner that is not part of the selfish mine pool will continue to mine hones…