2 citations · 6 across the 6 of their papers we have counts for
1 paper · 2 filters
Pierre Fraigniaud, Amos Korman, Yoav Rodeh
We analyze parallel algorithms in the context of exhaustive search over totally ordered sets. Imagine an infinite list of "boxes", with a "treasure" hidden in one of them, where th…