Summary: Optimal-Time Adaptive Strong Renaming,
with Applications to Counting
[Extended Abstract]
Dan Alistarh
EPFL
James Aspnes
Yale University
Keren Censor-Hillel
MIT
Seth Gilbert§
NUS
Morteza Zadimoghaddam
MIT
ABSTRACT
We give two new randomized algorithms for strong renam-
ing, both of which work against an adaptive adversary in
asynchronous shared memory. The first uses repeated sam-
pling over a sequence of arrays of decreasing size to assign
unique names to each of n processes with step complexity
O(log3

Source: Aspnes, James - Department of Computer Science, Yale University
Lynch, Nancy - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

Collections: Computer Technologies and Information Sciences