Fast randomized test-and-set and renaming
10.1007/978-3-642-15763-9_9
Saved in:
Main Authors: | Alistarh, D., Attiya, H., Gilbert, S., Giurgiu, A., Guerraoui, R. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/40530 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Tight bounds for asynchronous renaming
by: Alistarh, D., et al.
Published: (2016) -
Optimal-time adaptive strong renaming, with applications to counting
by: Alistarh, D., et al.
Published: (2013) -
Generating fast indulgent algorithms
by: Alistarh, D., et al.
Published: (2013) -
Generating Fast Indulgent Algorithms
by: Alistarh, D., et al.
Published: (2013) -
Of choices, failures and asynchrony: the many faces of set agreement
by: Alistarh, D., et al.
Published: (2013)