Fully-Adaptive Algorithms for Long-Lived Renaming

DOI10.1007/11864219_29zbMATH Open1155.68325OpenAlexW1551716502MaRDI QIDQ3524322FDOQ3524322

Authors Alex Brodsky, Faith Ellen, Philipp Woelfel

Publication date 9 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11864219_29

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Fully-adaptive algorithms for long-lived renaming
• scientific article; zbMATH DE number 2006648
• scientific article; zbMATH DE number 1696672
• Wait-free algorithms for fast, long-lived renaming
• Long lived adaptive splitter and applications

Cited in

(11)

• Renaming in synchronous message passing systems with Byzantine failures
• Wait-free algorithms for fast, long-lived renaming
• Adaptive and efficient algorithms for lattice agreement and renaming
• Tight bounds for asynchronous renaming
• scientific article; zbMATH DE number 2006648 (Why is no real title available?)
• Fast, long-lived renaming improved and simplified
• A scalable lock-free stack algorithm
• Bounds on the shared memory requirements for long-lived \& adaptive objects (extended abstract)
• Fully-adaptive algorithms for long-lived renaming
• Strong order-preserving renaming in the synchronous message passing model
• scientific article; zbMATH DE number 1696672 (Why is no real title available?)

This page was built for publication: Fully-Adaptive Algorithms for Long-Lived Renaming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524322)