Simulating reliable links with unreliable links in the presence of process crashes
From MaRDI portal
Publication:6570916
Cites work
- Automatically increasing the fault-tolerance of distributed algorithms
- Reaching approximate agreement in the presence of faults
- Renaming in an asynchronous environment
- Simulating reliable links with unreliable links in the presence of process crashes
- The impossibility of implementing reliable communication in the face of crashes
- Time, clocks, and the ordering of events in a distributed system
Cited in
(2)
This page was built for publication: Simulating reliable links with unreliable links in the presence of process crashes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570916)