An improved lower bound for the time complexity of mutual exclusion
From MaRDI portal
Recommendations
- An improved lower bound for the time complexity of mutual exclusion
- A time complexity lower bound for adaptive mutual exclusion
- Lower Bounds for Randomized Mutual Exclusion
- scientific article; zbMATH DE number 2006640
- An \({\Omega}(n\log n)\) lower bound on the cost of mutual exclusion
- Time bounds for mutual exclusion and related problems
- A tight RMR lower bound for randomized mutual exclusion
- A more efficient generalization of Peterson's mutual exclusion algorithm
- A mutual exclusion algorithm with optimally bounded bypasses
Cited in
(13)- A space- and time-efficient local-spin spin lock.
- Solo-valency and the cost of coordination
- Time bounds for mutual exclusion and related problems
- Lower Bounds for Randomized Mutual Exclusion
- A time complexity lower bound for adaptive mutual exclusion
- scientific article; zbMATH DE number 2006640 (Why is no real title available?)
- An improved lower bound for the time complexity of mutual exclusion
- Hundreds of impossibility results for distributed computing
- An \({\Omega}(n\log n)\) lower bound on the cost of mutual exclusion
- Tight time-space tradeoff for mutual exclusion
- Timing-based mutual exclusion with local spinning. (Extended abstract)
- Theory of Cryptography
- A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
This page was built for publication: An improved lower bound for the time complexity of mutual exclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2787670)
