Optimal-time adaptive strong renaming, with applications to counting

DOI10.1145/1993806.1993850zbMath1321.68454OpenAlexW1966074520MaRDI QIDQ2943401

Keren Censor-Hillel, Dan Alistarh, Seth Gilbert, Morteza Zadimoghaddam, James Aspnes

Publication date: 11 September 2015

Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/164269/files/camera-ready.pdf

zbMATH Keywords

lower boundsadaptive algorithmsdistributed computingshared memorysorting networksrenaming

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (6)

Tight Bounds for Asynchronous Renaming ⋮ Fully-adaptive algorithms for long-lived renaming ⋮ Efficient randomized test-and-set implementations ⋮ Unnamed Item ⋮ Lower Bounds for Restricted-Use Objects ⋮ Randomized consensus with regular registers

Cites Work

• Unnamed Item
• Gradient clock synchronization in dynamic networks
• Consensus algorithms with one-bit messages
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Broadcasting in dynamic radio networks
• Programming simultaneous actions using common knowledge
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Flooding time in edge-Markovian dynamic graphs
• Knowledge and common knowledge in a distributed environment
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
• Fault Tolerance in Networks of Bounded Degree
• Reaching Agreement in the Presence of Faults
• Perfectly secure message transmission
• Parsimonious flooding in dynamic graphs
• Optimal gradient clock synchronization in dynamic networks
• Almost-Everywhere Secure Computation

This page was built for publication: Optimal-time adaptive strong renaming, with applications to counting