Optimal-time adaptive strong renaming, with applications to counting
10.1145/1993806.1993850
Saved in:
Main Authors: | Alistarh, D., Aspnes, J., Censor-Hillel, K., Gilbert, S., Zadimoghaddam, M. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/40517 |
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) -
SOME NEW RESULTS FOR DISTRIBUTED ALGORITHMS IN DYNAMIC NETWORKS
by: IRVAN JAHJA
Published: (2020) -
Of choices, failures and asynchrony: the many faces of set agreement
by: Alistarh, D., et al.
Published: (2013) -
Some lower bounds in dynamic networks with oblivious adversaries
by: I. Jahja, et al.
Published: (2021) -
Some lower bounds in dynamic networks with oblivious adversaries
by: I. Jahja, et al.
Published: (2021)