Andrei Z. Broder, Danny Dolev
FOCS 1984
This article presents a solution to the first-come, first-enabled[Formulla Omitted]-exclusionproblem of Fischer et al. [1979]. Unlike their solution, thissolution does not use powerful read-modify-write synchronizationprimitives and requires only bounded shared memory. Use of the concurrent timestamp system of Dolevand Shavir [1989] is key in solving the problem within bounded sharedmemory. © 1994, ACM. All rights reserved.
Andrei Z. Broder, Danny Dolev
FOCS 1984
Danny Dolev, Ruediger Reischuk
PODC 1982
Danny Dolev, Cynthia Dwork, et al.
Journal of the ACM (JACM)
Flavju Cristian, Houtan Aghili, et al.
Information and Computation