Fast timing-based algorithms
From MaRDI portal
Publication:5137323
DOI10.1007/s004460050020zbMath1448.68466OpenAlexW2056557562MaRDI QIDQ5137323
Publication date: 2 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004460050020
Related Items (1)
Cites Work
- Unnamed Item
- An axiomatic proof technique for parallel programs
- Bounds on shared memory for mutual exclusion
- Timing verification by successive approximation
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Proving Liveness Properties of Concurrent Programs
- Improving fast mutual exclusion
- Adaptive solutions to the mutual exclusion problem
This page was built for publication: Fast timing-based algorithms