scientific article; zbMATH DE number 2006648

zbMATH Open1024.68900MaRDI QIDQ4436046FDOQ4436046

Authors: Michiko Inoue, Shinya Umetani, Toshimitsu Masuzawa, Hideo Fujiwara 

Publication date: 23 November 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2180/21800123.htm

Title of this publication is not available (Why is that?)

Recommendations

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Cited In (11)

• Randomized loose renaming in \(O(\log \log n)\) time
• Adaptive and efficient algorithms for lattice agreement and renaming
• Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement
• Wait-free algorithms for fast, long-lived renaming
• Optimal-time adaptive strong renaming, with applications to counting
• On the cost of uniform protocols whose memory consumption is adaptive to interval contention
• Title not available (Why is that?)
• Fully-Adaptive Algorithms for Long-Lived Renaming
• Bounds on the shared memory requirements for long-lived \& adaptive objects (extended abstract)
• A closer look at fault tolerance
• Fully-adaptive algorithms for long-lived renaming

This page was built for publication:

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