Parallel and Distributed Systems Group

Computer Science Department of Telecom SudParis

Obstruction-Free Algorithms can be Practically Wait-Free

Reading group: Luigi Monteiro Santos Rangel presented "Obstruction-Free Algorithms can be Practically Wait-Free" (DISC'05) at 1A312 the 7/11/2025 at 11h00.