Long-lived renaming made fast

DOI10.1145/224964.224986zbMath1373.68080OpenAlexW2114420741MaRDI QIDQ5361455

Mark Moir, Jaap-Henki Hoepman, Harry Buhrman, Juan A. Garay

Publication date: 29 September 2017

Published in: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/224964.224986

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (6)

On the uncontended complexity of anonymous agreement ⋮ Wait-free concurrent memory management by Create and Read until Deletion (CaRuD) ⋮ Long lived adaptive splitter and applications ⋮ An adaptive collect algorithm with applications ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ On the complexity of basic abstractions to implement consensus

This page was built for publication: Long-lived renaming made fast