Mutual Exclusion with O(log^2 Log n) Amortized Work

DOI10.1109/FOCS.2011.84zbMath1292.68106OpenAlexW2112383564MaRDI QIDQ5494997

Seth Gilbert, Michael A. Bender

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2011.84

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Related Items

Tight Bounds for Asynchronous Renaming, Long-lived counters with polylogarithmic amortized step complexity, Recoverable mutual exclusion, Unnamed Item, Lower Bounds for Restricted-Use Objects, Allocate-On-Use Space Complexity of Shared-Memory Algorithms