Sciweavers

2 search results - page 1 / 1
» podc 1993
Sort
View
PODC
1993
ACM
13 years 9 months ago
On the Space Complexity of Randomized Synchronization
Faith Ellen Fich, Maurice Herlihy, Nir Shavit
PODC
1993
ACM
13 years 9 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld