Tight bounds for asynchronous renaming
10.1145/2597630
Saved in:
Main Authors: | Alistarh, D., Aspnes, J., Censor-Hillel, K., Gilbert, S., Guerraoui, R. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2016
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/128452 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Optimal-time adaptive strong renaming, with applications to counting
by: Alistarh, D., et al.
Published: (2013) -
Tight bounds for the subspace sketch problem with applications
by: Li, Yi, et al.
Published: (2022) -
Of choices, failures and asynchrony: the many faces of set agreement
by: Alistarh, D., et al.
Published: (2013) -
Fast randomized test-and-set and renaming
by: Alistarh, D., et al.
Published: (2013) -
How to allocate tasks asynchronously
by: Alistarh, D., et al.
Published: (2013)